Depth Impurity Pruned Strategies for Extracting High Utility Itemsets

  • Authors

    • K Santhi
    • B Valarmathi
    • T Chellatamilan
    2018-06-25
    https://doi.org/10.14419/ijet.v7i3.4.16747
  • Depth Impurity, Execution time, high utility itemset mining, Itemset, Pruned strategies

  • Abstract

    Normally in a transaction database mining high utility itemsets indicates to the location of itemsets which is causing high utility like benefits. In spite of the fact that various important calculations have been proposed as of late, they bring about the issue of generating a huge amount of itemsets for mining to discover HUI. Mining is reduced by such an extended quantity as far as execution time and space complexity. When the database contains large amount of transactions, this condition may turn into mediocre. In this research paper, we account this concern by offering a state-of-the-art calculation named Depth Impurity Quality Index Pruned strategies which considers the complexity of sub-trees to more efficiently identify high-utility itemsets. It is an collection of common itemset which are used for mining and is significantly harder, inflexible. This is imputable to the absence of intrinsic organizational behaviour of  HUI which could have worked. This paper suggests a high utility mining technique which make use of novel pruning approaches.The experimental outcomes disclose that the proposed method is exceptionally viable in killing unhopeful applicants  in the   database transactions.

  • References

    1. [1] Lin, J. C. W., Ren, S., Fournier-Viger, P., & Hong, T. P. (2017). EHAUPM: Efficient High Average-Utility Pattern Mining With Tighter Upper Bounds. IEEE Access, 5, 12927-12940.

      [2] Liu, Y., Liao, W.-k., &Choudhary, A. (2005). A two-phase algorithm for fast discoveryof high utility itemsets. In T. Ho, D. Cheung, & H. Liu (Eds.), Advances inKnowledge Discovery and Data Mining(pp. 689–695). volume 3518 of LectureNotes in Computer Science.

      [3] Lin, J. C. W., Li, T., Fournier-Viger, P., Hong, T. P., Zhan, J., & Voznak, M. (2016). An efficient algorithm to mine high average-utility itemsets. Advanced Engineering Informatics, 30(2), 233-243.

      [4] Li, Y.-C., Yeh, J.-S., & Chang, C.-C. (2008). Isolated items discarding strategy fordiscovering high utility itemsets. Data & Knowledge Engineering, 64, 198–217.

      [5]Ahmed, C. F., Tanbeer, S. K., Jeong, B.-S., & Lee, Y.-K. (2011). Huc-prune: An efficientcandidate pruning technique to mine high utility patterns. Applied Intelligence,34, 181–198.

      [6] Tseng, V. S., Shie, B.-E., Wu, C.-W., & Yu, P. S. (2012). Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Transactions on Knowledge and Data Engineering, 25,1772–1786. http://dx.doi.org/10.1109/TKDE.2012.59.

      [7]Liu, M., &Qu, J. (2012). Mining high utility itemsets without candidate generation.In Proceedings of the 21st ACM international conference on information andknowledge management CIKM ’12 (pp. 55–64). New York, NY, USA: ACM.

      [8] Liu, Y., Liao, W.-k., &Choudhary, A. (2005). A two-phase algorithm for fast discoveryof high utility itemsets. In T. Ho, D. Cheung, & H. Liu (Eds.), Advances inKnowledge Discovery and Data Mining(pp. 689–695). volume 3518 of LectureNotes in Computer Science

      [9] Lan, G.-C., Hong, T.-P., Tseng, V. S., et al. (2012). An efficient gradual pruningtechnique for utility mining. International Journal of Innovative ComputingInformation and Control, 8, 5165–5178

      [10]Lan, G.-C., Hong, T.-P., & Tseng, V. S. (2014). An efficient projection-based indexingapproach for mining high utility itemsets. Knowledge and Information Systems,38, 85–107

      [11] Erwin, A., Gopalan, R. P., &Achuthan, N. (2007). A bottom-up projection basedalgorithm for mining high utility itemsets. Proceedings of the 2nd internationalworkshop on Integrating artificial intelligence and data mining (vol.84, pp. 3–11).Australian Computer Society, Inc..

      [12] Wu, R. & He, Z.(2018).Top-k high average-utility itemsets mining with effective pruning strategies, Appl Intell (2018). https://doi.org/10.1007/s10489-018-1155-9.

      [13] Liu, J., Wang, K., & Fung, B. (2012). Direct discovery of high utility itemsets withoutcandidate generation. In Proceedings of the 2012 IEEE 12th internationalconference on data mining (pp. 984–989). IEEE Computer Society

      [14] KrishnamoorthyS(2015) Pruning strategies for mining high utility itemsets.Expet Systems with Applications,42(5):2371-2381

      [15] Fournier–Viger P, Wu CW, Zida S,T seng VS (2014)FHM:Faster high-utility itemset mining using estimated utility co-occurrence pruning.Proceedings of the 21st International Symposium on Methodologies for intelligent systems, Roskilde, Denmark, June 2014.Lecture Nots in Artificial Intelligence 9384,Springer, Berling, oo.83-92

      [16] Shao J, Meng X, Cao L (2016) Mining actionable combined high utility incremental and associated patterns. In: Ieee/csaa International conference on aircraft utility systems, pp 1164–1169

  • Downloads

  • How to Cite

    Santhi, K., Valarmathi, B., & Chellatamilan, T. (2018). Depth Impurity Pruned Strategies for Extracting High Utility Itemsets. International Journal of Engineering & Technology, 7(3.4), 52-56. https://doi.org/10.14419/ijet.v7i3.4.16747

    Received date: 2018-08-03

    Accepted date: 2018-08-03

    Published date: 2018-06-25