{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T08:10:09Z","timestamp":1751616609946,"version":"3.41.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T00:00:00Z","timestamp":1751587200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T00:00:00Z","timestamp":1751587200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discov Computing"],"DOI":"10.1007\/s10791-025-09644-9","type":"journal-article","created":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T07:44:05Z","timestamp":1751615045000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An association rule-based approach for frequent item mining of multi-stage access data"],"prefix":"10.1007","volume":"28","author":[{"given":"Silong","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,4]]},"reference":[{"key":"9644_CR1","doi-asserted-by":"crossref","unstructured":"Lazzari F, Baldini W, Bassi G, Contu A, Dorigo M, Fantechi R., et al. Fpga-based real-time data processing for accelerating reconstruction at lhcb. J Instrum. 2022; 17(4): C04011.1\u2013C04011.8.","DOI":"10.1088\/1748-0221\/17\/04\/C04011"},{"issue":"3","key":"9644_CR2","doi-asserted-by":"publisher","first-page":"1480","DOI":"10.1109\/TIT.2021.3130189","volume":"68","author":"O Ordentlich","year":"2022","unstructured":"Ordentlich O, Polyanskiy Y. Strong data processing constant is achieved by binary inputs. IEEE Trans Inform Theory. 2022;68(3):1480\u20131.","journal-title":"IEEE Trans Inform Theory"},{"issue":"1","key":"9644_CR3","first-page":"2","volume":"17","author":"S Khan","year":"2023","unstructured":"Khan S, Shaheen M. Wisdom mining: future of data mining. Rec Pat Eng. 2023;17(1):2\u201311.","journal-title":"Rec Pat Eng"},{"key":"9644_CR4","doi-asserted-by":"crossref","unstructured":"Darmont J, Novikov B, Wrembel R, Bellatreche L. Data processing in modern distributed architectures. Inform Syst. 2022;104(Feb): 101936.1\u2013101936.3.","DOI":"10.1016\/j.is.2021.101936"},{"key":"9644_CR5","first-page":"544","volume":"124","author":"A Yamamoto","year":"2021","unstructured":"Yamamoto A, Tada K, Chibat G, Endo T. Verification of the multi-group generation capability of frendy nuclear data processing code for recent nuclear data through comparison of one-group reaction rates. Trans Am Nucl Soc. 2021;124:544\u20137.","journal-title":"Trans Am Nucl Soc."},{"key":"9644_CR6","doi-asserted-by":"crossref","unstructured":"Balynsky M, Chiang H, Gutierrez D, Kozhevnikov A, Filimonov Y, Khitun A. Quantum computing without quantum computers: database search and data processing using classical wave superposition. J Appl Phys. 2021;130(16): 164903.1\u2013164903.12.","DOI":"10.1063\/5.0068316"},{"issue":"2","key":"9644_CR7","doi-asserted-by":"publisher","first-page":"1304","DOI":"10.1093\/gji\/ggab023","volume":"225","author":"S Kawtar","year":"2021","unstructured":"Kawtar S, Damien J, Roger G, Barth\u00e9l\u00e9my Steck, Jean-Marie H, Louis A, et al. A data mining approach for improved interpretation of ert inverted sections using the dbscan clustering algorithm. Geophys J Intern. 2021;225(2):1304\u201318.","journal-title":"Geophys J Intern"},{"issue":"2","key":"9644_CR8","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1093\/comjnl\/bxab164","volume":"66","author":"S Datta","year":"2023","unstructured":"Datta S, Mali K, Ghosh U, Bose S, Ghosh S. Rare correlated coherent association rule mining with CLS-MMS. Comput J. 2023;66(2):342\u201359.","journal-title":"Comput J"},{"issue":"4","key":"9644_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.ins.2021.07.019","volume":"577","author":"J Sanz","year":"2021","unstructured":"Sanz J, Sesma-Sara M, Bustince H. A fuzzy association rule-based classifier for imbalanced classification problems. Inform Sci. 2021;577(4):265\u201379.","journal-title":"Inform Sci"},{"issue":"1","key":"9644_CR10","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1287\/isre.2021.1033","volume":"33","author":"S Menon","year":"2022","unstructured":"Menon S, Ghoshal A, Sarkar S. Modifying transactional databases to hide sensitive association rules. Inform Syst Res. 2022;33(1):152\u201378.","journal-title":"Inform Syst Res"},{"issue":"7","key":"9644_CR11","doi-asserted-by":"publisher","first-page":"7877","DOI":"10.1007\/s11227-022-04976-5","volume":"79","author":"M Magdy","year":"2023","unstructured":"Magdy M, Ghaleb FFM, Mohamed DAEA, Zakaria W. Cc-ifim: an efficient approach for incremental frequent itemset mining based on closed candidates. J Supercomput. 2023;79(7):7877\u201399.","journal-title":"J Supercomput"},{"issue":"5","key":"9644_CR12","first-page":"282","volume":"38","author":"PP Wang","year":"2021","unstructured":"Wang PP, Meng Y. Simulation of mining frequent pattern association rules of multi-segment support data. Comput Simul. 2021;38(5):282\u20136.","journal-title":"Comput Simul"},{"issue":"5","key":"9644_CR13","doi-asserted-by":"publisher","first-page":"1596","DOI":"10.1111\/coin.12490","volume":"38","author":"K Logeswaran","year":"2021","unstructured":"Logeswaran K, Suresh P. High utility itemset mining using genetic algorithm assimilated with off policy reinforcement learning to adaptively calibrate crossover operation. Comput Intell. 2021;38(5):1596\u2013615.","journal-title":"Comput Intell"},{"key":"9644_CR14","doi-asserted-by":"crossref","unstructured":"Aryabarzan N, Minaei-Bidgoli B. Neclatclosed: a vertical algorithm for mining frequent closed itemsets. Exp Syst Appl. 2021;174(Jul.): 114738.1\u2013114738.11.","DOI":"10.1016\/j.eswa.2021.114738"},{"issue":"6","key":"9644_CR15","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1329","volume":"9","author":"JM Luna","year":"2019","unstructured":"Luna JM, Fournier-Viger P, Ventura S. Frequent itemset mining: a 25 years review. Wiley Interdiscip Rev Data Min Knowl Discov. 2019;9(6): e1329.","journal-title":"Wiley Interdiscip Rev Data Min Knowl Discov"},{"key":"9644_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2024.120981","volume":"678","author":"AM Trasierras","year":"2024","unstructured":"Trasierras AM, Luna JM, Fournier-Viger P, Ventura S. Data heterogeneity\u2019s impact on the performance of frequent itemset mining algorithms. Inform Sci. 2024;678: 120981.","journal-title":"Inform Sci"},{"issue":"5","key":"9644_CR17","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.ins.2021.01.060","volume":"568","author":"T Truong","year":"2021","unstructured":"Truong T, Duong H, Le B, Fournier-Viger P, Fujita H. Efficient algorithms for mining frequent high utility sequences with constraints. Inform Sci. 2021;568(5):239\u201364.","journal-title":"Inform Sci"},{"key":"9644_CR18","doi-asserted-by":"crossref","unstructured":"Nguyen H, Le T, Nguyen M, Fournier-Viger P, Tseng VS, Vo B. Mining frequent weighted utility itemsets in hierarchical quantitative databases. Knowl Based Syst. 2022; 237(Feb.15): 107709.1\u2013107709.13.","DOI":"10.1016\/j.knosys.2021.107709"},{"issue":"6","key":"9644_CR19","first-page":"1443","volume":"8","author":"A Jazayeri","year":"2022","unstructured":"Jazayeri A, Yang CC. Frequent subgraph mining algorithms in static and temporal graph-transaction settings: a survey. IEEE Trans Big Data. 2022;8(6):1443\u201362.","journal-title":"IEEE Trans Big Data"},{"key":"9644_CR20","doi-asserted-by":"crossref","unstructured":"Karaca M, Alvarado MM, Gahrooei MR, Bihorac A, Pardalos PM. Frequent pattern mining from multivariate time series data. Exp Syst Appl. 194(May): 116435.1\u2013116435.11.","DOI":"10.1016\/j.eswa.2021.116435"},{"key":"9644_CR21","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.ijar.2021.12.012","volume":"145","author":"T Makhalova","year":"2022","unstructured":"Makhalova T, Buzmakov A, Kuznetsov SO, Napoli A. Introducing the closure structure and the gdpm algorithm for mining and understanding a tabular dataset. Intern J Approx Reason. 2022;145:75\u201390.","journal-title":"Intern J Approx Reason"},{"key":"9644_CR22","doi-asserted-by":"crossref","unstructured":"Preti G, Morales GDF, Riondato M. Maniacs: approximate mining of frequent subgraph patterns through sampling. ACM Trans Intell Syst Technol. 2023;14(3): 54.1\u201354.29.","DOI":"10.1145\/3587254"},{"issue":"1","key":"9644_CR23","first-page":"1","volume":"13","author":"MS Nawaz","year":"2021","unstructured":"Nawaz MS, Fournier-Viger P, Yun U, Wu Y, Song W. Mining high utility itemsets with hill climbing and simulated annealing. ACM Trans Manag Inform Syst (TMIS). 2021;13(1):1\u201322.","journal-title":"ACM Trans Manag Inform Syst (TMIS)"},{"issue":"5","key":"9644_CR24","doi-asserted-by":"publisher","first-page":"2885","DOI":"10.1007\/s10115-023-02045-8","volume":"66","author":"M Han","year":"2024","unstructured":"Han M, Liu S, Gao Z, Mu D, Li A. Mining Top-K constrained cross-level high-utility itemsets over data streams. Knowl Inform Syst. 2024;66(5):2885\u2013924.","journal-title":"Knowl Inform Syst"},{"key":"9644_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2024.112376","volume":"302","author":"X Liu","year":"2024","unstructured":"Liu X, Chen G, Wen S, Zuo W. Effective approaches for mining correlated and low-average-cost patterns. Knowl Based Syst. 2024;302: 112376.","journal-title":"Knowl Based Syst"},{"key":"9644_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2024.120392","volume":"665","author":"W Song","year":"2024","unstructured":"Song W, Sun Z, Fournier-Viger P, Wu Y. MRI-CE: minimal rare itemset discovery using the cross-entropy method. Inform Sci. 2024;665: 120392.","journal-title":"Inform Sci"}],"container-title":["Discover Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-025-09644-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10791-025-09644-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-025-09644-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T07:44:08Z","timestamp":1751615048000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10791-025-09644-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,4]]},"references-count":26,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["9644"],"URL":"https:\/\/doi.org\/10.1007\/s10791-025-09644-9","relation":{},"ISSN":["2948-2992"],"issn-type":[{"value":"2948-2992","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,4]]},"assertion":[{"value":"24 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 July 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"139"}}