Searching for high-support itemsets in itemset trees

Intelligent Data Analysis

Volumn 10, Issue 2, 2006, Pages 105-120

  Li, Yu ^a   Kubat, Miroslav ^a  

^a University of Miami College of Engineering   (United States)

Author keywords

Data mining; frequent itemsets; itemset trees

Indexed keywords

COST EFFECTIVENESS; DATA MINING; FORESTRY; QUERY PROCESSING;

ASSOCIATION MINING; COST EFFECTIVE; ITEM SETS; ITEMSET; TRANSACTION DATABASE;

TREES (MATHEMATICS);

EID: 44349156339     PISSN: 1088467X     EISSN: 15714128     Source Type: Journal    
DOI: 10.3233/ida-2006-10202     Document Type: Article

References (28)

1. R. Agarwal, C. Aggarwal and V.V.V. Prassad, Depth-first Generation of Large Itemsets of Association Rules, IBM Tech. Report RC21538, July 1999.
2. R. Agarwal, C. Aggarwal and V.V.V. Prassad, A Tree Projection Agorithm for Generation of Frequent Items Sets, Journal of Parallel and Distributed Computing 61 (2001), 350-371.
3. R. Agrawal, T. Imielinski and A. Swami, Mining Association Rules between Sets of Items in Large Databases, Proceedings of ACM SIGMOD, 1993, 207-216.
4. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen and A.I. Verkamo, Fast Discovery of Association Rules, in: Advances in Knowledge Discovery and Data Mining, Fayyad, ed., 1996, pp. 307-328.
5. R. Agrawal and J.C. Shafer, Parallel Mining of Association Rules, IEEE Transactions on Knowledge and Data Engineering 8 (December 1996), 962-969.
6. R. Agrawal and R. Srikant, Fast Algorithms for Mining Association Rules in Large Databases, Proceedings of the 20th International Conference on Very Large Databases, 1994, 478-499.
7. C.C. Aggarwal and P.S. Yu, A New Approach to Online Generation of Association Rules, IEEE Transactions on Knowledge and Data Engineering 13 (2001), 527-540.
8. R.J. Bayardo and R. Agrawal, Mining the Most Interesting Rules, Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, California, 1999, 145-154.
9. C.L. Blake and C.J. Merz, Repository of machine learning databases, University of California at Irvine, Department of Information and Computer Science, www.ics.uci.edu/mlearn/MLRepository.html, 1998.
10. S.D. Bay and M.J. Pazzani, Detecting Change in Categorical Data: Mining Contrast Sets, Proceedings of the 5th International Conference on Knowledge Discovery and Data Mining, 1999, 302-306.
11. Y.L. Cheung and A.W.-C. Fu, Mining Frequent Itemsets without Support Threshold: with and withouth Itemset Constraints, IEEE Transactions on Knowledge and Datat Engineering 16 (2004), 1052-1069.
12. M.-S. Chen, J.S. Park and P.S. Yu, Data Mining for Path Traversal Patterns in Web Environments, Proceedings of the 16th International Conference on Distributed Computing Systems, 1996, 385-392.
13. D.W. Cheung, J. Han, V. Ng and C.Y. Wong, Maintenance of Discovered Association Rules in Large Databases, Proceedings of the International Conference on Data Engineering, New Orleans, LA, 1996.
14. D.W. Cheung, V.T. Ng, A.W. Fu and W. Fu, Efficient Mining of Association Rules in Distributed Databases, IEEE Transactions on Knowledge and Data Engineering 8 (1996), 911-922.
15. Y. Chi, Y. Xia, Y. Yang and R.R. Muntz, Mining Closed and Maximal Frequent Subtrees from Databass of Labeled Rooted Trees, IEEE Transactions on Knowledge and Data Engineering 17 (2005), 190-202.
16. J. Han and Y. Fu, Mining Multiple-Level Association Rules in Large Databases, IEEE Transactions on Knowledge Engineering 11 (1999), 798-805.
17. J. Han, J. Pei and Y. Yin, Mining Frequent Patterns without Candidate Generation, Proceedings of the ACM SIGMOD International Conference on Management of Data, 2000.
18. M. Kuramochi and G. Karypis, An Efficient Algorithm for Discovering Frequent Subgraphs, IEEE Transactions on Knowledge and Data Engineering 16 (2004), 1038-1051.
19. M. Kubat, A. Hafez, V.V. Raghavan, J. Lekkala and W.K. Chen, Itemset Trees for On-Line Association Mining, IEEE Transactions on Knowledge and Data Engineering 15 (2003), 1522-1534.
20. B. Liu,W. Hsu and Y. Ma, Pruning and Summarizing the Discovered Associations, Proceedings of the 5th ACMSIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, California, 1999, 125-134.
21. B. Nag, P.M. Deshpande and D. DeWitt, Using a Knowledge Cache for Interactive Discovery of Association Rules, Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, California, 1999, 244-253.
22. J.-S. Park, M.S. Chen and P.S. Yu, An Effective Hash Based Algorithm for Mining Association Rules, Proceedings of the ACM SIGMOD, 1995, 175-186.
23. J. Pei and J. Han, Constrained Frequent Pattern Mining: A Pattern-Growth View, Proceedings of ACM SIGKDD Explorations 4(1) (2001), 31-39.
24. J. Pei, J. Han and L.V.S. Lakshmanan, Mining Frequent Patterns with Convertible Constraints, Proceedings of the International Conference on Data Engineering (ICDE), 2001.
25. V.V. Raghavan and A. Hafez, Dynamic Data Mining, Proceedings of the 13th International Conference on Industrial and Engineering Applications of Artificial Intelligence, New Orleans, LA, 2000, 220-229.
26. R. Srikant and R. Agrawal, Mining Generalized Association Rules, Proceedings of the 21th International Conference on Very Large Databases, 1995, 407-419.
27. H. Toivonen, Sampling Large Databases for Association Mining, Proceedings of the 22nd International Conference on Very Large Databases, Mumbay, India, 1996, 134-145.
28. M.J. Zaki, Efficiently Mining Frequent Trees in a Forest: Algorithms and Applications, IEEE Transactions on Knowledge and Data Engineering 17 (2005), 1021-1035.