Enhancing the Performance of Association Rule Generation over Dynamic Data using Incremental Tree Structures

##plugins.themes.academic_pro.article.sidebar##

Published Oct 31, 2022
https://doi.org/10.47164/ijngc.v13i3.806
Download
Requires Subscription PDF
Statistic

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...
Volume 13, Special Issue 3, October 2022

##plugins.themes.academic_pro.article.main##

NARESH P
VEL TECH UNIVERSITY
R Suguna

Abstract

To discover a novel and dynamic approach for frequent itemsets generation and also for generating association rules is an imperative aspect in data mining. With the fast increase in databases, new transactions added, the incremental mining is acquainted to resolve the issues of maintaining association rules in updated databases. Earlier algorithms focused on this problem which consumed more time and costly to mine. This paper intends to analyze the tree construction like Frequent Pattern-tree(FP),PreOrderCoded(POC) tree and PrePostCoded(PPC) tree for sinking overheads and time constraints. To overcome theissueof updating association rules when new transactions addition this paper proposes a dynamic frequent itemsets mining approach using Incremental PreOrderCoded (IPOC)tree. This will reduce computational and scanning overheads of original dataset against addition of new transaction items and also works in an optimized way. An analysis was done on existing algorithms and compares time complexities for various standard datasets. The proposed approach shown better performance against existed ones over time and efficiency.

##plugins.themes.academic_pro.article.details##

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite
P, N., & R Suguna. (2022). Enhancing the Performance of Association Rule Generation over Dynamic Data using Incremental Tree Structures. International Journal of Next-Generation Computing, 13(3). https://doi.org/10.47164/ijngc.v13i3.806
Crossref
Scopus
Google Scholar
Europe PMC

