International Peer-Reviewed JournalOpen AccessISSN 2456-8880
irejournals@gmail.com+91-7433024337

Home / Current Issue / Paper 1704961

1704961 Vol 7 · Issue 2 Download Paper

Review on High Utility Item Set Mining Algorithms

Sonali Pawar Sanjana Sharma

Subject area: Science,Engineering and Technology  ·  Area of research: Mining Algorithm

Abstract

Data mining is computing process of discovering patterns in large data sets involving methods at the intersection of data base system. Data mining popular problem is High utility item set mining (HUI) or more generally utility mining (UI). The problem of HUI (High utility item set) is mainly introduction to frequently item set. Frequent pattern mining is a popular problem in data mining, which consists in finding frequent patterns in transaction databases. Frequent item set mining works to discover item set which are frequently appear in transaction database, which can be discover on the basis of support and confidence value of different itemset. Using frequent itemset mining concept as a base, many researchers have also proposed different new concept on utility-based mining of itemset. This paper presents a comprehensive systematic literature review of present techniques used for mining high utility item sets from huge data set.

Keywords

Data Mining, KDD Process, Minimum Utility, High Utility Mining, Minimum Utility.

References

[1] Tan P.-N., Steinbach M., and Kumar V. ―Introduction to data mining, Addison Wesley Publishers‖. 2006

[2] Fayyad U. M., Piatetsky-Shapiro G. and Smyth, P. ―Data mining to knowledge discovery in databases, AI Magazine‖. Vol. 17, No. 3, pp. 37-54, 1996.

[3] https://www.sas.com/en_us/insights/analytics/data-mining.html

[4] C. F. Ahmed, S. K. Tanbeer, B.-S. Jeong, and Y.-K. Lee. Efficient tree structures for high utility pattern mining in incremental databases. In IEEE Transactions on Knowledge and Data Engineering, Vol. 21, Issue 12, pp. 1708-1721, 2009.

[5] A. Erwin, R. P. Gopalan, and N. R. Achuthan. Efficient mining of high utility itemsets from large datasets. In Proc. of PAKDD 2008, LNAI 5012, pp. 554-561.

[6] Y. G. Sucahyo and R. P. Gopalan. "CT-ITL: Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth". Proceedings of the 14th Australasian Database Conference, Adelaide, Australia, 2003.

[7] Vincent S. Tseng, Bai-En Shie, Cheng-Wei Wu, and Philip S. Yu, Fellow, IEEE "Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases" IEEE Trans. Knowledge and Data Engineering, vol. 25, no. 8, August 2013

[8] Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, and Young-Koo Lee, Member, IEEE "Efficient Tree Structures for High Utility Pattern Mining inIncremental Databases" IEEE Trans. Knowledge and Data Engineering, Vol. 21, Issue 12, pp. 1708-1721, December 2009.

[9] Alva Erwin, Raj P. Gopalan, and N. R. Achuthan, "Efficient Mining of High Utility Itemsets from Large Datasets", In Proc. of PAKDD 2008.

[10] Shankar, S.; Purusothaman, T.; Jayanthi, S. "Novel algorithm for mining high utility itemsets" International Conference on Computing, Communication and Networking, Dec. 2008.

[11] Raymond Chan; Qiang Yang; Yi-Dong Shen, "Mining high utility itemsets" In Proc. of Third IEEE Int’l Conf. on Data Mining ,November 2003.

[12] Ramaraju, C., Savarimuthu N. "A conditional tree based novel algorithm for high utility itemset mining", International Conference on Data mining, June 2011.

[13] Ying Liu, Wei-keng Liao, Alok Choudhary "A Fast High Utility Itemsets Mining Algorithm" In Proc. of the Utility-Based Data Mining Workshop, 2005.

[14] Adinarayanareddy B, O Srinivasa Rao, MHM Krishna Prasad, "An Improved UP-GrowthHigh Utility Itemset Mining" International Journal of Computer Applications (0975-8887) Volume 58-No.2, November 2012.

[15] P. Asha, Dr. T. Jebarajan, G. Saranya, “A Survey on Efficient Incremental Algorithm for Mining High Utility Itemsets in Distributed and Dynamic Database” IJETAEJournal, Vol.4, Issue 1, January 2014.

How to cite this paper

Sonali Pawar, Sanjana Sharma "Review on High Utility Item Set Mining Algorithms" Iconic Research And Engineering Journals Volume 7 Issue 2 2023 Page 123-126
Sonali Pawar, Sanjana Sharma "Review on High Utility Item Set Mining Algorithms" Iconic Research And Engineering Journals, vol. 7, no. 2, Aug. 2023
Sonali Pawar, Sanjana Sharma (2023). Review on High Utility Item Set Mining Algorithms. Iconic Research And Engineering Journals, 7(2).
Sonali Pawar, Sanjana Sharma "Review on High Utility Item Set Mining Algorithms" Iconic Research And Engineering Journals, vol. 7, no. 2, Aug. 2023.
@article{1704961,
      author = {Sonali Pawar, Sanjana Sharma},
      title = {Review on High Utility Item Set Mining Algorithms},
      journal = {Iconic Research And Engineering Journals},
      year = {2023},
      volume = {7},
      number = {2},
      pages = {123-126},
      issn = {2456-8880},
      url = {https://www.irejournals.com/formatedpaper/1704961.pdf},
      abstract = {Data mining is computing process of discovering patterns in large data sets involving methods at the intersection of data base system. Data mining popular problem is High utility item set mining (HUI) or more generally utility mining (UI). The problem of HUI (High utility item set) is mainly introduction to frequently item set. Frequent pattern mining is a popular problem in data mining, which consists in finding frequent patterns in transaction databases. Frequent item set mining works to discover item set which are frequently appear in transaction database, which can be discover on the basis of support and confidence value of different itemset. Using frequent itemset mining concept as a base, many researchers have also proposed different new concept on utility-based mining of itemset. This paper presents a comprehensive systematic literature review of present techniques used for mining high utility item sets from huge data set.},
      keywords = {Data Mining, KDD Process, Minimum Utility, High Utility Mining, Minimum Utility.},
      month = {August},
  }