A new approach to mine frequent patterns using item-transformation methods

Information Systems

Volumn 32, Issue 7, 2007, Pages 1056-1072

  Wu, Fan ^a   Chiang, Shih Wen ^a   Lin, Jiunn Rong ^b  

^a NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

^b HUNGKUANG UNIVERSITY   (Taiwan)

Author keywords

Apriori; Data mining; Frequent pattern; Gray code; Item transformation

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DATA MINING; DATABASE SYSTEMS; LOGIC CIRCUITS; PROBLEM SOLVING;

FREQUENT PATTERNS; GRAY CODES; ITEM TRANSFORMATION;

MATHEMATICAL TRANSFORMATIONS;

EID: 34447096806     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.is.2007.01.001     Document Type: Article

References (31)

1. Ng K., Liu H., and Kwah H. A data mining application: customer retention at the Port of Singapore Authority (PSA). Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data (1998) 522-525
2. Brachman R.J., Khabaza T., Kloesgen W., Piatetsky-Shapiro G., and Simoudis E. Mining business databases. Commun. ACM 39 (1996) 42-48
3. Liu G., Lu H., Xu Y., and Yu J.X. Ascending frequency ordered prefix-tree: efficient mining of frequent patterns. Proceedings of the Eighth International Conference on Database Systems for Advanced Applications (2003) 65-72
4. Zou Q., Chu W., Johnson D., and Chiu H. A pattern decomposition algorithm for finding all frequent patterns in large datasets. Knowl. Inf. Syst. 4 4 (2002) 466-482
5. Agrawal R., and Srikant R. Fast algorithms for mining association rules. Proceedings of the 20th International Conference on Very Large Data Bases (1994) 487-499
6. Han J., Pei J., and Yin Y. Mining frequent patterns without candidate generation. Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data (2000) 1-12
7. Brin S., Motwani R., and Silverstein C. Beyond market baskets: generalizing association rules to correlations. Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data (1997) 265-276
8. Agrawal R., and Srikant R. Mining sequential patterns. Proceedings of the 11th International Conference on Data Engineering (1995) 3-14
9. Srikant R., and Agrawal R. Mining sequential patterns: generalizations and performance improvements. Proceedings of the Fifth International Conference on Extending Database Technology (1996) 3-17
10. Meretakis D., Fragoudis D., Lu H., and Likothanassis S. Scalable association-based text classification. Proceedings of the Ninth International Conference on Information and Knowledge Management (2000) 5-11
11. Agarwal R.C., Aggarwal C.C., and Prasad V.V.V. Depth first generation of long patterns. Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2000) 108-118
12. Burdick D., Calimlim M., and Gehrke J. MAFIA: a maximal frequent itemset algorithm for transactional databases. Proceedings of the 17th International Conference on Data Engineering (2001) 443-452
13. Bayardo R.J. Efficiently mining long patterns from databases. Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data (1998) 85-93
14. J. Pei, J. Han, R. Mao, CLOSET: an efficient algorithm for mining frequent closed itemsets, ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 2000, pp. 11-20.
15. Zaki M.J., and Hsiao C.J. CHARM: an efficient algorithm for closed itemset mining. Proceedings of the Second SIAM International Conference on Data Mining (2002)
16. Tseng F.C., Hsu C.C., and Chen H. Mining frequent closed itemsets with the frequent pattern list. Proceedings of the IEEE International Conference on Data Mining (2001) 653-654
17. Pei J., Han J., Lu H., Nishio S., Tang S., and Yang D. H-mine: hyper-structure mining of frequent patterns in large databases. Proceedings of the IEEE International Conference on Data Mining (2001) 441-448
18. Klemettinen M., Mannila H., Ronkainen P., Toivonen H., and Verkamo A.I. Finding interesting rules from large sets of discovered association rules. Proceedings of the Third International Conference on Information and Knowledge Management (1994) 401-407
19. Ng R.T., Lakshmanan L.V.S., Han J., and Pang A. Exploratory mining and pruning optimizations of constrained associations rules. Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data (1998) 13-24
20. Park J.S., Chen M.S., and Yu P.S. An effective hash-based algorithm for mining association rules. Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data (1995) 175-186
21. Sarawagi S., Thomas S., and Agrawal R. Integrating association rule mining with relational database systems: alternatives and implications. Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data (1998) 343-354
22. Agarwal R.C., Aggarwal C.C., and Prasad V.V.V. A tree projection algorithm for generation of frequent item sets. J. Parallel Distributed Comput. 61 (2001) 350-371
23. Huang H., Wu X., and Relue R. Association analysis with one scan of databases. Proceedings of the IEEE International Conference on Data Mining (2002) 629-632
24. Cheung W., and Zaiane O.R. Incremental mining of frequent patterns without candidate generation or support constraint. Proceedings of the Seventh International Database Engineering and Applications (2003) 111-116
25. Johnsonbaugh R. Discrete Mathematics. fifth ed. (2000), Prentice-Hall, Englewood Cliffs, NJ
26. Liu J., Pan Y., Wang K., and Han J. Mining frequent item sets by opportunistic projection. Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2002) 229-238
27. Tocci R.J., and Widmer M.S. Digital Systems: Principles and Applications 9/e (2004), Prentice-Hall, Englewood Cliffs, NJ
28. Sedgewick R. Algorithms in C++ (2001), Addison Wesley, Reading, MA
29. T.I. Incorporated, SN54F283, 4-Bit Binary Full Adders With Fast Carry, 1993, Available at 〈http://focus.ti.com/docs/prod/folders/print/sn54f283.html〉.
30. T.I. Incorporated, SN74AUC16373, 16-Bit Transparent D-Type Latch With 3-State Outputs, 2002, Available at 〈http://focus.ti.com/docs/prod/folders/print/sn74auc16373.html〉.
31. T.I. Incorporated, SN74AUC2G08, DUAL 2-INPUT POSITIVE-AND GATE, 2003, Available at 〈http://focus.ti.com/docs/prod/folders/print/sn74auc2g08.html〉 .