High Utility Rare Itemset Mining (HURI): An approach for extracting high-utility rare item sets

Jyothi Pillai*, O.P. Vyas**
* Associate Professor, Bhilai Institute of Technology, Durg, Chhattisgarh, India.
** Professor, Indian Institute of Information Technology Allahabad, Uttar Pradesh, India.
Periodicity:August - October'2011
DOI : https://doi.org/10.26634/jfet.7.1.1677

Abstract

Association Rule Mining (ARM) is a well-studied technique that identifies frequent itemsets from datasets and generates association rules by assuming that all items have the same significance and frequency of occurrence without considering their utility. But in a number of real-world applications such as retail marketing, medical diagnosis, client segmentation etc., utility of itemsets is based on cost, profit or revenue. Utility Mining aims to identify itemsets with highest utilities by considering profit, quantity, cost or other user preferences.

Rare items are items that occur less frequently in a transaction dataset. High Utility Itemsets may either be frequent or rare. Similarly rare itemset may be of high or low utility.

In many real-life applications, high-utility itemsets consist of rare items. Rare itemsets provide useful information in different decision-making domains, customers purchase microwave ovens or plasma televisions rarely as compared to bread, washing powder, soap etc. The former may yield more profit for the supermarket than the latter. Koh and Rountree (2005) proposed a modified apriori inverse algorithm to generate rare itemsets of user interest.

In this paper, the authors propose a High Utility Rare Itemset Mining [HURI] algorithm that uses the concept of apriori inverse, for generating high utility rare itemsets of users’ interest[Koh and Rountree (2005)]. We demonstrate the approach with a synthetic dataset. Apriori inverse is used to find only the rare itemsets. HURI is used to find those rare itemsets, which are of high utility according to users’ preferences, i.e., algorithm for generation of rare itemsets is extended to find high-utility rare itemsets.

Keywords

Association Rule Mining, Utility Mining, Rare itemset, High Utility Rare itemset Mining.

How to Cite this Article?

Pillai, J., and Vyas , O. P. (2011). High Utility Rare Itemset Mining (Huri): An Approach for Extracting High-Utility Rare item sets. i-manager’s Journal on Future Engineering and Technology, 7(1), 25-33. https://doi.org/10.26634/jfet.7.1.1677

References

[1]. Adda M., Wu L., and Feng Y. (2007). “Rare Itemset Mining”, Sixth International conference on Machine Learning and Applications, pp. 73- 80.
[2]. Agrawal R., Imielinski T., and Swami A. (1993). "Mining association rules between sets of items in large databases", Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, pp. 207–216.
[3]. Erwin A., Gopalan R.P.and. and Achuthan N. R (2007). “A Bottom-up Projection based Algorithm for mining high utility itemsets”, in Proceedings of 2nd Workshop on integrating AI and Data Mining(AIDM 2007)”, Australia, Conferences in Research and Practice in Information Technology (CRPIT),Vol. 84.
[4]. Hu J., and Mojsilovic A. (2007). “High-utility pattern mining: A method for discovery of high-utility item sets”, Pattern Recognition 40 3317 – 3324.
[5]. Koh Y.S., and Rountree N. (2005). “Finding Sporadic Rules Using Apriori-Inverse”, Advances in Knowledge Discovery and Data Mining, Lecture Notes in Computer Science, Volume 3518/2005, 153-168.
[6]. Jyothi Pillai, and Vyas O.P. (2011). “User centric approach to itemset utility mining in Market Basket Analysis”, International Journal on Computer Science and Engineering (IJCSE) ISSN : 0975-3397, Vol. 3, No. 1 Jan, pp. 393-400.
[7]. Jyothi Pillai, and Vyas O.P., (2010). “Overview of Itemset Utility Mining and its Applications”, International Journal of Computer Applications (0975 – 8887) Volume 5– No.11, August, Pp. 9-13.
[8]. Jyothi Pillai, Vyas O.P., Sunita Soni, and Maybin Muyeba (2010). “A Conceptual Approach to Temporal Weighted Itemset Utility Mining”, International Journal of Computer Applications (0975 - 8887) Volume 1 – No. 28.
[9]. Lan G.C., Hong T.P., and Tseng V.S. (2011). “A Novel Algorithm for Mining Rare-Utility Itemsets in a Multi- Database Environment ”, The 26th Workshop on Combinatorial Mathematics and Computation Theory, pp. 293- 302.
[10]. Liu, Y., Liao, W., and Choudhary, A. (2005). “A Fast High Utility Itemsets Mining Algorithm”, In Proceedings of the Utility- Based Data Mining Workshop, August.
[11]. R.U. Kiran, and P.K. Reddy (2009). “An improved multiple minimum support based approach to mine rare association rules”, IEEE symposium on Computational Intelligence and Data Mining.
[12]. Shankar S., Purusothoman T.P., Jayanthi S., and Babu N., (2009). “A Fast Algorithm for Mining High Utility Itemsets”, Proceedings of IEEE International Advance Computing Conference (IACC), Patiala, India, pp. 1459 – 1464.
[13]. Szathmary L., Napoli A., and Valtchev P. (2007). “Towards Rare Itemset Mining”, Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence, Volume 1, Pages: 305-312, ISSN:1082-3409, 0-7695-3015-X.
[14]. Yao, H., and Hamilton, H,J. (2006). “Mining Itemset Utilities from Transaction Databases”, Data and Knowledge Engineering, 59(3): 603-626.
[15]. Yao H., Hamilton H., and Geng L. (2006). “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.
[16]Yao H., Hong, Hamilton H., and Butz, C. J. (2004). “A Foundational Approach to Mining Itemset Utilities from Databases”, Proceedings of the Third SIAM International Conference on Data Mining, Orlando, Florida, pp. 482- 486.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.