{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T15:00:00Z","timestamp":1773673200105,"version":"3.50.1"},"reference-count":43,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T00:00:00Z","timestamp":1748217600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>The mining of relevant association rules from transactional databases is a fundamental process in data mining. Traditional algorithms, however, will typically be based on fixed thresholds and general rule generation, with the result being large and redundant outcomes. This paper presents DERAR (Dynamic Extracting of Relevant Association Rules), a dynamic approach integrating structure pattern mining and dynamic multi-criteria filtering. The process begins with the generation of frequent meta-patterns. Each entity is given a stability score for its consistency across various data projections, then sorted by mutual information in order to preserve the most informative dimensions. The resulting association rules from these models are filtered through a dynamic confidence threshold that is adjusted according to the statistical distribution of the dataset. A final semantic filtering phase identifies rules with high coherence between antecedent and consequent. Experimental results show that DERAR reduces rules by up to 85%, improving interpretability and coherence. It outperforms Apriori, FP-Growth, and H-Apriori in rule quality and computational efficiency. DERAR consistently achieves lower execution times and memory use, especially on large or sparse datasets. These results confirm the benefits of adaptive, semantically guided rule mining for generating concise, high-quality, and actionable knowledge.<\/jats:p>","DOI":"10.3390\/info16060438","type":"journal-article","created":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T11:12:57Z","timestamp":1748344377000},"page":"438","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic Algorithm for Mining Relevant Association Rules via Meta-Patterns and Refinement-Based Measures"],"prefix":"10.3390","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8865-7618","authenticated-orcid":false,"given":"Houda","family":"Essalmi","sequence":"first","affiliation":[{"name":"Laboratory of Engineering Sciences, Polydisciplinary Faculty of Taza, University of Sidi Mohamed Ben Abdellah, Fez 30000, Morocco"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9545-0373","authenticated-orcid":false,"given":"Anass","family":"El Affar","sequence":"additional","affiliation":[{"name":"Laboratory of Engineering Sciences, Polydisciplinary Faculty of Taza, University of Sidi Mohamed Ben Abdellah, Fez 30000, Morocco"}]}],"member":"1968","published-online":{"date-parts":[[2025,5,26]]},"reference":[{"key":"ref_1","first-page":"57","article-title":"Knowledge discovery in databases: An overview","volume":"13","author":"Frawley","year":"1992","journal-title":"AI Mag."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imieli\u0144ski, T., and Swami, A. (1993, January 25\u201328). Mining association rules between sets of items in large databases. Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, DC, USA.","DOI":"10.1145\/170035.170072"},{"key":"ref_3","unstructured":"Agrawal, R., and Srikant, R. (1994, January 12\u201315). Fast algorithms for mining association rules in large databases. Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), Santiago de Chile, Chile."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., and Yin, Y. (2000, January 16\u201318). Mining frequent patterns without candidate generation. Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, Dallas, TX, USA.","DOI":"10.1145\/342009.335372"},{"key":"ref_5","unstructured":"Zaki, M.J. (1997). Fast Mining of Sequential Patterns in Very Large Databases, University of Rochester, Department of Computer Science."},{"key":"ref_6","unstructured":"Dai, H., Srikant, R., and Zhang, C. (2005). A two-phase algorithm for fast discovery of high utility itemsets. Advances in Knowledge Discovery and Data Mining, Springer."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1708","DOI":"10.1109\/TKDE.2009.46","article-title":"Efficient tree structures for high utility pattern mining in incremental databases","volume":"21","author":"Ahmed","year":"2009","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_8","first-page":"5395","article-title":"Developing a Novel H-Apriori Algorithm Using Support-Leverage Matrix for Association Rule Mining","volume":"16","author":"Pamnani","year":"2024","journal-title":"Int. J. Inf. Technol."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0306-4379(03)00072-3","article-title":"Selecting the right interestingness measure for association patterns","volume":"29","author":"Tan","year":"2004","journal-title":"Inf. Syst."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Ullman, J.D., and Tsur, S. (1997, January 13\u201315). Dynamic itemset counting and implication rules for market basket data. Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data, Tucson, AZ, USA.","DOI":"10.1145\/253260.253325"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/1132960.1132963","article-title":"Interestingness measures for data mining: A survey","volume":"38","author":"Geng","year":"2006","journal-title":"ACM Comput. Surv."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"970","DOI":"10.1109\/69.553165","article-title":"What makes patterns interesting in knowledge discovery systems?","volume":"8","author":"Silberschatz","year":"1996","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48751-4_17","article-title":"Rule evaluation measures: A unifying view","volume":"Volume 1634","author":"Flach","year":"1999","journal-title":"Proceedings of the 9th International Workshop on Inductive Logic Programming (ILP 1999)"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Hilderman, R.J., and Hamilton, H.J. (2001). Knowledge Discovery and Interestingness Measures: A Survey, University of Regina.","DOI":"10.1007\/978-1-4757-3283-2"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1016\/j.ejor.2006.10.059","article-title":"On selecting interestingness measures for association rules: User oriented description and multiple criteria decision aid","volume":"184","author":"Lenca","year":"2008","journal-title":"Eur. J. Oper. Res."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"100434","DOI":"10.1016\/j.dajour.2024.100434","article-title":"Mine-first association rule mining: An integration of independent frequent patterns in distributed environments","volume":"10","author":"Mudumba","year":"2024","journal-title":"Decis. Anal. J."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1007\/s12599-023-00844-5","article-title":"A survey on association rule mining for enterprise architecture model discovery: State of the art","volume":"66","author":"Pinheiro","year":"2024","journal-title":"Bus. Inf. Syst. Eng."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1007\/s10669-022-09857-z","article-title":"A novel Measure to evaluate the association rules for identification of functional dependencies in complex technical infrastructures","volume":"42","author":"Antonello","year":"2022","journal-title":"Environ. Syst. Decis."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/978-3-031-43490-7_13","article-title":"Measures-based exploration and assessment of classification and association rule mining techniques: A comprehensive study","volume":"Volume 503","author":"Alhindawi","year":"2024","journal-title":"Studies in Systems, Decision and Control"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"5168","DOI":"10.1109\/TKDE.2023.3335049","article-title":"GAN-Based Temporal Association Rule Mining on Multivariate Time Series Data","volume":"36","author":"He","year":"2024","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_21","first-page":"52","article-title":"Association Rules Mining with Auto-Encoders","volume":"Volume 15346","author":"Pan","year":"2025","journal-title":"IDEAL 2024"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Li, T., Liu, F., Chen, X., Zhang, Y., Xu, J., and Huang, W. (2024). Web Log Mining Techniques to Optimize Apriori Association Rule Algorithm in Sports Data Information Management. Sci. Rep., 14.","DOI":"10.1038\/s41598-024-74427-z"},{"key":"ref_23","first-page":"16","article-title":"Discovering the Symptom Patterns of COVID-19 from Recovered and Deceased Patients Using Apriori Association Rule Mining","volume":"42","author":"Dehghani","year":"2023","journal-title":"Inf. Med. Unlocked."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.1016\/j.procir.2024.08.400","article-title":"Association Rule Mining for Dynamic Error Classification in the Automotive Manufacturing Industry","volume":"126","author":"Schoch","year":"2024","journal-title":"Procedia CIRP"},{"key":"ref_25","first-page":"458","article-title":"Analysis and Research on Library User Behavior Based on Apriori Algorithm","volume":"27","author":"Zhang","year":"2023","journal-title":"Meas. Sens."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"16853","DOI":"10.1007\/s12652-023-04694-7","article-title":"Time Series Numerical Association Rule Mining Variants in Smart Agriculture","volume":"14","author":"Fister","year":"2023","journal-title":"J. Ambient Intell. Humaniz. Comput."},{"key":"ref_27","first-page":"107520","article-title":"Discovery of Approximate Functional Dependencies Using Evolutionary Algorithms","volume":"233","author":"Liu","year":"2021","journal-title":"Knowl.-Based Syst."},{"key":"ref_28","first-page":"439","article-title":"Discovering Relaxed Functional Dependencies with Genetic Algorithms","volume":"42","author":"Song","year":"2014","journal-title":"J. Intell. Inf. Syst."},{"key":"ref_29","first-page":"367","article-title":"Mining Relaxed Functional Dependencies with Metaheuristic Optimization","volume":"540","author":"Li","year":"2020","journal-title":"Inf. Sci."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., and Lakhal, L. (1999, January 10\u201312). Discovering frequent closed itemsets for association rules. Proceedings of the 7th International Conference on Database Theory (ICDT), Jerusalem, Israel.","DOI":"10.1007\/3-540-49257-7_25"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1109\/69.846291","article-title":"Scalable algorithms for association mining","volume":"12","author":"Zaki","year":"2000","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Garc\u00eda, S., Luengo, J., and Herrera, F. (2015). Data Preprocessing in Data Mining, Springer International Publishing.","DOI":"10.1007\/978-3-319-10247-4"},{"key":"ref_33","unstructured":"Cover, T.M., and Thomas, J.A. (2006). Elements of Information Theory, Wiley-Interscience. [2nd ed.]."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"1226","DOI":"10.1109\/TPAMI.2005.159","article-title":"Feature selection based on mutual information: Criteria of max-dependency, max-relevance, and min-redundancy","volume":"27","author":"Peng","year":"2005","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_35","unstructured":"Casella, G., and Berger, R.L. (2002). Statistical Inference, Duxbury Press. [2nd ed.]."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Hastie, T., Tibshirani, R., and Friedman, J. (2009). The Elements of Statistical Learning, Springer. [2nd ed.].","DOI":"10.1007\/978-0-387-84858-7"},{"key":"ref_37","unstructured":"Wackerly, D.D., Mendenhall, W., and Scheaffer, R.L. (2014). Mathematical Statistics with Applications, Cengage Learning. [7th ed.]."},{"key":"ref_38","unstructured":"Freund, J.E., and Perles, B.M. (2007). Statistics: A First Course, Pearson. [8th ed.]."},{"key":"ref_39","unstructured":"Han, J., Pei, J., and Kamber, M. (2011). Data Mining: Concepts and Techniques, Morgan Kaufmann. [3rd ed.]."},{"key":"ref_40","unstructured":"(2017). UCI Machine Learning Repository, University of California, Irvine, School of Information and Computer Sciences. Available online: https:\/\/archive.ics.uci.edu\/."},{"key":"ref_41","unstructured":"(2016). SPMF: A Java open-source pattern mining library. J. Mach. Learn. Res., 15, 3569\u20133573."},{"key":"ref_42","unstructured":"Aggarwal, C.C., and Yu, P.S. (2001, January 21\u201323). A new framework for itemset generation. Proceedings of the 20th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2001), Santa Barbara, CA, USA."},{"key":"ref_43","unstructured":"Liu, B., Hsu, W., and Ma, Y. (1998, January 27\u201331). Integrating classification and association rule mining. Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD \u203298), New York, NY, USA."}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/16\/6\/438\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:40:35Z","timestamp":1760031635000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/16\/6\/438"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,26]]},"references-count":43,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2025,6]]}},"alternative-id":["info16060438"],"URL":"https:\/\/doi.org\/10.3390\/info16060438","relation":{},"ISSN":["2078-2489"],"issn-type":[{"value":"2078-2489","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,26]]}}}