An Efficient Approach to Mine High Utility Itemsets

Authors(4) :-Rayhan Ahmed Simanto, Ahmed Abdal Shafi Rasel, Rianon Zaman, Md. Towhidul Islam Robin

High utility itemsets refer to the sets of items with high utility like profit in a database, and efficient mining of high utility itemsets plays a crucial role in many real life applications and is an important research issue in data mining area. To identify high utility itemsets, most existing algorithms first generate candidate itemsets by overestimating their utilities, and subsequently compute the exact utilities of these candidates. These algorithms incur the problem that a very large number of candidates are generated, but most of the candidates are found out to be not high utility after their exact utilities are computed. In this paper, we propose an algorithm, called HUI-Miner (High Utility Itemset Miner), for high utility itemset mining. HUI-Miner uses a novel structure, called utility-list, to store both the utility information about an itemset and the heuristic information for pruning the search space of HUI-Miner. By avoiding the costly generation and utility computation of numerous candidate itemsets, HUI-Miner can efficiently mine high utility itemsets from the utility lists constructed from a mined database.

Authors and Affiliations

Rayhan Ahmed Simanto
Stamford University Bangladesh, Dhaka, Bangladesh
Ahmed Abdal Shafi Rasel
Stamford University Bangladesh, Dhaka, Bangladesh
Rianon Zaman
Stamford University Bangladesh, Dhaka, Bangladesh
Md. Towhidul Islam Robin
Stamford University Bangladesh, Dhaka, Bangladesh

Frequent itemset, Association rule mining, Utility set, Cluster based mining.

  1. Frequent Itemset Mining Dataset Repository. http://fimi.ua.ac.be/, 2012.
  2. NU-MineBench: A Data Mining Benchmark Suite. http://cucis.ece.northwestern.edu/projects/DMS/MineBench.html, 2012.
  3. Valgrind: A GPL-d System for Debugging and Profiling Linux Programs. http://valgrind.org/, 2012.
  4. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In Proc. Int'l Conf.Very Large Data Bases, pages 487-499, 1994.
  5. C. F. Ahmed, S. K. Tanbeer, B.-S. Jeong, and Y.-K.Lee. Efficient tree structures for high utility pattern mining in incremental databases. IEEE Transactions on Knowledge and Data Engineering, 21(12):1708-1721, 2009.
  6. B. Barber and H. J. Hamilton. Extracting share frequent itemsets with infrequent subsets. Data Mining and Knowledge Discovery, 7(2):153-185, 2003.
  7. A. Ceglar and J. F. Roddick. Association mining. ACM Computing Surveys, 38(2), 2006.
  8. J. Han, H. Cheng, D. Xin, and X. Yan. Frequent pattern mining: Current status and future directions. Data Mining and Knowledge Discovery, 15(1):55-86, 2007.
  9. J. Han, J. Pei, Y. Yin, and R. Mao. Mining frequent patterns without candidate generation: A frequent pattern tree approach*. Data Mining and Knowledge.
  10. J. Hu and A. Mojsilovic. High-utility pattern mining: A method for discovery of high-utility item sets. Pattern Recognition, 40(11):3317 - 3324, 2007.
  11. Y.-C. Li, J.-S. Yeh, and C.-C. Chang. Direct candidates generation: A novel algorithm for discovering complete share-frequent itemsets. In Proc. Fuzzy Systems and Knowledge Discovery, pages 551-560, 2005.

Publication Details

Published in : Volume 3 | Issue 5 | July-August 2017
Date of Publication : 2017-08-31
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 429-433
Manuscript Number : IJSRSET1734110
Publisher : Technoscience Academy

Print ISSN : 2395-1990, Online ISSN : 2394-4099

Cite This Article :

Rayhan Ahmed Simanto, Ahmed Abdal Shafi Rasel, Rianon Zaman, Md. Towhidul Islam Robin, " An Efficient Approach to Mine High Utility Itemsets, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 3, Issue 5, pp.429-433, July-August-2017.
Journal URL : http://ijsrset.com/IJSRSET1734110

Follow Us

Contact Us