LIN Shu-kuan, WANG Xiao-cong, QIAO Jian-zhong, WANG Rui. A Top-k High Utility Itemset Mining Method Based on the Index Utility[J]. Journal of Northeastern University Natural Science, 2016, 37(1): 24-28.
[1]Han J,Kamber M,Pei J.Data mining:concept and technique [M].3rd ed.Beijing:China Machine Press,2012. [2]Brin S,Motwani R,Ullman J D,et al.Dynamic itemset counting and implication rules for market basket data[C]// Proceedings of ACM SIGMOD Conference on Management of Data.Tucson,1997:255-264. [3]毛国君,宗东军.基于多维数据流挖掘技术的入侵检测模型与算法[J].计算机研究与发展,2009,46(4):602-609.(Mao Guo-jun,Zong Dong-jun.An intrusion detection model based on mining multi-dimension data stream[J].Journal of Computer Research and Development,2009,46(4):602-609.) [4]杨欢,张玉清,胡予濮,等.基于权限频繁模式挖掘算法的Android 恶意应用检测方法[J].通信学报,2013,34(Z1):106-115.(Yang Huan,Zhang Yu-qing,Hu Yu-pu,et al.Android malware detection method based on permission sequential pattern mining algorithm[J].Journal on Communications,2013,34(Z1):106-115.) [5]Agrawal R,Srikant R.Fast algorithms for mining association rules[C]// Proceedings of the 20th VLDB Conference.Santiago de Chile,1994:487-499. [6]Agrawal R,Imielinski T,Swami A.Mining association rules between sets of items in large databases[C]// Proceedings of the ACM SIGMOD Conference on Management of Data.New York:ACM Press,1993:207-216. [7]Pei J,Han J,Lu H,et al.H-Mine:hyper-structure mining of frequent patterns in large databases[C]// IEEE International Conference on Data Mining.Piscataway,2001:441-448. [8]Han J,Pei J.Mining frequent patterns without candidate generation:a frequent-pattern tree approach [J].Data Mining and Knowledge Discovery,2004,8(1):53-87. [9]Yao H,Hamilton H J,Geng L.A unified framework for utility-based measures for mining itemsets[C]// Proceedings of ACM SIGKDD 2nd Workshop on Utility-Based Data Mining.Philadelphia,2006:28-37. [10]Tseng V,Wu C W,Shie B E,et al.UP-growth:an efficient algorithm for high utility itemset mining[C]// Proceedings of KDD’10.Washington DC,2010:253-263. [11]Song W,Liu Y,Li J H.Vertical mining for high utility itemsets[C]// Proceedings of IEEE International Conference on Granular Computing.Hangzhou,2012:429-434. [12]Liu J,Wang K,Fung B.Direct discovery of high utility itemsets without candidate generation[C]// Proceedings of ICDM’12.Brussels,2012:984-989. [13]Lin C W,Hong T P,Lan G C,et al.Incrementally mining high utility patterns based on pre-large concept[J].Applied Intelligence,2014,40(2):343–357. [14]Wu C W,Shie B E.Mining top-k high utility itemsets[C]// Proceedings of KDD’12.Beijing,2012:78-86.