Array-Tree: A persistent data structure to compactly store frequent itemsets

2010 IEEE International Conference on Intelligent Systems, IS 2010 - Proceedings

Volumn , Issue , 2010, Pages 108-113

  Baralis, Elena ^a   Cerquitelli, Tania ^a   Chiusano, Silvia ^a   Grand, Alberto ^a  

^a POLITECNICO DI TORINO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DATA ITEMS; DATA REPLICATION; DATA SETS; FREQUENT ITEMSET MINING; FREQUENT ITEMSETS; ITEM SETS; RESEARCH ISSUES; SUBTREES; SYNTHETIC DATASETS; TREE DATA; USER QUERY;

DATA STRUCTURES; INTELLIGENT SYSTEMS; STRUCTURE (COMPOSITION);

TREES (MATHEMATICS);

EID: 77957844798     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IS.2010.5548388     Document Type: Conference Paper

References (17)

1. N. Agrawal, T. Imielinski, and A. Swami, "Database mining: A performance perspective," In IEEE Trans. on Knowledge and data Engineering, vol. 5, no. 6, December 1993.
2. R. Agrawal and R. Srikant, "Fast algorithms for mining association rules in large databases," in VLDB, 1994, pp. 487-499.
3. S. Bashir and A. Rauf Baig, "Performance analysis of frequent itemset mining using hybrid database representation approach," in Multitopic Conference, 2006. INMIC '06. IEEE, Dec. 2006, pp. 237-243.
4. D. Burdick, M. Calimlim, and J. Gehrke, "Mafia: A maximal frequent itemset algorithm for transactional databases," Data Engineering, International Conference on, vol. 0, p. 0443, 2001. (Pubitemid 32457146)
5. M. El-Hajj and O. R. Zaïane, "Cofi approach for mining frequent itemsets revisited," in DMKD '04: Proceedings of the 9th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery. New York, NY, USA: ACM, 2004, pp. 70-75.
6. FIMI, "http://fimi.cs.helsinki.fi/." [Online]. Available: http://fimi.cs.helsinki.fi/
7. G. Grahne and J. Zhu, "Efficiently using prefix-trees in mining frequent itemsets," in FIMI, 2003.
8. J. Han, Y. Fu, W. Wang, K. Koperski, and O. Zaiane, "Dmql: A data mining query language for relational databases," in DMKD, 1996.
9. J. Han, J. Pei, and Y. Yin, "Mining frequent patterns without candidate generation," in SIGMOD '00: Proceedings of the 2000 ACM SIGMOD international conference on Management of data. New York, NY, USA: ACM, 2000, pp. 1-12.
10. G. Liu, H. Lu, W. Lou, and J. X. Yu, "On computing, storing and querying frequent patterns," in KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. New York, NY, USA: ACM, 2003, pp. 607-612.
11. G. Liu, H. Lu, and J. Xu Yu, "Cfp-tree: A compact disk-based structure for storing and querying frequent itemsets," Inf. Syst., vol. 32, no. 2, pp. 295-319, 2007.
12. G. Liu, H. Lu, J. X. Yu, W. Wang, and X. Xiao, "Afopt: An efficient implementation of pattern growth approach," in FIMI, 2003.
13. A. Pietracaprina and D. Zandolin, "Mining frequent itemsets using patricia tries," in FIMI, 2003.
14. T. Uno, M. Kiyomi, and H. Arimura, "Lcm ver. 2: Efficient mining algorithms for frequent/closed/maximal itemsets," in FIMI, 2004.
15. -, "Lcm ver.3: collaboration of array, bitmap and prefix tree for frequent itemset mining," in OSDM '05: Proceedings of the 1st international workshop on open source data mining. New York, NY, USA: ACMs, 2005, pp. 77-86.
16. J. Wang, J. Han, and J. Pei, "Closet+: searching for the best strategies for mining frequent closed itemsets," in KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. New York, NY, USA: ACM, 2003, pp. 236-245.
17. M. J. Zaki, "Scalable algorithms for association mining," IEEE Trans. on Knowl. and Data Eng., vol. 12, no. 3, pp. 372-390, 2000.