Adaptive Minimum Support Threshold for Association Rule Mining
DOI:
https://doi.org/10.56705/ijodas.v5i2.134Keywords:
Adaptive Support Threshold, Item Sets, Transactions, Item SupportAbstract
In association rule mining (ARM), valuable rules are extracted from frequent itemsets, selecting appropriate minimum support thresholds is essential yet challenging. Arbitrary threshold selection often results in either an overwhelming number of uninteresting rules or the omission of relevant rules. To address this issue, this study introduces an Adaptive Minimum Support (SAd) algorithm designed to dynamically adjust the support threshold based on dataset characteristics, thereby facilitating the discovery of optimal association rules. The SAd algorithm was experimented on three real-world datasets, yielding optimal minimum support thresholds of 0.065, 0.133, and 0.057 respectively. Results demonstrate the algorithm's effectiveness in adapting the support threshold to each dataset's characteristics. By optimizing the threshold, the SAd algorithm enhances the quality of discovered association rules, offering more actionable insights for decision-making.
Downloads
References
R. Agarwal, & M. Mittal, “Inventory classification using multi-level association rule mining”. Int. J. of Dec. Supt. Syst. Tech., vol. 11, no. 2, pp1-12. 2019. DOI: 10.4018/IJDSST.2019040101
C.S.K Selvi, & A. Tamilarasi, “Association Rule Mining with Dynamic Adaptive Support Thresholds for Associative Classification”, International Conference on Computational Intelligence and Multimedia Applications (ICCIMA 2007). 2007 doi:10.1109 /iccima.2007.233
Q.H. Duong, B. Liao, P. Fournier-Viger & T.L. Dam, “An efficient algorithm for mining the top-k high utility itemsets, using novel threshold raising and pruning strategies”. Knowledge-Based Sys, vol. 104, pp. 106-122, 2016. https://doi.org/10.1016/j.knosys.2016.04.016
A. Dahbi, S. Jabri, Y. Balouki & T. Gadi, “Finding Suitable Threshold for Support in Apriori Algorithm Using Statistical Measures”. In Enabl. Mach. Learng. Appl. in Data Sci: Proceedings of Arab Conference for Emerging Technologies pp. 89-101, 2021 Singapore: Springer Singapore. https://doi.org/10.1007/978-981-33-6129-4_7
Z. Kohzadi, A.M. Nickfarjam, L.S. Arani, Z. Kohzadi & M. Mahdian, “Extraction frequent patterns in trauma dataset based on automatic generation of minimum support and feature weighting”, BMC med. Res. Meth., vol. 24 no. 1, pp.40, 2024. https://doi.org/10.1186/s12874-024-02154-0
E. Hikmawati, N.U. Maulidevi & K. Surendro, “Pruning Strategy on Adaptive Rule Model by Sorting Utility Items”. IEEE Access, vol. 10, pp. 91650-91662, 2022. DOI: 10.1109/ACCESS.2022.3202307
A. Dahbi, Y. Balouki, & T. Gadi, “Using multiple minimum support to auto-adjust the threshold of support in apriori algorithm” International Conference on Soft Computing and Pattern Recognition, pp. 111-119. 2018. Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-76357-6_11
B. Huynh, C. Trinh, V. Dang & B. Vo, “A parallel method for mining frequent patterns with multiple minimum support thresholds”. Int. J. of Innov. Comp., Info. and Cont., vol. 15, no. 2, pp. 479-488, 2019. DOI: 10.24507/ijicic.15.02.479
E. Hikmawati, N.U. Maulidevi, & K. Surendro, “Minimum Threshold Determination Method Based on Dataset Characteristics in Association Rule Mining”. J. of Big Data, vol. 8, pp. 1-17, 2021. https://doi.org/10.1186/s40537-021-00538-3
F. Liu, & G. Wu, “An improved Apriori algorithm based on compressed matrix”. J. of Shan. Univ. (Eng. Edition), vol. 48, no. 6, pp. 82-88, 2018. DOI:10.1109/ISCID.2018.34
A. Wu, & A. Liu, “Improvement of apriori algorithm based on Boolean matrix reduction”. Comp. Eng. and sci., vol. 9., 2019. https://doi.org/10.1155/2022/3900094
S. Rana, & M.N.I. Mondal, “A Seasonal and Multilevel Association Based Approach for Market Basket Analysis in Retail Supermarket”, Euro. J. of Info. Tech. and Comp. Sci., vol. 1, no. 4, pp. 9-15, 2021. DOI:10.24018/compute.2021.1.4.31
R.T. Agrawal, Imieli_nski, & A. Swami, “Mining Association Rules Between Sets of Items in Large Databases”. ACM SIGMOD Record vol. 22, no. 2, pp.207, 1993. https://doi.org/10.1145/ 170036.1 70072.
S. Darrab & B. Ergenç, “Vertical pattern mining for multiple support thresholds”. Proc. Comp. Sci., vol. 112, pp. 417- 426, 2017. DOI:10.1016/j.procs.2017.08.051
E. Hikmawati, & K. Surendro, “How to determine minimum support in association rule”, In Proc. of the 2020 9th International Conference on Software and Computer Applications. Langkawi Malaysia: ACM, pp. 6-10, 2020. https://doi.Org/10.1145/3384544.3 384563
K.S. Sadhasivam, & T. Angamuthu, “Mining rare itemset with automated support thresholds”. J. of Comp. Sci., vol. 7, no. 3, pp. 394, 2011. DOI:10.3844/jcssp.2011.394.399
A. Salam, & M.S.H Khayal, “Mining top−k frequent patterns without minimum support threshold”. Knowl. and Info. Sys., vol. 30, no. 1, pp. 57–86. 2011. doi:10.1007/s10115-010-0363-3
C.K. Selvi, & A. Tamilarasi, “An automated association rule mining technique with cumulative support thresholds”. Int. J. Open Probl. in Compt. Math, vol 2, no 3, pp. 12, 2009.
Downloads
Published
Issue
Section
License
Authors retain copyright and full publishing rights to their articles. Upon acceptance, authors grant Indonesian Journal of Data and Science a non-exclusive license to publish the work and to identify itself as the original publisher.
Self-archiving. Authors may deposit the submitted version, accepted manuscript, and version of record in institutional or subject repositories, with citation to the published article and a link to the version of record on the journal website.
Commercial permissions. Uses intended for commercial advantage or monetary compensation are not permitted under CC BY-NC 4.0. For permissions, contact the editorial office at ijodas.journal@gmail.com.
Legacy notice. Some earlier PDFs may display “Copyright © [Journal Name]” or only a CC BY-NC logo without the full license text. To ensure clarity, the authors maintain copyright, and all articles are distributed under CC BY-NC 4.0. Where any discrepancy exists, this policy and the article landing-page license statement prevail.
