期刊名称：International Journal of Advanced Networking and Applications
电子版ISSN：0975-0290
出版年度：2010
卷号：2
期号：1
页码：481-485
出版社：Eswar Publications
摘要：Several multi-pass algorithms have been proposed for Association Rule Mining from static repositories. However, such algorithms are incapable of online processing of transaction streams. In this paper we introduce an efficient single-pass algorithm for mining association rules, given a hierarchical classification amo ngst items. Processing efficiency is achieved by utilizing two optimizations, hierarchy aware counting and transaction reduction, which become possible in the context of hierarchical classification. We also propose a modified algorithm for the rule generation phase which avoids the construction of an explicit adjacency lattice.
