Mining high average-utility itemsets

Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

Volumn , Issue , 2009, Pages 2526-2530

  Hong, Tzung Pei ^a   Lee, Cho Han ^a   Wang, Shyue Liang ^a  

^a NATIONAL UNIVERSITY OF KAOHSIUNG   (Taiwan)

Author keywords

Average utility; Downward closure; Two phase mining; Utility mining

Indexed keywords

AVERAGE UTILITY; DOWNWARD CLOSURE; ITEM SETS; ITEMSET; MINING ALGORITHMS; TWO PHASIS; UPPER BOUND; UTILITY MEASURE; UTILITY MINING;

ALGORITHMS;

CYBERNETICS;

EID: 74849088834     PISSN: 1062922X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSMC.2009.5346333     Document Type: Conference Paper

References (12)

1. R. Agrawal and R. Srikant, "Fast Algorithms for Mining Association Rules in Large Databases," in Proceedings of the 20th International Conference on Very Large Data Bases: Morgan Kaufmann Publishers Inc., 1994.
2. Y. Liu, W. Liao, and A. Choudhary, "A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets," in Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), 2005.
3. Y. Liu, W.-k. Liao, and A. Choudhary, "A Fast High Utility Itemsets Mining Algorithm," in Proceedings of the 1st International Workshop on Utility-based Data Mining Chicago, Illinois: ACM, 2005.
4. M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li, "New Algorithms for Fast Discovery of Association Rules," University of Rochester, 1997.
5. S. Brin, R. Motwani, J. D. Ullman, and S. Tsur, "Dynamic Itemset Counting and Implication Rules for Market Basket Data," in Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data Tucson, Arizona, United States: ACM, 1997.
6. J. S. Park, M.-S. Chen, and P. S. Yu, "An Effective Hash-based Algorithm for Mining Association Rules," in Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data San Jose, California, United States: ACM, 1995.
7. J. Han, J. Pei, and Y. Yin, "Mining Frequent Patterns without Candidate Generation," in Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data Dallas, Texas, United States: ACM, 2000.
8. H. Yao, H. Hamilton, and C. Butz, "A Foundational Approach to Mining Itemset Utilities from Databases," in Proc. of the 4 th SIAM International Conference on Data Mining, 2004, pp. 211-225.
9. B. Barber and H. J. Hamilton, "Algorithms for Mining Share Frequent Itemsets Containing Infrequent Subsets," in Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery: Springer-Verlag, 2000.
10. Y. Li, J. Yeh, and C. Chang, "Efficient Algorithms for Mining Share-Frequent Itemsets," in Fuzzy Logic, Soft Computing and Computational Intelligence-11th World Congress of International Fuzzy Systems Association (IFSA 2005), 2005, pp. 534-539.
11. Y. Li, J. Yeh, and C. Chang, "Direct Candidates Generation: A Novel Algorithm for Discovering Complete Share-Frequent Itemsets," Lecture Notes in Computer Science, vol. 3614, p. 551, 2005.
12. H. Yao and H. J. Hamilton, "Mining Itemset Utilities from Transaction Databases," Data Knowl. Eng., vol. 59, pp. 603-626, 2006.