Lossless Representation of High Utility Itemset Using APRIORI Algorithm
S.Rashmi, K.L.N. College of Engineering; A.Selvaraj ,; K.Pavithra ,; S.Sundareswari ,
Mining High Utility Item set (HUIs), apriori algorithm
Mining High Utility Item set (HUIs) becomes an important data mining task. Too many HUIs may degrade the level of performance. To achieve high efficiency of mining task apriori algorithm is used. In this method a refined database is made that makes the search easier. This in-turn serves to be a compact and lossless representation of HUIs.
-
[1] Sen Zhang, Member, IEEE, Zhihui Du, Member, IEEE, and Jason T. L. Wang, Member, IEEE “New Techniques for Mining Frequent Patterns in Unordered Trees “in IEEE TRANSACTIONS ON CYBERNETICS, VOL. 45, NO. 6, JUNE 2015 1113.
[2] Vincent S. Tseng, Cheng-Wei Wu, Philippe Fournier-Viger, and Philip S. Yu, Fellow, IEEE” Efficient Algorithms for Miningthe Concise and Lossless Representation of High Utility Item sets” in Ieee Transactions On Knowledge And Data Engineering, Vol. 27, No. 3, March 2015
[3] Divya Bansal and Lekha Bhambhu M.Tech Scholar Assistant Professor Department Of Computer Science Department Of Computer Science. J.C.D College Of Engineering And Technology G.J.U. University Of Science & Technology, India “ Execution Of Apriori Algorithm Of Data Mining Directed Towards Tumultuous Crimes Concerning Women” In Volume 3, Issue 9, September 2013 Issn: 2277 128x International Journal Of Advanced Research In Computer Science And Software Engineering
[4] U Kanimozhi, J K Kavitha, D Manjula Mining High Utility Item sets – A Recent Survey In International Journal Of Scientific Engineering And Technology (Issn : 2277-1581)Volume No.3 Issue No.11, Pp : 1339-1344
[5] International Journal Of Innovative Research In Computer And Communication Engineering (An Iso 3297: 2007 Certified Organization) Vol. 3, Issue 11, November 2015discovering Frequent Item sets Using Fastapriori Algorithm
M. Premalatha1, T. Menaka2
[6] Akshita Bhandaria, Ashutosh Gupta, DE basis Das” Improvised Apriori Algorithm Using Frequent Pattern Tree For Real Time Applications in Data Mining” International Conference on Information and Communication Technologies (Icict 2014)
[7] Claudio Lucchese, Salvatore Orlando, And Raffaele Perego Fast And Memory Efficient Mining Of Frequent Closed Item sets In Ieee Transactions On Knowledge And Data Engineering, Vol. 18, No. 1, January 2006
[8] Jiawei Han University of Illinois at Urbana-Champaign Jianpei State University Of New York At Buffalo Yiwen Yin Simon Fraser University Raying Mao Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach.
Paper ID: GRDCF002044
Published in: Conference : International Conference on Innovations in Engineering and Technology (ICIET - 2016)
Page(s): 208 - 211
Published in: Conference : International Conference on Innovations in Engineering and Technology (ICIET - 2016)
Page(s): 208 - 211