Discovering interesting patterns and useful knowledge from massive data has become an important data mining task.
These days, we come across a lot of things that have profit technically referred as external utility, value greater than the other item
sets in the database. Utility mining is an important topic in data mining and has received extensive research in last few years. In
utility mining, each item is associated with a utility that could be profit, quantity, cost or other user preferences. Objective of Utility
Mining is to identify the item sets with highest utilities. High utility itemset mining is an extension to the problem of frequent pattern
mining. Many algorithms have been proposed in this field in the recent years. 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.
In High Utility Itemset Mining the target is to identify itemsets that have utility value greater than the threshold utility value. In this
paper we present a review of the various techniques and current scenario of research in mining high utility itemset also presented
advantages and limitations of various techniques for High Utility Itemset Mining. We mainly focus on the D2HUP and MAHUSP
approach and algorithms for high utility pattern mining with less memory utilization.
Shilpa Ghode : Asst. Prof. In Computer Technology Department
Kavikulguru Institute of Technology and Science, Ramtek
Data mining, Frequent Patterns, High Utility Pattern Mining, High Utility Itemsets, High Utility Mining Algorithms
A Utility mining is an apparent topic in data mining. The main
focus in the field of Utility Mining is not only Frequent Itemset
Mining but also the consideration of utility. Practically it has
been found that the utility is of great interest in industry if
considers with high utility itemsets. This research paper
presents a review of various existing high utility itemset mining
algorithms. The reviewed algorithms effectively mining high
utility itemsets based on the various data structure and
constraint techniques. This will be helpful for developing new
efficient and optimize techniques for high utility itemset mining.
However to discover patterns for large transactional datasets an
effective high utility pattern mining algorithm is required for
improving the performance and search space of high utility
itemsets. As the concept of High Utility Itemset Mining has a
vast opportunities to be researched, the future work will
incorporate soft computing methodologies for high utility
itmesets mining such as the intuitionistic fuzzy logic can be
explored in the field of High Utility Itemset Mining and its
 Ahmed C. F., Tanbeer S. K., Jeong B.-S., and Lee Y. -K.,
“Efficient tree structures for high utility pattern mining in
incremental databases,” IEEE Transactions on Knowledge
and Data Engineering, Vol. 21, No. 12, 2009, pp. 1708–
 Agrawal R., Imielinski T., and Swami A., “Mining
association rules between sets of items in large
databases,” In Special Interest Group on Knowledge
Discovery in Data. Association for Computing Machinery,
1993, pp. 207–216.
 Anusmitha A., Renjana Ramachandran M., “Utility
pattern mining: a concise and lossless representation using
up growth”, International Journal of Advanced Research
in Computer and Communication Engineering, Vol. 4, No.
7, 2015, pp. 451– 457.
 Chun-Wei Lin J., WenshengGan., Fournier-Viger P., and
Yang L., Liu Q., Frnda J., Sevcik L., Voznak M., “ High
utility itemset-mining and privacy-preserving utility
mining,” Vol. 7, 2016, No. 11, pp. 74–80.
 Dawar S., Goya V. l., “UP - Hist tree: An efficient data
structure for mining high utility patterns from transaction
databases,” In Proceedings of the 19th International
Database Engineering & Applications Symposium.
Association for Computing Machinery, 2015, pp. 56–61.
 De Bie T., “Maximum entropy models and subjective
interestingness: an application to tiles in binary
databases,” Data Mining and Knowledge Discovery, Vol.
23, No. 3, 2011, pp. 407–446.
 Erwin A., Gopalan R. P and. Achuthan N. R., “Efficient
mining of high utility itemsets from large datasets,” In
Proceeding of the Pacific-Asia Conference on Knowledge
Discovery and Data Mining, 2008, pp. 554–561.
 Fournier-Viger P., Wu C.-W., Zida S., and Tseng V.S.,
“Fhm: Faster high-utility itemset mining using estimated
utility Cooccurrence pruning,” In Proceedings of the 21th
International Symposium on Methodologies for Intelligent
Systems. Springer, 2014, pp.83-92.
 Geng L., Hamilton H.J, “Interestingness measures for data
