Implementation and Performance analysis UP-Growth for Mining High Utility Itemsets in Transactional Database

Authors(2) :-Bhavan Lokhande, Prof. Hemlata Dakhore

Data mining can be described as a development that thinks some learning contained in far reaching exchange databases. Standard data mining procedures have focused, as it were, on finding the things that are more successive in the exchange databases, which is furthermore called visit itemset mining. These data mining procedures relied on upon support conviction show. Itemsets which appear to be more as often as possible in the database must be of all the all the more proposing to the customer from the business viewpoint. In this paper we demonstrate a creating domain called as High Utility Itemset Mining that finds the itemsets considering the repeat of the itemset and also utility associated with the itemset. Each itemset have regard like sum, advantage and other customer's favourable position. This regard associated with everything in a database is known as the utility of that itemset. Those itemsets having utility qualities more vital than given edge are called high utility itemsets. This issue can be recognized as mining high utility itemsets from exchange database. In various areas of expert retail, stock et cetera fundamental initiative is key. So it can help in mining count, the closeness of everything in an exchange database is addressed by a matched regard, without considering its sum or a related weight, for instance, cost or advantage. However sum, advantage and weight of an itemset are important for recognizing certifiable decision issues that require extending the utility in an affiliation. Mining high utility itemsets from exchange database presents a more imperative test as differentiated and regular itemset mining, since unfriendly to monotone property of incessant itemsets is not fitting in high utility itemsets. In this paper, we analyse the performance of UP-Growth for efficient discovery of high utility itemset.

Authors and Affiliations

Bhavan Lokhande
Department of Computer Science & Engineering, G.H. Raisoni Institute of Engineering & Technology, Nagpur, India
Prof. Hemlata Dakhore
Department of Computer Science & Engineering, G.H. Raisoni Institute of Engineering & Technology, Nagpur, India

High utility pattern, closed high utility itemset, utility mining, lossless and concise representation, pattern mining

  1. R. Agarwal, C. Aggarwal, and V. Prasad, “Depth first generation of long patterns,” in Proc. ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2000, pp. 108–118.
  2. R. Agrawal, T. Imielinski, and A. Swami, “Mining association rules between sets of items in large databases,” in Proc. ACM SIGMOD Int. Conf. Manage. Data, 1993, pp. 207–216.
  3. R. Agrawal and R. Srikant, “Fast algorithms for mining association rules,” in Proc. 20th Int. Conf. Very Large Databases, 1994, pp. 487–499.
  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,” IEEE Trans. Knowl. Data Eng., vol. 21, no. 12, pp. 1708– 1721, Dec. 2009.
  5. R. Bayardo and R. Agrawal, “Mining the most interesting rules,” in Proc. 5th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 1999, pp. 145–154.
  6. F. Bonchi and B. Goethals, “FP-Bonsai: The art of growing and pruning small FP-trees,” in Proc. 8th Pacific-Asia Conf. Adv. Knowl. Discovery Data Mining, 2004, pp. 155–160.
  7. F. Bonchi and C. Lucchese, “Extending the state-of-the-art of constraint-based pattern discovery,” Data Knowl. Eng., vol. 60, no. 2, pp. 377–399, 2007.
  8. C. Bucila, J. Gehrke, D. Kifer, and W. M. White, “Dualminer: A dual-pruning algorithm for itemsets with constraints,” Data Mining Knowl. Discovery, vol. 7, no. 3, pp. 241–272, 2003.
  9. C. H. Cai, A. W. C. Fu, C. H. Cheng, and W. W. Kwong, “Mining association rules with weighted items,” in Proc. Int. Database Eng. Appl. Symp., 1998, pp. 68–77.
  10. R. Chan, Q. Yang, and Y. Shen, “Mining high utility itemsets,” in Proc. Int. Conf. Data Mining, 2003, pp. 19–26.
  11. S. Dawar and V. Goyal, “UP-Hist tree: An efficient data structure for mining high utility patterns from transaction databases,” in Proc. 19th Int. Database Eng. Appl. Symp., 2015, pp. 56–61.
  12. T. De Bie, “Maximum entropy models and subjective interestingness: An application to tiles in binary databases,” Data Mining Knowl. Discovery, vol. 23, no. 3, pp. 407–446, 2011.
  13. L. De Raedt, T. Guns, and S. Nijssen, “Constraint programming for itemset mining,” in Proc. ACM SIGKDD, 2008, pp. 204–212.
  14. A. Erwin, R. P. Gopalan, and N. R. Achuthan, “Efficient mining of high utility itemsets from large datasets,” in Proc. 12th Pacific-Asia Conf. Adv. Knowl. Discovery Data Mining, 2008, pp. 554–561.
  15. P. Fournier-Viger, C.-W. Wu, S. Zida, and V. S. Tseng, “FHM: Faster high-utility itemset mining using estimated utility cooccurrence pruning,” in Proc. 21st Int. Symp. Found. Intell. Syst., 2014, pp. 83–92.
  16. L. Geng and H. J. Hamilton, “Interestingness measures for data mining: A survey,” ACM Comput. Surveys, vol. 38, no. 3, p. 9, 2006.
  17. J. Han, J. Pei, and Y. Yin, “Mining frequent patterns without candidate generation,” in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2000, pp. 1–12.
  18. R. J. Hilderman, C. L. Carter, H. J. Hamilton, and N. Cercone, “Mining market basket data using share measures and characterized itemsets,” in Proc. PAKDD, 1998, pp. 72–86.
  19. R. J. Hilderman and H. J. Hamilton, “Measuring the interestingness of discovered knowledge: A principled approach,” Intell. Data Anal., vol. 7, no. 4, pp. 347–382, 2003.
  20. M. Holsheimer, M. Kersten, H. Mannila, and H. Toivonen, “A perspective on databases and data mining,” in Proc. 1st Int. Conf. Knowl. Discovery Data Mining, 1995, pp. 150–155.
  21. S. Krishnamoorthy, “Pruning strategies for mining high utility itemsets,” Expert Syst. Appl., vol. 42, no. 5, pp. 2371–2381, 2015.
  22. G.-C. Lan, T.-P. Hong, and V. S. Tseng, “An efficient projectionbased indexing approach for mining high utility itemsets,” Knowl. Inf. Syst., vol. 38, no. 1, pp. 85–107, 2014.
  23. Y.-C. Li, J.-S. Yeh, and C.-C. Chang, “Isolated items discarding strategy for discovering high utility itemsets,” Data Knowl. Eng., vol. 64, no. 1, pp. 198–217, 2008.
  24. T. Y. Lin, Y. Y. Yao, and E. Louie, “Value added association rules,” in Proc. 6th Pacific-Asia Conf. Adv. Knowl. Discovery Data Mining, 2002, pp. 328–333.
  25. J. Liu, Y. Pan, K. Wang, and J. Han, “Mining frequent item sets by opportunistic projection,” in Proc. 8th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2002, pp. 229–238.

Publication Details

Published in : Volume 2 | Issue 3 | May-June 2017
Date of Publication : 2017-06-30
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 540-547
Manuscript Number : CSEIT172355
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

Bhavan Lokhande, Prof. Hemlata Dakhore, "Implementation and Performance analysis UP-Growth for Mining High Utility Itemsets in Transactional Database", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 2, Issue 3, pp.540-547, May-June-2017.
Journal URL : http://ijsrcseit.com/CSEIT172355

Article Preview

Follow Us

Contact Us