Dynamic Association Mining Techniques for the Faster Extraction of High Utility Itemsets from Incremental Databases
Received: 16 October 2024 | Revised: 6 November 2024 | Accepted: 21 November 2024 | Online: 2 February 2025
Corresponding author: Subba Reddy Meruva
Abstract
Financial and market analysis applications require the mining of strong-utility itemsets. Finding frequent itemsets with high utility patterns is vital for such wide applications. Recent utility-based mining methods were successfully used in the current study to identify high value itemsets from static datasets. Stream databases or incremental databases update the itemsets at regular intervals (schedulers). Incremental Mining-based High Utility Itemset (IM-HUI) algorithms improve the methodologies based on High Utility Itemset (HUI) methods. The proposed technique refines the itemset values and updates the HUIs based on incremental schedulers. It reduces the time and space while mining HUIs over dynamic databases. The efficacy of the proposed work is compared experimentally to that of existing mining techniques on benchmark datasets.
Keywords:
incremental mining, utility value, high utility itemset, association mining, schedulersDownloads
References
J. A. Diaz-Garcia, M. D. Ruiz, and M. J. Martin-Bautista, "A survey on the use of association rules mining techniques in textual social media," Artificial Intelligence Review, vol. 56, no. 2, pp. 1175–1200, Feb. 2023.
M. Shawkat, M. Badawi, S. El-ghamrawy, R. Arnous, and A. El-desoky, "An optimized FP-growth algorithm for discovery of association rules," The Journal of Supercomputing, vol. 78, no. 4, pp. 5479–5506, Mar. 2022.
Y. Xu, R. Zhan, G. Tan, L. Chen, and B. Tian, "An Improved Apriori Algorithm Research in Massive Data Environment," in Cyber Security Intelligence and Analytics, Z. Xu, K.-K. R. Choo, A. Dehghantanha, R. Parizi, and M. Hammoudeh, Eds. New York, NY, USA: Springer, 2020, pp. 843–851.
W. Shen, C. Zhang, W. Fang, X. Zhang, Z.-H. Zhan, and J. C.-W. Lin, "Efficient High-utility Itemset Mining Based on a Novel Data Structure," in IEEE International Smart Cities Conference, Manchester, United Kingdom, Sep. 2021, pp. 1–6.
V. S. Tseng, B.-E. Shie, C.-W. Wu, and P. S. Yu, "Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 25, no. 8, pp. 1772–1786, Aug. 2013.
S. R. Meruva, B. Venkateswarlu, "Tree Integrated High Utility Miner for Improving an Efficiency of Association Mining", TEST Engineering & Management, vol. 83, pp. 15938-15946, May-Jun. 2020.
S. R. Meruva and V. Bondu, "Review of Association Mining Methods for the Extraction of Rules Based on the Frequency and Utility Factors," International Journal of Information Technology Project Management, vol. 12, no. 4, pp. 1–10, Oct. 2021.
Y. Liu, W. Liao, and A. Choudhary, "A fast high utility itemsets mining algorithm," in 1st International Workshop on Utility-Based Data Mining, Chicago, IL, USA, Aug. 2005, pp. 90–99.
J. Han, J. Pei, Y. Yin, and R. Mao, "Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach," Data Mining and Knowledge Discovery, vol. 8, no. 1, pp. 53–87, Jan. 2004.
A. Inokuchi, T. Washio, and H. Motoda, "An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data," in Principles of Data Mining and Knowledge Discovery, New York, NY, USA: Springer, 2000, pp. 13–23.
D. Enke and S. Thawornwong, "The use of data mining and neural networks for forecasting stock market returns," Expert Systems with Applications, vol. 29, no. 4, pp. 927–940, Nov. 2005.
M. Hamamoto and H. Kitagawa, "Ratio Rule Mining with Support and Confidence Factors," in 3rd International IEEE Conference Intelligent Systems, London, UK, Sep. 2006, pp. 500–505.
S. R. Meruva and B. Venkateswarlu, "A Fast and Effective Tree-based Mining Technique for Extraction of High Utility Itemsets," in 6th International Conference on Electronics, Communication and Aerospace Technology, Coimbatore, India, Dec. 2022, pp. 1393–1399.
M. S. Khan, M. Muyeba, and F. Coenen, "A Weighted Utility Framework for Mining Association Rules," in Second UKSIM European Symposium on Computer Modeling and Simulation, Liverpool, UK, Sep. 2008, pp. 87–92.
S.-J. Yen and Y.-S. Lee, "Mining High Utility Quantitative Association Rules," in International Conference on Big Data Analytics and Knowledge Discovery, Regensburg, Germany, Sep. 2007, pp. 283–292.
A. Erwin, R. P. Gopalan, and N. R. Achuthan, "Efficient Mining of High Utility Itemsets from Large Datasets," in Pacific-Asia Conference on Knowledge Discovery and Data Mining, Osaka, Japan, Dec. 2008, pp. 554–561.
S. Wadhwa and P. Gupta, "A review on Weighted Association Rule Mining (WARM) Using Python Programming Language," in 12th International Conference on Computing Communication and Networking Technologies, Kharagpur, India, Jul. 2021, pp. 1–6.
T. Wei, B. Wang, Y. Zhang, K. Hu, Y. Yao, and H. Liu, "FCHUIM: Efficient Frequent and Closed High-Utility Itemsets Mining," IEEE Access, vol. 8, pp. 109928–109939, Jan. 2020.
J. C.-W. Lin, M. Pirouz, Y. Djenouri, C.-F. Cheng, and U. Ahmed, "Incrementally updating the high average-utility patterns with pre-large concept," Applied Intelligence, vol. 50, no. 11, pp. 3788–3807, Nov. 2020.
W. Song, Y. Liu, and J. Li, "Mining high utility itemsets by dynamically pruning the tree structure," Applied Intelligence, vol. 40, no. 1, pp. 29–43, Jan. 2014.
M. Liu and J. Qu, "Mining high utility itemsets without candidate generation," in 21st ACM international conference on Information and knowledge management, Maui, HI, USA, Nov. 2012, pp. 55–64.
P. Fournier-Viger, J. C.-W. Lin, R. Nkambou, B. Vo, and V. S. Tseng, High-Utility Pattern Mining: Theory, Algorithms and Applications. New York, NY, USA: Springer, 2019.
P. Fournier-Viger, J. C.-W. Lin, Q.-H. Duong, and T.-L. Dam, "FHM: Faster high-utility itemset mining using length upper-bound reduction," in International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, Morioka, Japan, Aug. 2016, pp. 115–127.
P. Fournier-Viger, C.-W. Wu, S. Zida, and V. S. Tseng, "FHM: Faster High-Utility Itemset Mining Using Estimated Utility Co-occurrence Pruning," in International Symposium on Methodologies for Intelligent Systems, Roskilde, Denmark, Jun. 2014, pp. 83–92.
J. C.-W. Lin, W. Gan, T.-P. Hong, and J.-S. Pan, "Incrementally Updating High-Utility Itemsets with Transaction Insertion," in International Conference on Advanced Data Mining and Applications, Guilin, China, Dec. 2014, pp. 44–56.
W. Song and C. Huang, "Mining High Utility Itemsets Using Bio-Inspired Algorithms: A Diverse Optimal Value Framework," IEEE Access, vol. 6, pp. 19568–19582, Jan. 2018.
C. Zhang, G. Almpanidis, W. Wang, and C. Liu, "An empirical evaluation of high utility itemset mining algorithms," Expert Systems with Applications, vol. 101, pp. 91–115, Jul. 2018.
S. R. Meruva and B. Venkateswarlu, "A Novel Data Stream High Utility Itemset Miner with the Batch Transaction Processing Model," International Journal of Intelligent Systems and Applications in Engineering, vol. 12, no. 21s, pp. 3858–3865, Mar. 2024.
"Datasets," SPMF. https://www.philippe-fournier-viger.com/spmf/index.php?link=datasets.php.
Downloads
How to Cite
License
Copyright (c) 2024 Subba Reddy Meruva, Bondu Venkateswarlu
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain the copyright and grant the journal the right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) after its publication in ETASR with an acknowledgement of its initial publication in this journal.