mining: A survey,” Association for Computing Machinery.
Vol. 38, No. 3, 2006, pp.1–9.
 Han J., Pei J., Yin Y., Mao R., “Mining frequent patterns
without candidate generation: a frequent-pattern tree
approach,” Data Mining Knowledge Discovery in Data.
Vol. 8, No. 1, 2004, pp. 53–87.
 Junqiang Liu., Ke Wang., Benjamin., Fung C.M.,“Mining
High Utility Patterns in One Phase without Generating
Candidates”, IEEE Transactions on Knowledge and Data
Engineering, Vol. 28, No. 5, 2016, pp.1–14.
 Jyothi Pillai., Vyas O.P., “Overview of itemset utility
mining and its applications,” International Journal of
Computer Applications, Vol. 5, No. 11, 2010, pp. 9 –13.
 Liu J., Wang K., and Fung B., “Direct discovery of high
utility itemsets without candidate generation,” In
Proceedings of the12th International Conference. IEEE,
2012, pp. 984–989.
 Liu M., Qu J., “Mining high utility itemsets without
Candidate generation,” Conference on Information and
Knowledge Management. Association for Computing
Machinery, 2012, pp. 55–64.
 Liu J., Pan Y., Wang K., and Han J., “Mining frequent
item sets by opportunistic projection,” In Special Interest
Group onKnowledge Discovery and Data Mining.
Association for Computing Machinery, 2002, pp.229–238.
 Liu V., Liao W., and Choudhary A., “A fast high utility
itemsets mining algorithm,” in utility – Based Data
Mining Workshop in Special Interest Group on
Knowledge Discovery in Data. Association for Computing
Machinery, 2005, pp. 253 – 262.
 Li Y.-C., Yeh J.-S., and Chang C.-C., “Isolated items
discarding Strategy for discovering high utility itemsets,”
Data &Knowledge Engineering, Vol. 64, No. 1, 2008, pp.
 Sarode, Nutan, and Devendra Gadekar, “ A review on
efficient algorithms for mining high utility
itemsets, ”International Journal of Science and Research,
Vol. 3, No. 12, 2014, pp.708 –710.
 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), Patiala, India, 2009, pp.1459-1464.
 Tan P.N., Kumar V., and Srivastava J., “Selecting the
right objective measure for association analysis,”
Information Systems,Vol. 29, No. 4, 2004, pp. 293–313.
 Tseng V. S., Shie B.-E., Wu C.-W., and Yu P. S.,
“Efficient algorithms for mining high utility itemsets from
transactional databases,” IEEE Transactions on
Knowledge and Data Engineering, Vol. 25, No. 8, 2013,
pp. 1772–1786.  Yao H., Hamilton H. J., Butz C.J., “A foundational
approach to mining itemset utilities from databases,”
ICDM 2004, pp. 482-486.
 Yao H., Hamilton H. J., Geng L., “A unified framework
for utility-based measures for mining itemsets,” in Utility-
Based Data Mining,” In Special Interest Group on
Knowledge Discovery in Data. Association for Computing
Machinery, 2006, pp. 28–37.
 Zaki M.J., “Scalable algorithms for association mining,”
IEEE Transactions on Knowledge and Data Engineering,
Vol. 12, No.3, 2000, pp. 372–390.
 Morteza Zihayat, Yan Chen, Aijun An, “Memory-
Adaptive High Utility Sequential Pattern Mining Over
Data Stream”, Published in Springer Journal on Machine
Learning. Vol. 106.Issue 6, 2017, pp.799–836.
 Sharayu H. Fukey, Prof. P. M. Chawan ,” Survey of High
Utility Item sets Mining Algorithms”, International
Journal of Engineering Development and Research, Vol. 5,
Issue 2, 2017, pp. 2321-9939.
 Dr. S. Meenakshi1, P. Sharmila, “Review of Mining High
Utility Patterns”, International Journal of Innovative
Research in Computer and Communication Engineering,
vol. 5, Issue 8, pp.14055-14061.
All rights reserverd @ IJCAT Journal www.IJCAT.org