We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

A Survey on High Utility Itemsets Mining

by Shalini Zanzote Ninoria, S. S. Thakur
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 175 - Number 4
Year of Publication: 2017
Authors: Shalini Zanzote Ninoria, S. S. Thakur
10.5120/ijca2017915521

Shalini Zanzote Ninoria, S. S. Thakur . A Survey on High Utility Itemsets Mining. International Journal of Computer Applications. 175, 4 ( Oct 2017), 43-50. DOI=10.5120/ijca2017915521

@article{ 10.5120/ijca2017915521,
author = { Shalini Zanzote Ninoria, S. S. Thakur },
title = { A Survey on High Utility Itemsets Mining },
journal = { International Journal of Computer Applications },
issue_date = { Oct 2017 },
volume = { 175 },
number = { 4 },
month = { Oct },
year = { 2017 },
issn = { 0975-8887 },
pages = { 43-50 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume175/number4/28480-2017915521/ },
doi = { 10.5120/ijca2017915521 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:24:12.721095+05:30
%A Shalini Zanzote Ninoria
%A S. S. Thakur
%T A Survey on High Utility Itemsets Mining
%J International Journal of Computer Applications
%@ 0975-8887
%V 175
%N 4
%P 43-50
%D 2017
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Data Mining can be defined as a process that extracts nontrivial information contained in huge databases. Association rule mining is one of the important techniques of data mining in which relationships among the items present in the transactions are discovered. Traditional data mining techniques have focused largely on detecting the correlation between the items that are more frequent in the databases. Also termed as frequent itemset mining, these techniques were based on the grounds that itemsets which appear more frequently must be more significant to the user .High utility itemset mining is an extension to the problem of frequent pattern mining. In this paper we emphasis on an emerging area called High Utility Mining which not only considers the frequency of the itemsets but also considers the utility associated with the itemsets. The term utility refers to the usefulness of the itemset in transactions, like profit, sales or any other user preferences. In High Utility Itemset Mining the target is to identify itemsets that have utility value greater than the threshold utility value. In this paper a study of literature of the various techniques and current scenario of research in mining high utility itemset have presented also advantages and limitations of various techniques for HUIM have been presented.

References
  1. Agarwal R., and Srikant R., “Fast algorithms for mining association rules”, In the Proceedings of 20th Internaional Conf. Very large Data Bases, pp.487-499, 1994.
  2. Agrawal R., Imieliński T., Swami A.,"Mining association rules between sets of items in large databases", Proceedings of the 1993 ACM SIGMOD international conference on Management of data - SIGMOD '93. p. 207, 1993.
  3. Ahmed C.F. , Tanbeer S.K., Jeong Byeong-Soo, Lee Young-Koo, “Efficient tree structures for high utility pattern mining in incremental databases”, in: IEEE Transactions on Knowledge and Data Engineering 21(12) ,2009.
  4. Ahmed CF,Tanbeer SK,Jeong BS, Lee YK, “HUC-Prune: An Efficient Candidate Pruning Technique to mine high utility patterns”, Appl Intell PP: 181–198, 2011.
  5. Aliberti G, Colantonio A, Di Pietro R, Mariani R, “ EXPEDITE: EXPress closED ITemset enumeration”, Expert Syst Appl, 42:3933–3944, 2015.
  6. Attila Gyenesei, “Mining Weighted Association Rules for Fuzzy Quantitative Items”, Lecture notes in Computer Science, Springer, Vol. 1910/2000, pages 187-219, TUCS Technical Report No.346, ISBN 952-12-659-4,ISSN 1239- 1891, May 2000.
  7. Bhattacharya S. and Dubey D., “High Utility Itemset Mining”,International Journal of Emerging Technology and Advanced Engineering,Vol 2,8 August 2012.
  8. Cai C.H. , Fu A.W.C, Cheng C.H. , Kwong W.W., “Mining association rules with weighted items”,in:Proceedings of IEEE International Database Engineering and Applications Symposium, Cardiff, United kingdom, pp.68-77, 1998.
  9. Chan Q.,YangY., Shen D., “Mining high utility itemsets”, in:Proceedings of the 3rd IEEE International Conference on Data Mining , Melbourne , Florida, pp.19-26, 2003.
  10. Chen C.H., Li A.F., Lee Y.C. “Actionable high-coherent- utility fuzzy itemset mining”,Soft Comput,18:2413–2424, 2014.
  11. Chen C.L., Tseng F.S., Liang T., “Mining fuzzy frequent itemsets for hierarchical document clustering”, Inf Proc- ess Manage,46:193–211,2010.
  12. Chen J, Xiao K. BISC, “A bitmap itemset support counting approach for efficient frequent itemset mining”, ACM Trans Knowl Discov Data, 4:12, 2010.
  13. Chui C.K., Kao B., Hung E., “ Mining frequent itemsets from uncertain data”, In: Pacific-Asia Conference on Knowledge Discovery and Data Mining, Nanjing, China, 22–25 May,47–58, 2007.
  14. Deng Z.H., Lv S.L., “ PrePost+:An efficient N-lists-based algorithm for mining frequent itemsets via children parent equivalence pruning”, Expert Syst Appl, 42:5424–5423, 2015.
  15. G.K.Gupta, “Introduction to Data Mining with Case Studies”Prentice-Hall of India Pvt.Ltd.New Delhi,India(2006).
  16. H.F.Li, H.Y. Huang , Y.Cheng Chen, y. Liu, S.Lee, “Fast and memory efficient mining of high utility itemsets in data streams”, in :Eigth International Conference of Data Mining 2008.
  17. H.Yao, H.J Hamilton, L.Geng, “A unified framework for utility based measures for mining itemsets”, in: proceedings of the ACM international conference on utility-based Data Mining Workshop (UBDM), pp. 28-37, 2007.
  18. H.Yao, H.J.Hamilton, C.J.Butz, “A foundation approach to mining itemset utilities from databases”, in: Proceedings of the Third SIAM International Conference on Data Mining, Orlando, Florida , pp.482-486, 2004.
  19. H.Yao, H.J.Hamilton, “Mining itemset utilities from transaction databases” , in Data and Knowledge Engineering 59,pp.603-626 , 2006.
  20. Han J, Pei J, Ying Y, Mao R., “Mining frequent patterns without candidate generation: a frequent-pattern tree approach”, Data Min Knowl Discov, 8:53–87, 2004.
  21. Han J., Pei J., Kamber M., “Data Mining: Concepts and Techniques”, Amsterdam: Elsevier; 326-335, 2011.
  22. Hong T.P., Kuo C.S., Wang S.L., “A fuzzy AprioriTid mining algorithm with reduced computational time” Appl Soft Comput, x 5:1–10, 2004.
  23. Hu Y.H, Chen Y.L., “Mining association rules with multiple minimum supports: a new mining algorithm and a support tuning mechanism”, Decis Support Syst, 42:1–24, 2006.
  24. Introduction to Data Mining and Knowledge Discovery, Third Edition ISBN: 1-892095-02-5, Two Crows Corporation, 10500 Falls Road, Potomac, MD 20854 (U.S.A.), 1999.
  25. Ju Wang, Fuxian Liu, and Chunjie Jin, “PHUIMUS: A Potential High Utility Itemsets Mining Algorithm Based on Stream Data with Uncertainty”,Hindawi Mathematical Problems in Engineering Volume, Article ID 8576829, 13 pages 2017.
  26. Kiran R.U., Reddy P.K., “ Novel techniques to reduce search space in multiple minimum supports-based frequent pattern mining algorithms”, In: Proceedings of the 14th International Conference on Extending Data- base Technology, Uppsala, Sweden, 21–24,11–20, March,2011.
  27. Koh Y.S., Rountree N., “Finding Sporadic Rules Using Apriori-Inverse”, In: Proceedings of the 9th Pacific-Asia Conference, PAKDD 2005, Hanoi, Vietnam, 18–20May, 97–106 , 2005.
  28. Leung CKS, MacKinnon RK., “BLIMP: a compact tree structure for uncertain frequent pattern mining”, In: Proceedings of the International Conference on Data Warehousing and Knowledge Discovery, Munich, Ger- many, 2–4 September,115–123, 2014.
  29. Lin JCW,Gan W,Fournier-Viger P,Hong TP,Tseng VS.,“ Weighted frequent itemset mining over uncertain databases”, Appl Intell 2015, 44:232–250,2015.
  30. Lin JCW, Tin L, Fournier-Viger P, Hong TP., “A fast algorithm for mining fuzzy frequent itemsets”, J Intell Fuzzy Syst, 9:2373–2379, 2015.
  31. Lin JCW,Gan W,Fournier-Viger P, Hong TP, Tseng VS, “Efficiently mining uncertain high-utility itemsets”. Springer International Publishing Switzerland 2016,WAIM 2016, Part I, LNCS 9658, pp. 17–30, 2016.
  32. Lin JCW,Gan W,Fournier-Viger P, Hong TP, Tseng VS, “Mining Potential High-Utility Itemsets over Uncertain Databases”. ASE BD&SI '15 Proceedings of the ASE BigData & SocialInformatics, Article No. 25 Kaohsiung, Taiwan -October 07 - 09, 2015ACM New York, NY, USA, 2015.
  33. Liu B., Hsu W., Ma Y., “Mining association rules with multiple minimum supports “, In: Proceedings of the ACM SIGKDD International Conference on Knowl- edge Discovery and Data Mining, San Diego, CA, USA, 15–18, 337–341, August 1999.
  34. Liu Jian-Ping,Wang Ying Fan-Ding, “Incremental Mining algorithm Pre-FP in Association Rule Based on FP-tree”, Networking and Distributed Computing, International Conference, pp: 199-203, 2010.
  35. Liu M. and Qu J., “Mining High Utility Itemsets withoutCandidateGeneration”,CIKM’12,Maui,HI,USA, ACM, October29-November 2,2012.
  36. Liu Y., Liao W., and Choudhary A., “A Fast High Utility Itemsets Mining Algorithm,” Proc. Utility-Based Data Mining Workshop, 2005.
  37. Lu S., Hu H., Li F., “Mining weighted association rules”, Intelligent Data Analysis 5(3) 211-225, 2001.
  38. Lucchese C., Orlando S., Perego R., “ Fast and memory efficient mining of frequent closed itemsets”,IEEE Trans Knowl Data Eng,18:21–36, 2006.
  39. Moens S., Aksehirli E., Goethals B., “Frequent itemset mining for big data”, In: 2013 I.E. International Con- ference on Big Data, Santa Clara, CA, USA, 6–9 October, 111–118, 2013.
  40. Philippe Fournier Viger ,Cheng-Wei Wu,Souleymane Zida,Vincent S. Tseng, “FHM: Faster High-Utility Itemset Mining using Estimated Utility Co-occurrence Pruning”, Proc. 21st International Symposiumon methodologies for Intelliegnet Systems (ISMIS 2014),Springer,LNAI,pp 83-92,2014.
  41. Philippe Fournier Viger, Jerry Chun Wei Lin,Bay Vo,Tin Truong Chi,Ji Zhang,Hoai Bac Le, “A Survey of itemset mining” , WIREs Data Mining Knowl Discov 2017.
  42. Pillai J. and Vyas O.P. “Overview of itemset Utiltiy Mining and its Applications”,August International Journal of Computer Applications (0975 - 8887) Volume 5 – No. 11, 2010.
  43. Pyun G., Yun U., Ryu KH., “Efficient frequent pattern mining based on linear prefix tree”, Knowl-Based Syst, 55:125–139, 2014.
  44. Qui H.,Gu R.,Yuan C., Huang Y.,Yafim : “A parallel frequent itemset mining algorithm with spark” In proceedings of the 2014 I.E. International Parallel and Distributed Processing Symposium Workshops,Phoenix,AZ,USA,19-23,May 2014,1664-1671,2014.
  45. Schlegel B., Karnagel T., Kiefer T., Lehner W., “Scalable frequent itemset mining on many core processor”, In: Proceedings of the 9th International Workshop Data Management on New Hardware, New York, USA,24 June, paper 3, 2013.
  46. Shankar S.,Purusothoman T.P, Jayanthi S.,.Babu N, “A fast algorithm for mining high utility itemsets” , in :Proceedings of IEEE International Advance Computing Conference (IACC 2009), Patiala, India, pp.1459-1464, 2009.
  47. Shih-Sheng Chen, Tony Cheng-Kui Huang, Zhe-Min Lin, “New and efficient knowledge discovery of partial periodic patterns with multiple minimum supports”, The Journal of Systems and Software 84, pp. 1638–1651, ELSEVIER, 2011.
  48. Souleymane Zida, Philippe Fournier-Viger, Jerry Chun-Wei Lin,Cheng-Wei Wu,Vincent S. Tseng, “EFIM: A Highly Efficient Algorithm for High-Utility Itemset Mining”, 30 December 2015,Mexican International Conference on Artificial Intelligence Advances in Artificial Intelligence and Soft Computing pp 530-546,2015.
  49. Szathmary L., Valtchev P., Napoli A., Godin R., Boc A, Makarenkov V. “A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes”, Ann Math Artif Intell, 70:81–105, 2014.
  50. Szathmary L., Valtchev P., Napoli A., Godin R., “Efficient vertical mining of minimal rare itemsets”, In: Proceedings of the 9th International Conference on Concept Lattices and Their Applications, Fuengirola, Spain, 11–14 October, 2012, 269–280,2012.
  51. Tong Y., Chen L., Cheng Y., Yu P.S., “Mining frequent itemsets over uncertain databases”,VLDB Endowment,5:1650–1661 , 2012.
  52. Torres-VerdÃn C., Chiu K.Y., Vasudeva Murthy A.S., “WFIM: weighted frequent itemset mining with a weight range and a minimum weight.” In: Proceedings of the 2005 SIAM International Conference on Data Mining, Newport Beach, CA, USA, 21–2 April ,636-640, 2005.
  53. Uno T, Kiyomi M, Arimura H. LCM ver. 2: “Efficient mining algorithms for frequent/closed/maximal itemsets”, In: Proceedings of the ICDM’04 Workshop on Frequent Itemset Mining Implementations. Aachen, Germany: CEUR; 2004.
  54. Venkatesan, T.,Vinayaka, C, P. and Yogish, S., “Analysis of sampling techniques for Association Rule Mining.”, In the Proceedings of the 12th International Conference on Database Theory, Vol.361, pp. 276-283, 2009.
  55. Vincent S.Tseng,Bai-En shie,Cheng-Wei Wu and Pjillip S.Yu, “Efficient Algorithms for Mining High Utility Itemset from Transactional Databases”,8 August 2013,IEEE Transactions on Knowledge and Data Engineering ,Vol 25 pp 1172-1786,2013.
  56. Vo B, Le T, Coenen F, Hong TP., “Mining frequent itemsets using the N-list and subsume concepts”, Int J Mach Learn Cybern, 7:253–265, 2016.
  57. Yao H.,Hamilton H. and Geng L., “A Unified Framework for Utilty-Based Measures for Mining Itemsets”, In Proc. of the ACM Intel. Conf. on Utility-Based Data Mining Workshop (UBDM), pp. 28-37, 2006.
  58. Yun U. , “ Efficient mining of weighted interesting patterns with a strong weight and/or support affinity”,. Inform Sci. 177:3477–3499, 2007.
  59. Yun U. “ On pushing weight constraints deeply into frequent itemset mining”,Intell Data Anal 13:359-383,2009.
  60. Zaki M.J., Hsiao C.J., “ CHARM: an efficient algorithm for closed itemset mining”, In: Proceedings of the 12th SIAM International Conference on Data Mining, Ana- heim, CA, USA, 26–28 April, 457–473,2012.
  61. Zaki M.J., Gouda K., “Fast vertical mining using diffsets”, In: Proceedings of the 9th ACM SIGKDD Interna- tional Conference Knowledge Discovery and Data Mining, Washington, DC, USA, 24–27 August, 2003.
  62. Zaki, M.J. “Scalable algorithms for association mining”, IEEE Transactions on Knowledge and Data Engineering, 12(3), pp.372-390, 2000.
  63. Zhang F., Zhang Y., Bakos J.D., “Accelerating frequent itemset mining on graphics processing units”, J Supercomput, 66:94–117,2013.
Index Terms

Computer Science
Information Sciences

Keywords

Frequent Itemset Association Rule Mining High Utility Itemsets.

Powered by PhDFocusTM