Maintenance of maximal frequent itemsets in large databases

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2007, Pages 388-392

  Lian, Wang ^a   Cheung, David W ^b   Yiu, S M ^b  

^a MACAU UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Macao)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA MINING; DATA PRIVACY; PREVENTIVE MAINTENANCE; REAL TIME SYSTEMS; TREES (MATHEMATICS);

BITMAP DATABASE; LARGE DATABASES; MFI MINING ALGORITHM; REAL DATABASES;

DATABASE SYSTEMS;

EID: 35248836871     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1244002.1244094     Document Type: Conference Paper

References (14)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. VLDB, 1994.
2. N. Ayan, A. Tansel, and E. Arkun. An Efficient Algorithm to Update Large Itemsets with Early Pruning. In Proc. of the 5th ACM-SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining, 1999.
3. R.J. Bayardo. Efficiently Mining Long Patterns from Databases. SIGMOD, 1998.
4. C. Blake and C. Merz. UCI Repository of Machine Learning Databases, 1998. http://www.ics.uci.edu/mlearn/MLRepository.html.
5. S. Brin, R. Motwani, J. Ullman, and S. Tsur. Dynamic Itemset Counting and Implication Rules for Market Basket Data . In Proc. ACM-SIGMOD Int. Conf. Management of Data, 1997.
6. D. Burdick, M. Calimlim, J. Flannick, J. Gehrke and T. Yiu MAFIA: a maximal frequent itemset algorithm IEEE Transaction on Knowledge and Data Engineering, Vol. 17, No. 11, 2005.
7. D. Cheung, J. Han, V. Ng, and C. Y. Wong. Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique. In Proc. of the 12th Intl. Conf. on Data Engineering, 1996.
8. R. Feldman, Y. Aumann, A. Amir and H. Mannila. Efficient Algorithms for Discovering Frequent Sets in Incremental Databases. In Proc. of SIGMOD Work-Shop on Research Issues in Data Mining and Knowlwdge Discovery, 1997.
9. K. Gouda and M. J. Zaki. GenMax: An Efficient Algorithm for Mining Maximal Frequent Itemsets. Data Mining and Knowledge Discovery, Vol. 11, 2005.
10. R. Kohavi, C Brodley, B. Frasca, L. Mason and Z. Zheng. "KDD-Cup 2000 Organizers' Report: Peeling the Onion,". SIGKDD Explorations, Vol. 2, No. 2, 2000.
11. W. Lian, N. Mamoulis, D. Cheung and S. M. Yiu. Indexing Useful Structural Patterns for XML Query Processing. IEEE Transactions on Knowledge and Data Engine. Vol. 17, 2005.
12. J. S. Park, M. S. Chen and P. S. Yu. An effective hash-based algorithm for mining association rules. In Proc. ACM-SIGMOD Int. Conf. Management of Data, 1995.
13. S. Thomas, S. Bodagala, K. Alsabti and S. Ranka. An Efficient Algorithm for the Incremental Updation of Association Rules in Large Databases. In Proc. of the 3rd International conference on Knowledge Discovery and Data Mining, 1997.
14. A. Veloso, W. M., Jr., M. Carvalho, B. Possas, S. Parthasarathy and M. J. Zaki. Mining Frequent Itemsets in Evolving Databases. SIAM International Conference on Data Mining, 2002.