FEA-HUIM: Fast and Efficient Algorithm for High Utility Item-Set Mining Using Novel Data Structure and Pruning Strategy

Authors(3) :-Suresh B. Patel, Mahendra N. Patel, Dr. S. M. Shah

The aim is to recognize the item sets from transaction databases that direct the high profit of the business. It identifies groups of items that are brought together that earn a high profit. It can help the owner to earn more by promoting the sales of high utility items, so High Utility mining has attracted significant attention from the researchers. A number of algorithms have been designed to mine high-utility item-sets using various approaches and various data structures. However, it is necessary to improve the existing methods in terms of execution time and memory consumption. All previous high utility item-set mining algorithms like two-phase, HUI-Miner, FHM, mHUI-Miner scan the database multiple times. From the observation that we identified the performance of the algorithms can be improved by reducing the database scanning frequency and cost. In previous algorithms like HUI-Miner and mHUI-Miner, performs a time-consuming utility lists join operation on item-sets. In this research we propose a novel data structure Item Utility Matrix with Index vector and efficient procedure to join the utility list. We also propose a transaction aggregation to reduce the size of utility list. Our proposed algorithm outperforms the previous methods in execution time required.

Authors and Affiliations

Suresh B. Patel
PG Scholar, Computer Engineering Department, Government Engineering College, Modasa, Gujarat, India
Mahendra N. Patel
PG Scholar, Computer Engineering Department, Government Engineering College, Modasa, Gujarat, India
Dr. S. M. Shah
Computer Engineering Department, Government Engineering College, Modasa, Gujarat, India

Data Mining, High Utility Item-set, Transaction Weighted Utility, Item Utility Matrix, Index Vector.

  1. J. F. R. Ceglar, Aaron, "Association mining," in ACM Computing Surveys (CSUR), 2006, pp. 5–5.
  2. S. R. Agrawal R, "Fast algorithms for mining association rules in large databases," in Proceedings of the 20th international conference on very large databases, 1994, pp. 487–499.
  3. & M. Han, J., Pei, J., Yin, Y., "Mining frequent patterns without candidate generation: A frequent-pattern tree approach," Data Min. Knowl. Discov., vol. 8, no. 1, pp. 53–87, 2004.
  4. Y. Liu, W. Liao, and A. Choudhary, "A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets," in Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, 2010, pp. 253–262.
  5. M. Liu and J. Qu, "Mining High Utility Itemsets without Candidate Generation Categories and Subject Descriptors," in Proceedings of the 21st ACM international conference on Information and knowledge management, 2012, pp. 55–64.
  6. P. Fournier-Viger, C. W. Wu, S. Zida, and V. S. Tseng, "FHM: Faster high-utility itemset mining using estimated utility co-occurrence pruning," Springer, Cham. pp. 83–92, 2014.
  7. V. S. Tseng, C. W. Wu, P. Fournier-Viger, and P. S. Yu, "Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases," IEEE Trans. Knowl. Data Eng., vol. 28, no. 1, pp. 54–67, 2016.
  8. J. B. Ahmed CF, Tanbeer SK, "Mining high utility web access sequences in dynamic web log data," in Proceedings of the international conference on software engineering artificial intelligence networking and parallel/distributed computing, IEEE, London, UK, 2010, pp. 76–81.
  9. T. V. Liu Y, Cheng C, "Mining differential top-k co-expression patterns from time course comparative gene expression datasets," BMC Bioinform, vol. 14. p. 230, 2013.
  10. Q. Li, "Data Mining Association Analysis Algorithm." Harbin: Harbin Engineering University, 2010.
  11. Y. Q. Lin, "A Review of Association Rules Mining Algorithm[J]," Softw. Guid., vol. 11, pp. 27–29, 2012.
  12. Z. W. Chi, X., & Fang, "Review of association rule mining algorithm in data mining," in In Communication Software and Networks (ICCSN), 2011 IEEE 3rd International Conference on, 2011, pp. 512–516.
  13. Y. D. (2001) Pei J, Han J, Lu H, Nishio S, Tang S, "H-Mine: hyper-structure mining of frequent patterns in large databases.," in In: Proceedings of the 2001 IEEE international conference on data mining, IEEE, San Jose, CA, 2001, pp. 441–448.
  14. C. F. Ahmed, S. K. Tanbeer, B. Jeong, and Y. Lee, "Mining High Utility Patterns in Incremental Databases," IEEE Trans. Knowl. DATA Eng., vol. 21, no. 12, pp. 656–663, 2009.
  15. M. Liu and J. Qu, "Mining High Utility Itemsets without Candidate Generation Categories and Subject Descriptors," in Proceedings of the 21st ACM international conference on Information and knowledge management, 2012, pp. 55–64.
  16. V. Tseng, C. Wu, B. Shie, and P. Yu, "UP-Growth: an efficient algorithm for high utility itemset mining," in Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, 2010, pp. 253–262.
  17. P. R. Alex Yuxuan Peng, Yun Sing Koh, "mHUIMiner: A Fast High Utility Itemset Mining Algorithm for Sparse Datasets," in Pacific-Asia Conference on Knowledge Discovery and Data Mining, 2017, pp. 196–207.

Publication Details

Published in : Volume 4 | Issue 2 | January-February 2018
Date of Publication : 2018-01-20
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 138-144
Manuscript Number : IJSRSET184225
Publisher : Technoscience Academy

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

Cite This Article :

Suresh B. Patel, Mahendra N. Patel, Dr. S. M. Shah, " FEA-HUIM: Fast and Efficient Algorithm for High Utility Item-Set Mining Using Novel Data Structure and Pruning Strategy, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 4, Issue 2, pp.138-144, January-February-2018.
Journal URL : http://ijsrset.com/IJSRSET184225

Article Preview

Follow Us

Contact Us