An efficient algorithm for mining closed inter-transaction itemsets

Data and Knowledge Engineering

Volumn 66, Issue 1, 2008, Pages 68-91

  Lee, Anthony J T ^a   Wang, Chun Sheng ^a   Weng, Wan Yu ^a   Chen, Yi An ^a   Wu, Huei Wen ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Association rules; Closed itemset; Data mining; Inter transaction itemsets

Indexed keywords

ALGORITHMS; ASSOCIATION RULES; DATABASE SYSTEMS; TREES (MATHEMATICS);

CLOSED ITEMSET; INTER-TRANSACTION ITEMSETS;

DATA MINING;

EID: 44349174823     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2008.02.001     Document Type: Article

References (49)

1. R. Agrawal, R. Srikant, Fast algorithms for mining association rules, in: Proceedings of International Conference on Very Large Data Bases, Santiago, Chile, 1994, pp. 487-499.
2. Bastide Y., Pasquier N., Taouil R., Lakhal L., and Stumme G. Mining minimal non-redundant association rules using frequent closed itemsets. Proceedings of the International Conference on Deductive and Object-Oriented Databases (2000), LNCS, Springer-Verlag, London, UK 972-986
3. R.J. Bayardo, Efficiently mining long patterns from databases, in: Proceedings of ACM-SIGMOD International Conference on Management of Data, Seattle, WA, USA, 1998, pp. 85-93.
4. Berzal F., Cubero J.C., Marín N., and Serrano J.M. TBAR: an efficient method for association rule mining in relational databases. Data and Knowledge Engineering 37 1 (2001) 47-64
5. S. Brin, R. Motwani, J. Ullman, S. Tsur, Dynamic itemset counting and implication rules for market basket data, in: Proceedings of ACM-SIGMOD International Conference on Management of Data, Tucson, AZ, USA, 1997, pp. 255-264.
6. Calders T., and Goethals B. Mining all non-derivable frequent itemsets. Proceedings of the 6th European Conference on Principles of Knowledge Discovery and Data Mining (2002), LNAI, Springer-Verlag, Helsinki, Finland 74-85
7. Casali A., Cicchetti R., and Lakhal L. Essential patterns: a perfect cover of frequent patterns. Proceedings of the 7th International Conference on Data Warehousing and Knowledge Discovery (2005), LNCS, Springer-Verlag, Copenhagen, Denmark 428-437
8. Chen J., Ou L., Yin J., and Huang J. Efficient mining of cross-transaction web usage patterns in large database. Proceedings of 3rd International Conference on Networking and Mobile Computing (2005), LNCS, Springer-Verlag, Zhangjiajie, China 519-528
9. Chen T.S., and Hsu S.C. Mining frequent tree-like patterns in large datasets. Data and Knowledge Engineering 62 1 (2007) 65-83
10. Feng L., Yu J.X., Lu H., and Han J. A template model for multidimensional inter-transactional association rules. The VLDB Journal 11 2 (2002) 153-175
11. G. Grahne, J. Zhu, Efficiently using prefix-trees in mining frequent itemsets, in: Proceedings of the IEEE ICDM Workshop in Frequent Itemset Mining Implementations, Melbourne, FL, USA, 2003, pp. 123-132.
12. Guil F., Bosch A., Túnez S., and Mari{dotless}́n R. Temporal approaches in data mining. A case study in agricultural environment. Proceedings of 9th International Workshop on Computer Aided Systems Theory (2003), LNCS, Springer-Verlag, Las Palmas de Gran Canaria, Spain 185-195
13. T. Hamrouni, S. BenYahia, Y. Slimani, Avoiding the itemset closure computation "pitfall", in: Proceedings of the 3rd International Conference on Concept Lattices and their Applications, Olomouc, Czech Republic, 2005, pp. 46-59.
14. J. Han, J. Pei, Y. Yin, Mining frequent patterns without candidate generation, in: Proceedings of the ACM-SIGMOD International Conference on Management of Data, Dallas, TX, USA, 2000, pp. 1-12.
15. J. Han, J. Wang, Y. Lu, P. Tzvetkov, Mining top-k frequent closed patterns without minimum support, in: Proceedings of the 2nd International Conference on Data Mining, Maebashi, Japan, 2002, pp. 211-218.
16. J. Han, Y. Fu, Discovery of multiple-level association rules from large databases, in: Proceedings of International Conference on Very Large Data Bases, Zurich, Switzerland, 1995, pp. 420-431.
17. K.Y. Huang, C.H. Chang, K.Z. Lin, ClosedPROWL: efficient mining of closed frequent continuities by projected window list technology, in: Proceedings of the 5th SIAM International Conference on Data Mining, Newport Beach, CA, USA, 2005.
18. Jea K.F., and Chang M.Y. Discovering frequent itemsets by support approximation and itemset clustering. Data and Knowledge Engineering 65 1 (2008) 90-107
19. Kohavi R., Broadley C., Frasca B., Mason L., and Zheng Z. KDD-cup 2000 organizers' report: peeling the onion. SIGKDD Explorations 2 2 (2000) 86-98
20. Lee A.J.T., Hong R.W., Ko W.M., Tsao W.K., and Lin H.H. Mining spatial association rules in image databases. Information Sciences 177 7 (2007) 1593-1608
21. Lee A.J.T., Lin W.C., and Wang C.S. Mining association rules with multi-dimensional constraints. The Journal of Systems and Software 79 1 (2006) 79-92
22. Lee A.J.T., and Wang C.S. An efficient algorithm for mining frequent inter-transaction patterns. Information Sciences 177 17 (2007) 3453-3476
23. Lee A.J.T., and Wang Y.T. Efficient data mining for calling path patterns in GSM networks. Information Systems 28 8 (2003) 929-948
24. Li Q., Feng L., and Wong A. From intra-transaction to generalized inter-transaction: landscaping multidimensional contexts in association rule mining. Information Sciences 172 3-4 (2005) 361-395
25. H. Lu, J. Han, L. Feng, Stock movement prediction and n-dimensional inter-transaction association rules, in: Proceedings of the 3rd ACM-SIGMOD Workshop on Research Issues on Data Mining and Knowledge, Seattle, WA, USA, 1998, pp. 12:1-12:7.
26. Lu H., Feng L., and Han J. Beyond intratransaction association analysis: mining multidimensional inter-transaction association rules. ACM Transactions on Information Systems 18 4 (2000) 423-454
27. Lucchese B., Orlando S., and Perego R. Fast and memory efficient mining of frequent closed itemsets. IEEE Transactions on Knowledge and Data Engineering 18 1 (2006) 21-36
28. S. Lühr, G. West, S. Venkatesh, An extended frequent pattern tree for intertransaction association rule mining, Technical Report, Department of Computing, Curtin University of Technology, Perth, Western Australia, March 2005.
29. Masseglia F., Poncelet P., and Teisseire M. Incremental mining of sequential patterns in large databases. Data and Knowledge Engineering 46 1 (2003) 97-121
30. H.D.K. Moonestinghe, S. Fodeh, P.N. Tan, Frequent closed itemset mining using prefix graphs with an efficient flow-based pruning strategy, in: Proceedings of the 6th International Conference on Data Mining, Hong Kong, 2006, pp. 426-435.
31. Moustakides G.V., and Verykios V.S. A MaxMin approach for hiding frequent itemsets. Data and Knowledge Engineering 65 1 (2008) 75-89
32. Nørvåg K., Øivind Eriksen T., and Skogstad K. Mining association rules in temporal document collections. Proceedings of 16th International Symposium on Methodologies for Intelligent Systems (2006), LNCS, Springer-Verlag, Bari, Italy 745-754
33. Palshikar G.K., Kale M.S., and Apte M.M. Association rules mining using heavy itemsets. Data and Knowledge Engineering 61 1 (2007) 93-113
34. J.S. Park, M.S. Chen, P.S. Yu, An effective hash-based algorithm for mining association rules, in: Proceedings of ACM-SIGMOD International Conference on Management of Data, San Jose, CA, USA, 1995, pp. 175-186.
35. Pasquier N., Bastide Y., Taouil R., and Lakhal L. Discovering frequent closed itemsets for association rules. Proceedings of the 5th International Conference on Database Theory (1999), LNCS, Springer-Verlag, Jerusalem, Israel 398-416
36. Pasquier N., Bastide Y., Taouil R., and Lakhal L. Efficient mining of association rules using closed itemset lattices. Information Systems 24 1 (1999) 25-46
37. J. Pei, J. Han, R. Mao, Closet: an efficient algorithm for mining frequent closed itemsets, in: Proceedings of the 5th ACM-SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, Dallas, TX, USA, 2000, pp. 11-20.
38. Rozenberg B., and Gudes E. Association rules mining in vertically partitioned databases. Data and Knowledge Engineering 59 2 (2006) 378-396
39. N.G. Singh, S.R. Singh, A.K. Mahanta, CloseMiner: Discovering frequent closed itemsets using frequent closed tidsets, in: Proceedings of the 5th International Conference on Data Mining, Washington, DC, USA, 2005, pp. 633-636.
40. Tseng M.C., and Lin W.Y. Efficient mining of generalized association rules with non-uniform minimum support. Data and Knowledge Engineering 62 1 (2007) 41-64
41. Tung A.K.H., Lu H., Han J., and Feng L. Efficient mining of intertransaction association rules. IEEE Transactions on Knowledge and Data Engineering 15 1 (2003) 43-56
42. Uno T., Asai T., Uchida Y., and Arimura H. An efficient algorithm for enumerating closed patterns in transaction databases. Proceedings of the 7th International Conference on Discovery Science (2004), LNCS, Springer-Verlag, Padova, Italy 16-31
43. J. Wang, J. Han, J. Pei, Closet+: Searching for the best strategies for mining frequent closed itemsets, in: Proceedings of the 9th ACM-SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, 2003, pp. 236-245.
44. Yahia S.B., Hamrouni T., and Nguifo E.M. Frequent closed itemset based algorithms: a thorough structural and analytical survey. ACM SIGKDD Explorations Newsletter 8 1 (2006) 93-104
45. Yahoo, Finance, .
46. Yao H., and Hamilton H.J. Mining itemset utilities from transaction databases. Data and Knowledge Engineering 59 3 (2006) 603-626
47. Zaki M.J., and Hsiao C.J. Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Transactions on Knowledge and Data Engineering 17 4 (2005) 462-478
48. M.J. Zaki, Generating non-redundant association rules, in: Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, NY, USA, 2000, pp. 34-43.
49. M.J. Zaki, K. Gouda, Fast vertical mining using diffsets, in: Proceedings of the 9th ACM-SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, NY, USA, 2003, pp. 326-335.