{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T16:20:54Z","timestamp":1761668454436,"version":"build-2065373602"},"reference-count":109,"publisher":"Frontiers Media SA","license":[{"start":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T00:00:00Z","timestamp":1761264000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["frontiersin.org"],"crossmark-restriction":true},"short-container-title":["Front. Big Data"],"abstract":"<jats:sec>\n                    <jats:title>Introduction<\/jats:title>\n                    <jats:p>The analysis of discrete sequential data, such as event logs and customer clickstreams, is often challenged by the vast number of possible sequential patterns. This complexity makes it difficult to identify meaningful sequences and derive actionable insights.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Methods<\/jats:title>\n                    <jats:p>We propose a novel feature selection algorithm, that integrates unsupervised sequential pattern mining with supervised machine learning. Unlike existing interpretable machine learning methods, we determine important sequential patterns during the mining process, eliminating the need for post-hoc classification to assess their relevance. Compared to existing interesting measures, we introduce a local, class-specific interestingness measure that is inherently interpretable.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Results<\/jats:title>\n                    <jats:p>We evaluated the algorithm on three diverse datasets - churn prediction, malware sequence analysis, and a synthetic dataset - covering different sizes, application domains, and feature complexities. Our method achieved classification performance comparable to established feature selection algorithms while maintaining interpretability and reducing computational costs.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Discussion<\/jats:title>\n                    <jats:p>This study demonstrates a practical and efficient approach for uncovering important sequential patterns in classification tasks. By combining interpretability with competitive predictive performance, our algorithm provides practitioners with an interpretable and efficient alternative to existing methods, paving the way for new advances in sequential data analysis.<\/jats:p>\n                  <\/jats:sec>","DOI":"10.3389\/fdata.2025.1604887","type":"journal-article","created":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T16:12:46Z","timestamp":1761667966000},"update-policy":"https:\/\/doi.org\/10.3389\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding the needle in the haystack\u2014An interpretable sequential pattern mining method for classification problems"],"prefix":"10.3389","volume":"8","author":[{"given":"Alexander","family":"Grote","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anuja","family":"Hariharan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christof","family":"Weinhardt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1965","published-online":{"date-parts":[[2025,10,24]]},"reference":[{"key":"B1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-981-13-1799-6_13","article-title":"\u201cA review on sequential pattern mining algorithms based on apriori and patterns growth,\u201d","author":"Abdullah","year":"2019","journal-title":"Proceedings of the International Conference on Data Engineering 2015 (DaEng-2015)"},{"key":"B2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/ICMLA.2007.106","article-title":"\u201cRare itemset mining,\u201d","volume-title":"Sixth International Conference on Machine Learning and Applications (ICMLA 2007)","author":"Adda","year":"2007"},{"key":"B3","doi-asserted-by":"publisher","first-page":"2447","DOI":"10.30574\/wjarr.2024.23.3.2936","article-title":"Explainable AI (XAI) in healthcare: enhancing trust and transparency in critical decision-making","volume":"23","author":"Adewale Abayomi","year":"2024","journal-title":"World J. Adv. Res. Rev"},{"key":"B4","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1109\/69.250074","article-title":"Database mining: a performance perspective","volume":"5","author":"Agrawal","year":"","journal-title":"IEEE Trans. Knowl. Data Eng"},{"key":"B5","doi-asserted-by":"crossref","DOI":"10.1145\/170035.170072","article-title":"\u201cMining association rules between sets of items in large databases,\u201d","volume-title":"Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data","author":"Agrawal","year":""},{"key":"B6","doi-asserted-by":"publisher","first-page":"202","DOI":"10.5296\/ije.v4i2.1962","article-title":"Categorical variables in regression analysis: a comparison of dummy and effect coding","volume":"4","author":"Alkharusi","year":"2012","journal-title":"Int. J. Educ"},{"key":"B7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1002\/widm.1144","article-title":"Subgroup discovery","volume":"5","author":"Atzmueller","year":"2015","journal-title":"WIREs Data Mining Knowl. Discov"},{"key":"B8","doi-asserted-by":"publisher","first-page":"2571","DOI":"10.1007\/s10618-024-01041-y","article-title":"Explainable and interpretable machine learning and data mining","volume":"38","author":"Atzmueller","year":"2024","journal-title":"Data Min. Knowl. Discov"},{"key":"B9","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1023\/A:1011429418057","article-title":"Detecting group differences: mining contrast sets","volume":"5","author":"Bay","year":"2001","journal-title":"Data Mining Knowl. Discov"},{"key":"B10","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1111\/j.2517-6161.1995.tb02031.x","article-title":"Controlling the false discovery rate: a practical and powerful approach to multiple testing","volume":"57","author":"Benjamini","year":"1995","journal-title":"J. Royal Statist. Soc.: Series B"},{"key":"B11","doi-asserted-by":"publisher","first-page":"1013699998","DOI":"10.1214\/aos\/1013699998","article-title":"The control of the false discovery rate in multiple testing under dependency","volume":"29","author":"Benjamini","year":"2001","journal-title":"Ann. Statist"},{"key":"B12","first-page":"2546","article-title":"\u201cAlgorithms for hyper-parameter optimization,\u201d","volume-title":"Proceedings of the 25th international Conference on Neural Information Processing Systems (Red Hook, NY, USA: Curran Associates Inc.)","author":"Bergstra","year":"2011"},{"key":"B13","doi-asserted-by":"publisher","first-page":"e2304406120","DOI":"10.1073\/pnas.2304406120","article-title":"Impossibility theorems for feature attribution","volume":"121","author":"Bilodeau","year":"2024","journal-title":"Proc. Nat. Acad. Sci"},{"key":"B14","first-page":"3","article-title":"\u201cTeoria statistica delle classi e calcolo delle probabilita,\u201d","author":"Bonferroni","year":"1936","journal-title":"Pubblicazioni del R istituto superiore di scienze economiche e commericiali di firenze"},{"key":"B15","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/978-981-16-8763-1_59","article-title":"\u201cApplications of Artificial Intelligence in Small- and Medium-Sized Enterprises (SMEs),\u201d","author":"Borah","year":"2022","journal-title":"Cognitive Informatics and Soft Computing"},{"key":"B16","doi-asserted-by":"publisher","first-page":"291","DOI":"10.2307\/1403680","article-title":"Submodel selection and evaluation in regression. The X-Random Case","volume":"60","author":"Breiman","year":"1992","journal-title":"Int. Statist. Rev"},{"key":"B17","doi-asserted-by":"publisher","first-page":"5340","DOI":"10.1109\/TAI.2024.3429306","article-title":"Toward correlated sequential rules","volume":"5","author":"Chen","year":"2024","journal-title":"IEEE Trans. Artif. Intellig"},{"key":"B18","doi-asserted-by":"crossref","DOI":"10.1145\/2939672.2939785","article-title":"\u201cXGBoost: A scalable tree boosting system,\u201d","volume-title":"Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '16","author":"Chen","year":"2016"},{"key":"B19","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1109\/ICDE.2008.4497425","article-title":"\u201cDirect discriminative pattern mining for effective classification,\u201d","volume-title":"2008 IEEE 24th International Conference on Data Engineering","author":"Cheng","year":"2008"},{"key":"B20","doi-asserted-by":"publisher","first-page":"101257","DOI":"10.1016\/j.techsoc.2020.101257","article-title":"Drivers, barriers and social considerations for AI adoption in business and management: a tertiary study","volume":"62","author":"Cubric","year":"2020","journal-title":"Technol. Soc"},{"key":"B21","doi-asserted-by":"crossref","DOI":"10.1145\/3534678.3539398","article-title":"\u201cDiscovering significant patterns under sequential false discovery control,\u201d","volume-title":"Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","author":"Dalleiger","year":"2022"},{"key":"B22","doi-asserted-by":"publisher","first-page":"18178","DOI":"10.1038\/s41598-024-69071-6","article-title":"Exploring the predictive factors of heart disease using rare association rule mining","volume":"14","author":"Darrab","year":"2024","journal-title":"Sci. Rep"},{"key":"B23","doi-asserted-by":"publisher","first-page":"61","DOI":"10.6339\/JDS.2010.08(1).563","article-title":"Contrast coding in multiple regression analysis: Strengths, weaknesses, and utility of popular coding structures","volume":"8","author":"Davis","year":"2021","journal-title":"J. Data Sci"},{"key":"B24","doi-asserted-by":"publisher","first-page":"1072292","DOI":"10.1080\/23311916.2015.1072292","article-title":"Efficient constraint-based sequential pattern mining (spm) algorithm to understand customers' buying behaviour from time stamp-based sequence dataset","volume":"2","author":"Desai","year":"2015","journal-title":"Cogent Eng"},{"key":"B25","author":"Dinh","year":"2023","journal-title":"Mining Compact High Utility Sequential Patterns"},{"key":"B26","volume-title":"Feature Engineering for Machine Learning and Data Analytics","author":"Dong","year":"2018"},{"key":"B27","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1214\/ss\/1076102425","article-title":"Regression theory for categorical time series","volume":"18","author":"Fokianos","year":"2003","journal-title":"Statist. Sci"},{"key":"B28","first-page":"54","article-title":"A survey of sequential pattern mining","volume":"1","author":"Fournier-Viger","year":"2017","journal-title":"Data Sci. Pattern Recognit"},{"key":"B29","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/978-3-642-53914-5_15","article-title":"\u201cMining maximal sequential patterns without candidate maintenance,\u201d","volume-title":"Advanced Data Mining and Applications: 9th International Conference, ADMA 2013, Hangzhou, China, December 14-16, 2013, Proceedings, Part I 9","author":"Fournier-Viger","year":"2013"},{"key":"B30","doi-asserted-by":"publisher","first-page":"3026","DOI":"10.1109\/TKDE.2014.2316504","article-title":"Highly comparative feature-based time-series classification","volume":"26","author":"Fulcher","year":"2014","journal-title":"IEEE Trans. Knowl. Data Eng"},{"key":"B31","doi-asserted-by":"crossref","DOI":"10.1002\/9781119387596","volume-title":"Markov Chains: From Theory to Implementation and Experimentation","author":"Gagniuc","year":"2017"},{"key":"B32","volume-title":"Uncertainty in Deep Learning","author":"Gal","year":"2016"},{"key":"B33","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/j.ins.2019.07.005","article-title":"Correlated utility-based pattern mining","volume":"504","author":"Gan","year":"2019","journal-title":"Inf. Sci"},{"key":"B34","doi-asserted-by":"publisher","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 Comp. Surv"},{"key":"B35","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1109\/ICDM.2008.144","article-title":"\u201cEfficient discovery of statistically significant association rules,\u201d","volume-title":"2008 Eighth IEEE International Conference on Data Mining","author":"H\u00e4m\u00e4l\u00e4inen","year":"2008"},{"key":"B36","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1145\/347090.347167","article-title":"\u201cFreeSpan: Frequent pattern-projected sequential pattern mining,\u201d","volume-title":"Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"Han","year":"2000"},{"key":"B37","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","article-title":"Mining frequent patterns without candidate generation: a frequent-pattern tree approach","volume":"8","author":"Han","year":"2004","journal-title":"Data Min. Knowl. Discov"},{"key":"B38","doi-asserted-by":"publisher","first-page":"1368","DOI":"10.4304\/jsw.8.6.1368-1373","article-title":"Closed sequential pattern mining in high dimensional sequences","volume":"8","author":"Han","year":"2013","journal-title":"J. Softw"},{"key":"B39","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1080\/01621459.1987.10478440","article-title":"Generalized additive models: some applications","volume":"82","author":"Hastie","year":"1987","journal-title":"J. Am. Stat. Assoc"},{"key":"B40","article-title":"\u201cThe elements of statistical learning: data mining, inference, and prediction,\u201d","volume-title":"Springer Series in Statistics","author":"Hastie","year":"2009"},{"key":"B41","article-title":"A simple sequentially rejective multiple test procedure","author":"Holm","year":"1979","journal-title":"Scand. J. Statist"},{"key":"B42","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s10994-021-05946-3","article-title":"Aleatoric and epistemic uncertainty in machine learning: an introduction to concepts and methods","volume":"110","author":"H\u00fcllermeier","year":"2021","journal-title":"Mach. Learn"},{"key":"B43","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1007\/s10618-019-00619-1","article-title":"Deep learning for time series classification: a review","volume":"33","author":"Ismail Fawaz","year":"2019","journal-title":"Data Min. Knowl. Discov"},{"key":"B44","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1412.6980","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014","journal-title":"arXiv"},{"key":"B45","first-page":"1137","article-title":"\u201cA study of cross-validation and bootstrap for accuracy estimation and model selection,\u201d","author":"Kohavi","year":"1995","journal-title":"Proceedings of the 14th International Joint Conference on Artificial Intelligence - Volume 2, IJCAI'95"},{"key":"B46","doi-asserted-by":"publisher","first-page":"066138","DOI":"10.1103\/PhysRevE.69.066138","article-title":"Estimating mutual information","volume":"69","author":"Kraskov","year":"2004","journal-title":"Phys. Rev. E"},{"key":"B47","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1006\/jmbi.1994.1104","article-title":"Hidden Markov models in computational biology","volume":"235","author":"Krogh","year":"1994","journal-title":"J. Mol. Biol"},{"key":"B48","doi-asserted-by":"publisher","first-page":"271","DOI":"10.3233\/FI-2010-288","article-title":"Boruta-a system for feature selection","volume":"101","author":"Kursa","year":"2010","journal-title":"Fundamenta Informaticae"},{"key":"B49","doi-asserted-by":"publisher","first-page":"193","DOI":"10.22545\/2022\/00193","article-title":"Process mining: a new approach for simplifying the process model control flow visualization","volume":"13","author":"Lamghari","year":"2022","journal-title":"Transdiscip. J. Eng. Sci"},{"key":"B50","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/B978-012213810-2\/50004-9","article-title":"\u201cGenetic algorithms in feature selection,\u201d","volume-title":"Genetic Algorithms in Molecular Modeling","author":"Leardi","year":"1996"},{"key":"B51","doi-asserted-by":"publisher","first-page":"1748","DOI":"10.1016\/j.ijforecast.2021.03.012","article-title":"Temporal fusion transformers for interpretable multi-horizon time series forecasting","volume":"37","author":"Lim","year":"2021","journal-title":"Int. J. Forecast"},{"key":"B52","doi-asserted-by":"publisher","first-page":"2950","DOI":"10.3390\/s22082950","article-title":"A hidden markov ensemble algorithm design for time series analysis","volume":"22","author":"Lin","year":"2022","journal-title":"Sensors"},{"key":"B53","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/978-3-319-18038-0_16","article-title":"\u201cReliable early classification on multivariate time series with numerical and categorical attributes,\u201d","author":"Lin","year":"2015","journal-title":"Advances in Knowledge Discovery and Data Mining"},{"key":"B54","doi-asserted-by":"crossref","first-page":"998","DOI":"10.1109\/COMPSAC54236.2022.00154","article-title":"\u201cA comparison of deep learning and traditional machine learning approaches in detecting cognitive impairment using MRI scans,\u201d","volume-title":"2022 IEEE 46th Annual Computers, Software, and Applications Conference (COMPSAC)","author":"Liu","year":"2022"},{"key":"B55","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1109\/TVCG.2016.2598797","article-title":"Patterns and sequences: interactive exploration of clickstreams to understand common visitor paths","volume":"23","author":"Liu","year":"2016","journal-title":"IEEE Trans. Vis. Comput. Graph"},{"key":"B56","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1145\/2783258.2783363","article-title":"\u201cFast and memory-efficient significant pattern mining via permutation testing,\u201d","volume-title":"Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"Llinares-L\u00f3pez","year":"2015"},{"key":"B57","first-page":"150","article-title":"\u201cIntelligible models for classification and regression,\u201d","volume-title":"Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"Lou","year":"2012"},{"key":"B58","first-page":"4768","article-title":"A unified approach to interpreting model predictions","volume":"17","author":"Lundberg","year":"2017","journal-title":"in Proceedings of the 31st International Conference on Neural Information Processing Systems (Red Hook, NY, USA: Curran Associates Inc.)"},{"key":"B59","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1214\/aoms\/1177730491","article-title":"On a test of whether one of two random variables is stochastically larger than the other","volume":"18","author":"Mann","year":"1947","journal-title":"Ann. Mathem. Statist"},{"key":"B60","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/TIT.1963.1057810","article-title":"On the effectiveness of receptors in recognition systems","volume":"9","author":"Marill","year":"1963","journal-title":"IEEE Trans. Inform. Theory"},{"key":"B61","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1049\/iet-syb.2011.0011","article-title":"Building blocks of biological networks: a review on major network motif discovery algorithms","volume":"6","author":"Masoudi-Nejad","year":"2012","journal-title":"IET Syst. Biol"},{"key":"B62","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.csda.2014.09.016","article-title":"Model-based biclustering of clickstream data","volume":"93","author":"Melnykov","year":"2016","journal-title":"Comp. Statist. Data Analy"},{"key":"B63","first-page":"67","article-title":"\u201cPattern mining algorithms,\u201d","author":"Millham","year":"2021","journal-title":"Bio-Inspired Algorithms for Data Streaming and Visualization, Big Data Management, and Fog Computing"},{"key":"B64","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1007\/978-3-662-44851-9_27","article-title":"\u201cA fast method of statistical assessment for combinatorial hypotheses based on frequent itemset enumeration,\u201d","author":"Minato","year":"2014","journal-title":"Machine Learning and Knowledge Discovery in Databases"},{"key":"B65","volume-title":"Interpretable Machine Learning: A Guide for Making Black Box Models Explainable, 3rd Edn.","author":"Molnar","year":"2025"},{"key":"B66","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1145\/335168.335226","article-title":"\u201cTransversing itemset lattices with statistical metric pruning,\u201d","volume-title":"Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Pods '00","author":"Morishita","year":"2000"},{"key":"B67","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1145\/3600211.3604657","article-title":"\u201cFairness implications of encoding protected categorical attributes,\u201d","volume-title":"Proceedings of the 2023 AAAI\/ACM Conference on AI, Ethics, and Society","author":"Mougan","year":"2023"},{"key":"B68","first-page":"161","author":"Mukhopadhyay","year":"2023","journal-title":"Time Series"},{"key":"B69","doi-asserted-by":"publisher","first-page":"104438","DOI":"10.1016\/j.jbi.2023.104438","article-title":"WindowSHAP: an efficient framework for explaining time-series classifiers based on Shapley values","volume":"144","author":"Nayebi","year":"2023","journal-title":"J. Biomed. Inform"},{"key":"B70","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/1015330.1015435","article-title":"\u201cFeature selection, L1 vs. L2 regularization, and rotational invariance,\u201d","volume-title":"Proceedings of the Twenty-First International Conference on Machine Learning, ICML '04","author":"Ng","year":"2004"},{"key":"B71","doi-asserted-by":"publisher","DOI":"10.21227\/TQQM-AQ14","author":"Oliveira","year":"2019","journal-title":"Malware Analysis Datasets: API Call Sequences."},{"key":"B72","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.6546","article-title":"Pattern2Vec: Representation of clickstream data sequences for learning user navigational behavior","author":"Olmezogullari","year":"2022","journal-title":"Concurr. Comp.: Pract. Exp"},{"key":"B73","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1109\/ICDE.2001.914830","article-title":"\u201cPrefixSpan: mining sequential patterns efficiently by prefix-projected pattern growth,\u201d","author":"Pei","year":"2001","journal-title":"PProceedings 17th International Conference on Data Engineering"},{"key":"B74","doi-asserted-by":"crossref","first-page":"3215","DOI":"10.1145\/3292500.3332286","article-title":"\u201cHypothesis testing and statistically-sound pattern mining,\u201d","author":"Pellegrina","year":"2019","journal-title":"Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"},{"key":"B75","first-page":"2668","article-title":"\u201cEfficient discovery of significant patterns with few-shot resampling,\u201d","volume-title":"Proceedings of the VLDB Endowment","author":"Pellegrina","year":"2024"},{"key":"B76","doi-asserted-by":"publisher","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":"B77","first-page":"229","article-title":"\u201cDiscovery, analysis, and presentation of strong rules,\u201d","volume-title":"Knowledge Discovery in Data-Bases","author":"Piatetsky-Shapiro","year":"1991"},{"key":"B78","first-page":"144","article-title":"\u201cA review based on machine learning for feature selection and feature extraction,\u201d","author":"Preyanka Lakshme","year":"2022","journal-title":"Advancements in Smart Computing and Information Security"},{"key":"B79","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.4640316","article-title":"Explainable artificial intelligence (XAI) approaches for transparency and accountability in financial decision-making","author":"Rane","year":"2023","journal-title":"SSRN Electron. J"},{"key":"B80","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2303.12316","article-title":"TsSHAP: Robust model agnostic feature-based explainability for time series forecasting","author":"Raykar","year":"2023","journal-title":"arXiv preprint"},{"key":"B81","doi-asserted-by":"publisher","first-page":"2045","DOI":"10.1038\/s41598-020-73622-y","article-title":"Shopper intent prediction from clickstream e-commerce data with minimal browsing information","volume":"10","author":"Requena","year":"2020","journal-title":"Sci. Rep"},{"key":"B82","first-page":"97","article-title":"\u201c\u201cWhy should I trust you?\u201d: Explaining the predictions of any classifier,\u201d","author":"Ribeiro","year":"2016","journal-title":"Proceedings of the 2016 Conference of the North American chapter of the association for computational linguistics: Demonstrations"},{"key":"B83","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1038\/s42256-019-0048-x","article-title":"Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead","volume":"1","author":"Rudin","year":"2019","journal-title":"Nat. Mach. Intellig"},{"key":"B84","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/s42452-021-04148-9","article-title":"Comparison of feature importance measures as explanations for classification models","volume":"3","author":"Saarela","year":"2021","journal-title":"SN Appl. Sci"},{"key":"B85","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/3-540-45681-3_34","article-title":"\u201cAnswering the most correlated n association rules efficiently,\u201d","author":"Sese","year":"2002","journal-title":"Principles of Data Mining and Knowledge Discovery"},{"key":"B86","first-page":"1","article-title":"\u201cMining sequential patterns: generalizations and performance improvements,\u201d","author":"Srikant","year":"1996"},{"key":"B87","first-page":"1929","article-title":"Dropout: a simple way to prevent neural networks from overfitting","volume":"15","author":"Srivastava","year":"2014","journal-title":"J. Mach. Learn. Res"},{"key":"B88","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.elerap.2014.10.002","article-title":"A method for discovering clusters of e-commerce interest patterns using click-stream data","volume":"14","author":"Su","year":"2015","journal-title":"Electron. Commer. Res. Appl"},{"key":"B89","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1080\/01621459.1957.10501412","article-title":"Use of dummy variables in regression equations","volume":"52","author":"Suits","year":"1957","journal-title":"J. Am. Stat. Assoc"},{"key":"B90","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0306-4379(03)00072-3","article-title":"Selecting the right objective measure for association analysis","volume":"29","author":"Tan","year":"2004","journal-title":"Inf. Syst"},{"key":"B91","doi-asserted-by":"publisher","first-page":"12996","DOI":"10.1073\/pnas.1302233110","article-title":"Statistical significance of combinatorial regulations","volume":"110","author":"Terada","year":"","journal-title":"Proc. Nat. Acad. Sci"},{"key":"B92","first-page":"153","article-title":"\u201cFast Westfall-Young permutation procedure for combinatorial regulation discovery,\u201d","volume-title":"2013 IEEE International Conference on Bioinformatics and Biomedicine","author":"Terada","year":""},{"key":"B93","doi-asserted-by":"crossref","first-page":"1330","DOI":"10.1109\/ICDM.2019.00169","article-title":"\u201cPermutation strategies for mining significant sequential patterns,\u201d","volume-title":"2019 IEEE International Conference on Data Mining (ICDM)","author":"Tonon","year":"2019"},{"key":"B94","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/978-3-030-04921-8_4","article-title":"\u201cA survey of high utility sequential pattern mining,\u201d","author":"Truong-Chi","year":"2019","journal-title":"High-Utility Pattern Mining"},{"key":"B95","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-49851-4","volume-title":"Process Mining","author":"Van Der Aalst","year":"2016"},{"key":"B96","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1109\/ICBDA51983.2021.9403177","article-title":"\u201cTime series classification via enhanced temporal representation learning,\u201d","volume-title":"2021 IEEE 6th International Conference on Big Data Analytics (ICBDA)","author":"Wang","year":"2021"},{"key":"B97","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1145\/1150402.1150451","article-title":"\u201cDiscovering significant rules,\u201d","volume-title":"Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"Webb","year":"2006"},{"key":"B98","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10182-008-0055-4","article-title":"Measuring serial dependence in categorical time series","volume":"92","author":"Wei\u00df","year":"2008","journal-title":"AStA Adv. Statist. Anal"},{"key":"B99","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1109\/T-C.1971.223410","article-title":"A direct method of nonparametric measurement selection","volume":"100","author":"Whitney","year":"1971","journal-title":"IEEE Trans. Comp"},{"key":"B100","doi-asserted-by":"publisher","first-page":"80","DOI":"10.2307\/3001968","article-title":"Individual comparisons by ranking methods","volume":"1","author":"Wilcoxon","year":"1945","journal-title":"Biomet. Bullet"},{"key":"B101","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1145\/3444370.3444605","article-title":"\u201cFrom one-hot encoding to privacy-preserving synthetic electronic health records embedding,\u201d","volume-title":"Proceedings of the 2020 International Conference on Cyberspace Innovation of Advanced Technologies","author":"Xiang","year":"2020"},{"key":"B102","doi-asserted-by":"publisher","first-page":"2642","DOI":"10.1093\/bioinformatics\/bty178","article-title":"Learned protein embeddings for machine learning","volume":"34","author":"Yang","year":"2018","journal-title":"Bioinformatics"},{"key":"B103","doi-asserted-by":"crossref","first-page":"947","DOI":"10.1145\/1557019.1557122","article-title":"\u201cTime series shapelets: a new primitive for data mining,\u201d","volume-title":"Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"Ye","year":"2009"},{"key":"B104","first-page":"660","article-title":"\u201cUSpan: an efficient algorithm for mining high utility sequential patterns,\u201d","volume-title":"Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"Yin","year":"2012"},{"key":"B105","article-title":"GNNExplainer: Generating explanations for graph neural networks","author":"Ying","year":"2019","journal-title":"Advances in Neural Information Processing Systems 32"},{"key":"B106","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1007652502315","article-title":"SPADE: an efficient algorithm for mining frequent sequences","volume":"42","author":"Zaki","year":"2001","journal-title":"Mach. Learn"},{"key":"B107","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1109\/DSAA.2019.00059","article-title":"\u201cMaximum relevance and minimum redundancy feature selection methods for a marketing machine learning platform,\u201d","volume-title":"2019 IEEE International Conference on Data Science and Advanced Analytics (DSAA)","author":"Zhao","year":"2019"},{"key":"B108","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1007\/s10270-023-01134-0","article-title":"What makes life for process mining analysts difficult? A reflection of challenges","volume":"23","author":"Zimmermann","year":"2024","journal-title":"Softw. Syst. Model"},{"key":"B109","doi-asserted-by":"publisher","first-page":"8329","DOI":"10.3390\/app13148329","article-title":"Agile machine learning model development using data canyons in medicine: a step towards explainable artificial intelligence and flexible expert-based model improvement","volume":"13","author":"\u017dlahti\u010d","year":"2023","journal-title":"Appl. Sci"}],"container-title":["Frontiers in Big Data"],"original-title":[],"link":[{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fdata.2025.1604887\/full","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T16:12:57Z","timestamp":1761667977000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fdata.2025.1604887\/full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,24]]},"references-count":109,"alternative-id":["10.3389\/fdata.2025.1604887"],"URL":"https:\/\/doi.org\/10.3389\/fdata.2025.1604887","relation":{},"ISSN":["2624-909X"],"issn-type":[{"value":"2624-909X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,24]]},"article-number":"1604887"}}