Time-Efficient Tree-Based Algorithm for Mining High Utility Patterns
作者： Chiranjeevi Manike , Hari Om , None
DOI: 10.1007/978-3-319-11218-3_37
关键词: Database transaction 、 Algorithm 、 Tree structure 、 Computer science 、 Field (computer science) 、 Brute-force search 、 Unavailability 、 Pruning (decision trees) 、 Tree (data structure) 、 FSA-Red Algorithm
摘要: High utility patterns mining from transaction databases is an important research area in the field of data mining. Due to unavailability downward closure property among utilities itemsets it becomes great challenge researchers. Even though, efficient pruning strategy called, weighted used reduce number candidate itemsets, total time generate and test more. In view this, this paper we have proposed a time-efficient tree-based algorithm (TTBM) for high databases. We construct conditional pattern bases second pass our algorithm. tree structure HP-Tree tracing method keep discovering respectively. compared performance against Two-Phase HUI-Miner algorithms. The experimental results show that execution approach better.
springer.com
sci-hub.st 参考文章(20)
Cory J. Butz, Howard J. Hamilton, Hong Yao, A Foundational Approach to Mining Itemset Utilities from Databases. siam international conference on data mining. pp. 482- 486 ,(2004)
Liqiang Geng, Howard J. Hamilton, Hong Yao, A Unified Framework for Utility Based Measures for Mining Itemsets ,(2006)
Raj P. Gopalan, Alva Erwin, N. R. Achuthan, A bottom-up projection based algorithm for mining high utility itemsets AIDM '07 Proceedings of the 2nd international workshop on Integrating artificial intelligence and data mining - Volume 84. pp. 3- 11 ,(2007)
Ramakrishnan Srikant, Rakesh Agrawal, Fast algorithms for mining association rules very large data bases. pp. 580- 592 ,(1998)
Ramakrishnan Srikant, Rakesh Agrawal, Fast Algorithms for Mining Association Rules in Large Databases very large data bases. pp. 487- 499 ,(1994)
Benjamin C. M. Fung, Martin Ester, Ke Wang, Hierarchical Document Clustering Using Frequent Itemsets siam international conference on data mining. pp. 59- 70 ,(2003)
Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee, None, An Efficient Candidate Pruning Technique for High Utility Pattern Mining Advances in Knowledge Discovery and Data Mining. pp. 749- 756 ,(2009) , 10.1007/978-3-642-01307-2_76
Hong Yao, Howard J. Hamilton, Mining itemset utilities from transaction databases data and knowledge engineering. ,vol. 59, pp. 603- 626 ,(2006) , 10.1016/J.DATAK.2005.10.004
YING LIU, JIANWEI LI, WEI-KENG LIAO, ALOK CHOUDHARY, YONG SHI, High utility itemsets mining International Journal of Information Technology and Decision Making. ,vol. 9, pp. 905- 934 ,(2010) , 10.1142/S0219622010004159
Vincent S. Tseng, Bai-En Shie, Cheng-Wei Wu, Philip S. Yu, Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases IEEE Transactions on Knowledge and Data Engineering. ,vol. 25, pp. 1772- 1786 ,(2013) , 10.1109/TKDE.2012.59