References

  1. Madhu V. Ahluwalia, AryyaGangopadhyay, ZhiyuanChenand Yelena Yesha,“Target-Based,Privacy Preserving, and Incremental Association Rule Mining”,Ieee Transactions on Services Computing,pp.1-14,2015.
  2. Yang, J., Zhang, Y., Wei, Y.: An improved vertical algorithmfor frequent itemset mining from uncertain database.In: Intelligent Human-Machine Systems and Cybernetics(IHMSC), vol. 1, pp. 355–358 (2017) DOI: https://doi.org/10.1109/IHMSC.2017.87
  3. Grahne, G., Zhu, J.: Fast Algorithms for Frequent Itemset Mining Using FP-Trees. Trans-actions on Knowledge and Data Engineering, 17(10), pp. 1347-1362 (2005) DOI: https://doi.org/10.1109/TKDE.2005.166
  4. Liu, J., Wu, Y., Zhou, Q., Fung, B.C., Chen, F., Yu, B.: Parallel Eclat for Opportunistic Mining of Frequent Itemsets. In: Int. Conf. on Database and Expert Systems Applications, pp. 401-415 (2015) DOI: https://doi.org/10.1007/978-3-319-22849-5_27
  5. Elfangary, L.,Atteya, W.A.: “Mining Medical Database using Proposed Incremental Association rule Algorithm (PIA)”; Second International Conference on the Digital Society, IEEE (2008).. DOI: https://doi.org/10.1109/ICDS.2008.10
  6. Y. Li, Z.-H. Zhang, W.-B. Chen, F. Min, “TDUP: an approach to incremental mining of frequent itemsetswith three-way-decision pattern updating”, Int. J. Mach. Learn. & Cyber.DOI 10.1007/s13042-015-0337-6, 2015. DOI: https://doi.org/10.1007/s13042-015-0337-6
  7. Mohammed M. Fouad, Mostafa G.M. Mostafa, “IndxTAR: An Efficient Algorithm for Indexed Mining of Incremental Temporal Association Rules”,International Journal of Computer Information Systems and Industrial Management Applications. ISSN 2150-7988 Volume 9, pp.103-113, 2017.
  8. Jiaojiao Sun, YalingXun et al, “Incremental Frequent Itemsets Miningwith FCFP Tree”, IEEE Access, 2019.
  9. Lee G, Yun U, Ryang H (2015) Mining weighted erasable patterns by using underestimated constraint-based pruning technique. J Intell Fuzzy Syst 28(3):1145–1157. DOI: https://doi.org/10.3233/IFS-141398
  10. Y. Unil, G. Lee, "Incremental mining of weighted maximal frequentitemsets from dynamic databases" Expert Systems with Applications,vol. 54, pp. 304–327, 2016. DOI: https://doi.org/10.1016/j.eswa.2016.01.049
  11. Nori F, Deypir M, Sadreddini MH (2013) A sliding-window based algorithm for frequent closed itemset mining over data streams. J SystSoftw 86(3):615–623 DOI: https://doi.org/10.1016/j.jss.2012.10.011
  12. Le T, Vo B, Nguyen G (2014) A survey of erasable itemset mining algorithms. WIREs: Data Min KnowlDiscov 4(5):356–379 DOI: https://doi.org/10.1002/widm.1137
  13. RatchadapornAmornchewin, WorapojKreesuradej, “Mining Dynamic Databases using Probability-BasedIncremental Association Rule Discovery Algorithm”, Journal of Universal Computer Science, vol. 15, no. 12 (2009), 2409-2428.
  14. Yu-Geng Song, Hui-Min Cui and Xiao-Bing Feng, “Parallel Incremental Frequent Itemset Mining for Large Data”, Journal of Computer Science and Technology 32(2): 368–385 Mar. 2017. DOI: https://doi.org/10.1007/s11390-017-1726-y
  15. RatchadapornAmornchewin, and WorapojKreesuradej,“False Positive Item set Algorithm for Incremental Association RuleDiscovery”, International Journal of Multimedia and Ubiquitous EngineeringVol. 4, No. 2,pp.1-14, April, 2009.
  16. Qiu, Ping, Long Zhao, and Xiangjun Dong, "NegI-NSP: Negativesequential pattern mining based on loose constraints," IECON2017-43rd Annual Conference of the IEEE Industrial ElectronicsSociety. IEEE, pp. 3419–3425, 2017. DOI: https://doi.org/10.1109/IECON.2017.8216579
  17. Zhi-Hong Deng , Sheng-Long Lv, “PrePost+: An efficient N-lists-based algorithm for mining frequentitemsets via Children–Parent Equivalence pruning”, Expert Systems with Applications 42 (2015) 5424–5432. DOI: https://doi.org/10.1016/j.eswa.2015.03.004
  18. Zhi-Hong Deng, Sheng-Long Lv, “Fast mining frequent itemsets using Nodesets”, Expert Syst. Appl. 41(10): 4505-4512 (2014). DOI: https://doi.org/10.1016/j.eswa.2014.01.025
  19. David W. Cheung, Jiawei Han, Vincent T. Ng and C. Y. Wong, “Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique”, Proceedings of the Twelfth International Conference on Data Engineering, February 26 - March 1, 1996, New Orleans, Louisiana, pp. 106-114.
  20. Tsai PSM (2010) Mining top-k frequent closed itemsets over data streams using the sliding-window model. ExpSystAppl 37(10):6968–6973 DOI: https://doi.org/10.1016/j.eswa.2010.03.023
  21. Lichun Li, Rongxing Lu, Kim-Kwang Raymond Choo, AnwitamanDatta, and Jun Shao. (2016), “Privacy-Preserving-Outsourced Association Rule Mining on Vertically Partitioned Databases”, IEEE Transactions on Information Forensics and Security. 11 (8), p1-15. DOI: https://doi.org/10.1109/TIFS.2016.2561241
  22. Abdelhamid, E., Canim, M., Sadoghi, M., Bhattacharjee, B., Chang, Y.C. and Kalnis, P., 2017. Incremental frequent subgraph mining on large evolving graphs. IEEE Transactions on Knowledge and Data Engineering, 29(12), pp.2710-2723. DOI: https://doi.org/10.1109/TKDE.2017.2743075
  23. Zhang, S., Du, Z. and Wang, J.T., 2014. New techniques for mining frequent patterns in unordered trees. IEEE transactions on cybernetics, 45(6), pp.1113-1125. DOI: https://doi.org/10.1109/TCYB.2014.2345579
  24. Zhi-Jun X, Hong C, Li C (2006) An efficient algorithm for frequent itemset mining on data streams. In: ICDM’06, pp 474–491 DOI: https://doi.org/10.1007/11790853_37
  25. C.F. Ahmed, S.K. Tanbeer, B.S. Jeong, Y.K. Lee, Efficient tree structures for highutility pattern mining in incremental databases, IEEE Trans. Knowl. Data Eng.21 (2009) 1708–1721. DOI: https://doi.org/10.1109/TKDE.2009.46
  26. Li YC, Yeh JS, Chang CC (2005) Efficient algorithms for mining share-frequent itemsets. In: The world congress of international fuzzy systems association, pp 539–543
  27. MortezaZihayat, Yan Chen ,Aijun An, “Memory-Adaptive High Utility Sequential Pattern Mining Over Data Stream”, Published in Springer Journal on Machine Learning. Vol. 106. Issue 6. pp.799–836, 2017. DOI: https://doi.org/10.1007/s10994-016-5617-1