Ascending frequency ordered prefix-tree: Efficient mining of frequent patterns

Proceedings - 8th International Conference on Database Systems for Advanced Applications, DASFAA 2003

Volumn , Issue , 2003, Pages 65-72

  Liu, Guimei ^a   Lu, Hongjun ^a   Xu, Yabo ^b   Yu, J X ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Computer science; Costs; Councils; Data mining; Frequency; Itemsets; Space exploration; Spatial databases; Transaction databases

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; COSTS; DATABASE SYSTEMS; FORESTRY; SPACE RESEARCH; TREES (MATHEMATICS);

COUNCILS; FREQUENCY; ITEM SETS; SPACE EXPLORATIONS; SPATIAL DATABASE; TRANSACTION DATABASE;

DATA MINING;

EID: 26944476750     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DASFAA.2003.1192369     Document Type: Conference Paper

References (18)

1. R. Agrawal, C. Aggarwal, and V. Prasad. Depth first generation of long patterns. In Proc. of ACM SIGKDD Conf., pages 108-118, 2000.
2. R. Agrawal, T. Imielinski, and A. N. Swami. Mining association rules between sets of items in large databases. In Proc. of ACM SIGMOD Conf., pages 207-216, 1993.
3. S. Brin, R. Motwani, J. D. Ullman, and S. Tsur. Dynamic itemset counting and implication rules for market basket data. In Proc. of ACM SIGMOD Conf., pages 255-264, 1997.
4. D. Burdick, M. Calimlim, and J. Gehrke. Mafia: A maximal frequent itemset algorithm for transactional databases. In Proc. of ICDE Conf., pages 443-452, 2001.
5. K. Gouda and M. J. Zaki. Efficiently mining maximal frequent itemsets. In Proc. of ICDM conf., pages 163-170, 2001.
6. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. of ACM SIGMOD Conf., pages 1-12, 2000.
7. R. J. B. Jr. Efficiently mining long patterns from databases. In Proc. of ACM SIGMOD Conf., pages 85-93, 1998.
8. J. Liu, Y. Pan, K. Wang, and J. Han. Mining frequent item sets by opportunistic projection. In Proc. of KDD Conf., 2002.
9. D. Meretakis, D. Fragoudis, H. Lu, and S. Likothanassis. Scalable association-based text classification. In Proc. of CIKM Conf., pages 5-11, 2000.
10. J. S. Park, M. Chen, and P. S. Yu. An effective hash based algorithm for mining association rules. In Proc. of ACM SIGMOD Conf., pages 175-186, 1995.
11. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In Proc. of ICDT Conf., pages 398-416, 1999.
12. J. Pei, J. Han, H. Lu, S. Nishio, S. Tang, and D. Yang. H-mine: Hyper-structure mining of frequent patterns in large databases. In Proc. of ICDM Conf., pages 441-448, 2001.
13. J. Pei, J. Han, and R. Mao. Closet: An efficient algorithm for mining frequent closed itemsets. In Proc. of ACM SIGMOD DMKD Workshop, pages 21-30, 2000.
14. R.C.Agarwal, C.C.Aggarwal, and V.V.V.Prasad. A tree projection algorithm for finding frequent itemsets. Journal on Parallel and Distributed Computing, 61(3):350-371, 2001.
15. A. Savasere, E. Omiecinski, and S. B. Navathe. An efficient algorithm for mining association rules in large databases. In Proc. of VLDB Conf., pages 432-444, 1995.
16. M. J. Zaki and C. Hsiao. Charm: An efficient algorithm for closed association rule mining. Technical report, Rensselaer Polytechnic Institute, 1999.
17. M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In Proc. of KDD Conf., pages 283-286, 1997.
18. Z. Zheng, R. Kohavi, and L. Mason. Real world performance of association rule algorithms. In Proc. of KDD Conf., pages 401-406, 2001.