CBP: A new efficient method for mining multilevel and generalized frequent itemsets

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The taxonomy(is-a hierarchy) data exists widely in retail, geography, biology and financial area, so mining the multilevel and generalized association rules is one of the most important research task in data mining. Unlike the traditional algorithm, which is based on Apriori method, we propose a new CBP (correlation based partition) based method, to mine the multilevel and generalized frequent itemsets. This method uses the item's correlation as measurement to partition the transaction database from top to bottom. It can shorten the time of mining multilevel and generalized frequent itemsets by reducing the scanning scope of the transaction database. The experiments on the real-life financial transaction database show that the CBP based algorithms outperform the well-known Apriori based algorithms. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Mao, Y. X., & Le Shi, B. (2008). CBP: A new efficient method for mining multilevel and generalized frequent itemsets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5139 LNAI, pp. 691–698). Springer Verlag. https://doi.org/10.1007/978-3-540-88192-6_73

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free