Mining frequent itemsets (FIs) has been developing in recent years. However, little attention has been paid to efficient methods for mining in multidimensional databases. In this paper, we propose a new method with a supporting structure called AIO-tree (Attributes Itemset Object identifications-tree) for mining FIs from multidimensional databases. This method need not transform the database into the transaction database, and it is based on the intersections of object identifications for fast computing the support of itemsets. We compare our method to dEclat (after transformation to a transaction database) and indeed claim that they are faster than dEclat. © 2011 Springer Berlin Heidelberg.
CITATION STYLE
Vo, B., Le, B., & Nguyen, T. N. (2011). Mining frequent itemsets from multidimensional databases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6591 LNAI, pp. 177–186). Springer Verlag. https://doi.org/10.1007/978-3-642-20039-7_18
Mendeley helps you to discover research relevant for your work.