Mining of Closed High-Utility Itemsets in Dynamic and Incremental Databases

Vishwash Singh

Mining of Closed High-Utility Itemsets in Dynamic and Incremental Databases

Authors: Vishwash Singh

Published: 2025-02-21 19:29:42.721

Abstract

The strategy in this study relates to Closed High Utility Itemset mining in dynamic and incremental databases, with focus on efficiency enhancement and adaptability. The investigation was conducted with respect to tree hierarchies, vertical header lists, transaction-weighted utilization, subtree utility, and updating mechanisms for optimizing the outcomes of CHUI mining. A quantitative method was used for the validation of five hypotheses, proving substantial improvements in runtime, scalability, and accuracy of data. Results will highlight an urgent need for dynamic frameworks in AI-driven decision-making and data analysis. Future work should consider expanded diverse database environments and alternative strategies in response to emerging trends in utility mining.

Keywords

Dynamic Databases, Vertical Header Lists, Subtree Utility, Updating Mechanisms

References

Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, 1-12.
Tseng, V. S., Wu, C. W., & Shie, B. E. (2010). Efficient algorithms for mining high utility item sets from transactional databases. IEEE Transactions on Knowledge and Data Engineering, 25(8), 1772–1786.
Lin, J. C. W., & Zhang, X. (2020). Dynamic utility mining: A survey of foundational concepts and recent advancements. Data Mining and Knowledge Discovery, 34(5), 1289–1325.
Leung, C. K. S., & Carmichael, C. L. (2008). Exploring the use of tree-based structures in mining high utility patterns. Information Systems Frontiers, 12(3), 255–265.
Fournier-Viger, P., Lin, C. W., & Tseng, V. S. (2014). A survey of recent advancements in utility mining. Springer Lecture Notes in Computer Science, 1–17.
Aggarwal, C. C., & Yu, P. S. (1998). A new framework for itemset mining in evolving data streams. Proceedings of the ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 25-32.
Liu, Y., Liao, W., & Choudhary, A. (2005). A fast high utility item sets mining algorithm. Proceedings of the 2005 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 420–429.

Download PDF

How to Cite

Vishwash Singh, (2025-02-21 19:29:42.721). Mining of Closed High-Utility Itemsets in Dynamic and Incremental Databases. Abhi International Journal of Artificial Intelligence Applications in Engineering, Volume zZUTWSDuBR78pc6zbKip, Issue 1.

ISSN: XXXX-XXXX

Abhi International Journal of
Artificial Intelligence Applications in Engineering ( AIJAIAE )