{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:10:04Z","timestamp":1757617804563,"version":"3.44.0"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T00:00:00Z","timestamp":1740441600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T00:00:00Z","timestamp":1740441600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272196"],"award-info":[{"award-number":["62272196"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangzhou Basic and Applied Basic Research Foundation","award":["2024A04J9971"],"award-info":[{"award-number":["2024A04J9971"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s13042-025-02578-0","type":"journal-article","created":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T04:58:03Z","timestamp":1740459483000},"page":"5419-5439","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Periodic frequent subgraph mining in dynamic graphs"],"prefix":"10.1007","volume":"16","author":[{"given":"Jiayu","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaoming","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoting","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wensheng","family":"Gan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ama\u00ebl","family":"Broustet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,25]]},"reference":[{"issue":"7","key":"2578_CR1","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1007\/s10115-022-01681-w","volume":"64","author":"S Banerjee","year":"2022","unstructured":"Banerjee S (2022) A survey on mining and analysis of uncertain graphs. Knowl Inf Syst 64(7):1653\u20131689","journal-title":"Knowl Inf Syst"},{"issue":"10","key":"2578_CR2","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1109\/TKDE.2023.3265598","volume":"35","author":"Y Dong","year":"2023","unstructured":"Dong Y, Ma J, Wang S, Chen C, Li J (2023) Fairness in graph mining: A survey. IEEE Trans Knowl Data Eng 35(10):583\u2013602","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2578_CR3","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, He G, Cheng C, Li J, Zhou M, Lin JC, Yun U (2020) A survey of pattern mining in dynamic graphs. WIREs Data Mining Knowl. Discov. 10(6)","DOI":"10.1002\/widm.1372"},{"key":"2578_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.future.2022.04.013","volume":"134","author":"W Inoubli","year":"2022","unstructured":"Inoubli W, Aridhi S, Mezni H, Madouri M, Mephu Nguifo E (2022) A distributed and incremental algorithm for large-scale graph clustering. Futur Gener Comput Syst 134:1\u201328","journal-title":"Futur Gener Comput Syst"},{"key":"2578_CR5","doi-asserted-by":"crossref","unstructured":"Prakash\u00a0Dixit C, Khare N (2018) A survey of frequent subgraph mining algorithms. Intern. J. Engineering & Technology 7(3.8), 75\u2013105","DOI":"10.14419\/ijet.v7i3.8.15218"},{"issue":"6","key":"2578_CR6","doi-asserted-by":"publisher","first-page":"1050","DOI":"10.1109\/TKDE.2017.2785824","volume":"30","author":"G Liu","year":"2018","unstructured":"Liu G, Liu Y, Zheng K, Liu A, Li Z, Wang Y, Zhou X (2018) MCS-GPM: multi-constrained simulation based graph pattern matching in contextual social graphs. IEEE Trans Knowl Data Eng 30(6):1050\u20131064","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2578_CR7","doi-asserted-by":"crossref","unstructured":"Liu G, Zheng K, Wang Y, Orgun MA, Liu A, Zhao L, Zhou X (2015) Multi-Constrained Graph Pattern Matching in large-scale contextual social graphs, in Proc. IEEE Intern. Conf. Data Engineering , pp. 351\u2013362","DOI":"10.1109\/ICDE.2015.7113297"},{"key":"2578_CR8","doi-asserted-by":"crossref","unstructured":"Purohit S, Choudhury S, Holder LB (2017) Application-Specific Graph Sampling for Frequent Subgraph Mining and Community Detection, in Proc. IEEE Intern. Conf. Big Data , pp. 1000\u20131005","DOI":"10.1109\/BigData.2017.8258022"},{"issue":"1","key":"2578_CR9","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/TITB.2009.2028234","volume":"14","author":"Y Cho","year":"2010","unstructured":"Cho Y, Zhang A (2010) Predicting protein function by frequent functional association pattern mining in protein interaction networks. IEEE Trans Inf Technol Biomed 14(1):30\u201336","journal-title":"IEEE Trans Inf Technol Biomed"},{"key":"2578_CR10","doi-asserted-by":"crossref","unstructured":"Medina SG, Fassio AV, de\u00a0A.\u00a0Silveira S, da\u00a0Silveira CH, de\u00a0Melo-Minardi RC (2017) CALI: A Novel Visual Model for Frequent Pattern Mining in Protein-Ligand Graphs, in Proc. 17th IEEE Intern. Conf. on Bioinformatics and Bioengineering , pp. 352\u2013358","DOI":"10.1109\/BIBE.2017.00-29"},{"issue":"5","key":"2578_CR11","doi-asserted-by":"publisher","first-page":"1496","DOI":"10.1109\/TCBB.2016.2576440","volume":"16","author":"P Meysman","year":"2019","unstructured":"Meysman P, Saeys Y, Sabaghian E, Bittremieux W, de Peer YV, Goethals B, Laukens K (2019) Mining the enriched subgraphs for specific vertices in a biological graph. IEEE ACM Trans. Comput. Biol. Bioinform. 16(5):1496\u20131507","journal-title":"IEEE ACM Trans. Comput. Biol. Bioinform."},{"issue":"2","key":"2578_CR12","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/TETCI.2018.2848293","volume":"4","author":"A Chaturvedi","year":"2020","unstructured":"Chaturvedi A, Tiwari A (2020) System network complexity: Network evolution subgraphs of system state series. IEEE Trans. Emerg. Top. Comput. Intell. 4(2):130\u2013139","journal-title":"IEEE Trans. Emerg. Top. Comput. Intell."},{"key":"2578_CR13","doi-asserted-by":"crossref","unstructured":"Chen C, Liang C, Lin J, Wang L, Liu Z, Yang X, Zhou J, Shuang Y, Qi Y (2019) InfDetect: a Large Scale Graph-based Fraud Detection System for E-Commerce Insurance, in Proc. IEEE Intern. Conf. Big Data , pp. 1765\u20131773","DOI":"10.1109\/BigData47090.2019.9006115"},{"key":"2578_CR14","doi-asserted-by":"crossref","unstructured":"Inokuchi A, Washio T, Motoda H (2000) An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data, in Proc. 4th European Conf. PKDD, Principles of Data Mining and Knowledge Discovery , pp. 13\u201323","DOI":"10.1007\/3-540-45372-5_2"},{"issue":"9","key":"2578_CR15","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1109\/TKDE.2004.33","volume":"16","author":"M Kuramochi","year":"2004","unstructured":"Kuramochi M, Karypis G (2004) An efficient algorithm for discovering frequent subgraphs. IEEE Trans. Knowl. & Data Engineering 16(9):1038\u20131051","journal-title":"IEEE Trans. Knowl. & Data Engineering"},{"issue":"8","key":"2578_CR16","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1016\/j.is.2005.05.005","volume":"32","author":"M Kuramochi","year":"2007","unstructured":"Kuramochi M, Karypis G (2007) Discovering frequent geometric subgraphs. Inf Syst 32(8):1101\u20131120","journal-title":"Inf Syst"},{"key":"2578_CR17","unstructured":"Yan X, Han J (2002) gSpan: Graph-Based Substructure Pattern Mining, in Proc. IEEE Intern. Conf. Data Mining , pp. 721\u2013724"},{"issue":"3","key":"2578_CR18","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s10588-005-5381-4","volume":"11","author":"A Chapanond","year":"2005","unstructured":"Chapanond A, Krishnamoorthy MS, Yener B (2005) Graph theoretic and spectral analysis of enron email data. Comput. & Math. Organization Theory 11(3):265\u2013281","journal-title":"Comput. & Math. Organization Theory"},{"issue":"3\/4","key":"2578_CR19","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1504\/IJSHC.2020.111191","volume":"3","author":"C Sosorburam","year":"2020","unstructured":"Sosorburam C, Mir MY, Hu C (2020) Finding temporal periodicity with chi-squared test in mobile social networks. Int. J. Soc. Humanist. Comput. 3(3\/4):290\u2013307","journal-title":"Int. J. Soc. Humanist. Comput."},{"key":"2578_CR20","unstructured":"Wasserman S, Faust K. Social network analysis - methods and applications, Structural analysis in the social sciences, vol.\u00a08 (Cambridge University Press, 2007)"},{"key":"2578_CR21","doi-asserted-by":"crossref","unstructured":"Lahiri M, Berger-Wolf TY (2008) Mining Periodic Behavior in Dynamic Social Networks, in Proc. 8th IEEE Intern. Conf. Data Mining , pp. 373\u2013382","DOI":"10.1109\/ICDM.2008.104"},{"issue":"11","key":"2578_CR22","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/j.ipl.2011.02.016","volume":"111","author":"A Apostolico","year":"2011","unstructured":"Apostolico A, Barbares M, Pizzi C (2011) Speedup for a periodic subgraph miner. Inf Process Lett 111(11):521\u2013523","journal-title":"Inf Process Lett"},{"key":"2578_CR23","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1016\/j.eswa.2016.10.033","volume":"72","author":"S Halder","year":"2017","unstructured":"Halder S, Samiullah M, Lee Y (2017) Supergraph based periodic pattern mining in dynamic social networks. Expert Syst. with Appl. 72:430\u2013442","journal-title":"Expert Syst. with Appl."},{"issue":"1","key":"2578_CR24","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han J, Pei J, Yin Y, Mao R (2004) Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Min. Knowl. Discov. 8(1):53\u201387","journal-title":"Data Min. Knowl. Discov."},{"issue":"6","key":"2578_CR25","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1329","volume":"9","author":"JM Luna","year":"2019","unstructured":"Luna JM, Fournier-Viger P, Ventura S (2019) Frequent itemset mining: A 25 years review. WIREs Data Mining Knowl. Discov. 9(6):e1329","journal-title":"WIREs Data Mining Knowl. Discov."},{"issue":"3","key":"2578_CR26","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki MJ (2000) Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12(3):372\u2013390","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2578_CR27","unstructured":"Fournier-Viger P, Lin CW, Duong QH, Dam TL, Voznak M (2016) PFPM: Discovering Periodic Frequent Patterns with Novel Periodicity Measures, in Proc. 2nd Czech-China Scientific Conf. , pp. 1\u201310"},{"issue":"6","key":"2578_CR28","doi-asserted-by":"publisher","first-page":"6917","DOI":"10.1007\/s10489-020-02181-6","volume":"52","author":"P Fournier-Viger","year":"2022","unstructured":"Fournier-Viger P, Wang Y, Yang P, Lin JC, Yun U, Kiran RU (2022) TSPIN: mining top-k stable periodic patterns. Appl Intell 52(6):6917\u20136938","journal-title":"Appl Intell"},{"key":"2578_CR29","doi-asserted-by":"crossref","unstructured":"Tanbeer SK, Ahmed CF, Jeong B, Lee Y (2009) Discovering Periodic-Frequent Patterns in Transactional Databases, in Proc. Pacific-Asia Conf. Adv. Knowl. Discovery & Data Mining , pp. 242\u2013253","DOI":"10.1007\/978-3-642-01307-2_24"},{"key":"2578_CR30","doi-asserted-by":"crossref","unstructured":"Surana A, Kiran RU, Reddy PK (2011) An Efficient Approach to Mine Periodic-Frequent Patterns in Transactional Databases, in Proc. PAKDD Intern. Workshops New Frontiers in Applied Data Mining , pp. 254\u2013266","DOI":"10.1007\/978-3-642-28320-8_22"},{"key":"2578_CR31","doi-asserted-by":"crossref","unstructured":"Rashid MM, Karim MR, Jeong B, Choi H. Efficient Mining Regularly Frequent Patterns in Transactional Databases, in Proc. 17th Intern. Conf. Database Systems for Advanced Applications (Springer, 2012), pp. 258\u2013271","DOI":"10.1007\/978-3-642-29038-1_20"},{"key":"2578_CR32","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Yang P, Lin JC, Kiran RU (2019) Discovering Stable Periodic-Frequent Patterns in Transactional Data, in Proc. 32nd Intern. Conf. on Industrial, Engineering and Other Applications of Applied Intelligent Systems, Advances and Trends in Artificial Intelligence IEA\/AIE , pp. 230\u2013244","DOI":"10.1007\/978-3-030-22999-3_21"},{"key":"2578_CR33","doi-asserted-by":"crossref","unstructured":"Kiran RU, Watanobe Y, Chaudhury B, Zettsu K, Toyoda M, Kitsuregawa M. Discovering Maximal Periodic-Frequent Patterns in Very Large Temporal Databases, in Proc. 7th IEEE Intern. Conf. on Data Science and Advanced Analytics (IEEE, 2020), pp. 11\u201320","DOI":"10.1109\/DSAA49011.2020.00013"},{"issue":"120356","key":"2578_CR34","first-page":"1","volume":"228","author":"Y Qi","year":"2023","unstructured":"Qi Y, Zhang X, Chen G, Gan W (2023) Mining periodic trends via closed high utility patterns. Expert Syst. with Appl. 228(120356):1\u201317","journal-title":"Expert Syst. with Appl."},{"issue":"6","key":"2578_CR35","first-page":"1443","volume":"8","author":"A Jazayeri","year":"2022","unstructured":"Jazayeri A, Yang CC (2022) Frequent subgraph mining algorithms in static and temporal graph-transaction settings: A survey. IEEE Trans. Big Data 8(6):1443\u20131462","journal-title":"IEEE Trans. Big Data"},{"key":"2578_CR36","doi-asserted-by":"crossref","unstructured":"Welke P (2020) Efficient Frequent Subgraph Mining in Transactional Databases, in Proc. 7th IEEE Intern. Conf. on Data Science and Advanced Analytics , pp. 307\u2013314","DOI":"10.1109\/DSAA49011.2020.00044"},{"key":"2578_CR37","doi-asserted-by":"crossref","unstructured":"Borgelt C, Berthold MR (2002) Mining Molecular Fragments: Finding Relevant Substructures of Molecules, in Proc. IEEE Intern. Conf. Data Mining , pp. 51\u201358","DOI":"10.1109\/ICDM.2002.1183885"},{"key":"2578_CR38","doi-asserted-by":"crossref","unstructured":"Huan J, Wei W, Prins J (2003) Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism, in Proc. IEEE Intern. Conf. Data Mining , pp. 549\u2013552","DOI":"10.1109\/ICDM.2003.1250974"},{"key":"2578_CR39","doi-asserted-by":"crossref","unstructured":"Chen Z, Chen X, Chen G, Gan W (2023) Frequent Subgraph Mining in Dynamic Databases, in Proc. IEEE Intern. Conf. on Big Data, BigData 2023 , pp. 5733\u20135742","DOI":"10.1109\/BigData59044.2023.10386736"},{"key":"2578_CR40","doi-asserted-by":"crossref","unstructured":"Cheng Z, Andriamampianina L, Ravat F, Song J, Vall\u00e8s-Parlangeau N, Fournier-Viger P, Selmaoui-Folcher N (2023) Mining Frequent Sequential Subgraph Evolutions in Dynamic Attributed Graphs, in Proc. 27th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD (2) , pp. 66\u201378","DOI":"10.1007\/978-3-031-33377-4_6"},{"key":"2578_CR41","doi-asserted-by":"crossref","unstructured":"He C, Chen X, Chen G, Gan W, Fournier\u00a0Viger P (2023) Mining credible attribute rules in dynamic attributed graphs. Expert Syst. with Appl. 246, 123012:1\u201311","DOI":"10.1016\/j.eswa.2023.123012"},{"issue":"2","key":"2578_CR42","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s11704-016-6245-4","volume":"13","author":"T Dam","year":"2019","unstructured":"Dam T, Li K, Fournier-Viger P, Duong Q (2019) CLS-Miner: efficient and effective closed high-utility itemset mining. Frontiers Comput. Sci. 13(2):357\u2013381","journal-title":"Frontiers Comput. Sci."},{"issue":"1","key":"2578_CR43","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TKDE.2006.10","volume":"18","author":"C Lucchese","year":"2006","unstructured":"Lucchese C, Orlando S, Perego R (2006) Fast and memory efficient mining of frequent closed itemsets. IEEE Trans Knowl Data Eng 18(1):21\u201336","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2578_CR44","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1109\/ACCESS.2021.3133666","volume":"9","author":"LBQ Nguyen","year":"2021","unstructured":"Nguyen LBQ, Nguyen LTT, Zelinka I, Sn\u00e1sel V, Nguyen HS, Vo B (2021) A method for closed frequent subgraph mining in a single large graph. IEEE Access 9:719\u2013733","journal-title":"IEEE Access"},{"key":"2578_CR45","doi-asserted-by":"crossref","unstructured":"Yan X, Han J (2003) CloseGraph: mining closed frequent graph patterns, in Proc. Ninth ACM SIGKDD Intern. Conf. on Knowledge Discovery and Data Mining , pp. 286\u2013295","DOI":"10.1145\/956750.956784"},{"key":"2578_CR46","doi-asserted-by":"crossref","unstructured":"Li Y, Lin Q, Li R, Duan D (2010) TGP: Mining Top-K Frequent Closed Graph Pattern without Minimum Support, in Proc. 6th Intern. Conf. Advanced Data Mining and Applications , pp. 537\u2013548","DOI":"10.1007\/978-3-642-17316-5_51"},{"key":"2578_CR47","doi-asserted-by":"crossref","unstructured":"Karabadji NEI, Aridhi S, Seridi H (2016) A Closed Frequent Subgraph Mining Algorithm in Unique Edge Label Graphs, in Proc. 12th Intern. Conf. MLDM Machine Learning and Data Mining in Pattern Recognition , pp. 43\u201357","DOI":"10.1007\/978-3-319-41920-6_4"},{"key":"2578_CR48","doi-asserted-by":"crossref","unstructured":"Shaul Z, Naaz S (2021) cgSpan: Closed Graph-Based Substructure Pattern Mining, in Proc. IEEE Intern. Conf. on Big Data , pp. 4989\u20134998","DOI":"10.1109\/BigData52589.2021.9671995"},{"key":"2578_CR49","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/j.ins.2022.12.089","volume":"625","author":"H Peng","year":"2023","unstructured":"Peng H, Zhang D (2023) CFGM: an algorithm for closed frequent graph patterns mining. Inf Sci 625:327\u2013341","journal-title":"Inf Sci"},{"issue":"120363","key":"2578_CR50","first-page":"1","volume":"665","author":"X Chen","year":"2024","unstructured":"Chen X, Cai J, Chen G, Gan W, Broustet A (2024) FCSG-Miner: Frequent closed subgraph mining in multi-graphs. Inf Sci 665(120363):1\u201319","journal-title":"Inf Sci"},{"key":"2578_CR51","doi-asserted-by":"crossref","unstructured":"Han J, Dong G, Yin Y (1999) Efficient mining of partial periodic patterns in time series database, in Proceedings 15th International Conference on Data Engineering , 1, pp. 106\u2013115","DOI":"10.1109\/ICDE.1999.754913"},{"key":"2578_CR52","doi-asserted-by":"crossref","unstructured":"Yang J, Wang W, Yu PS. Mining asynchronous periodic patterns in time series data, in Proc. sixth ACM SIGKDD Intern. Conf. on Knowledge Discovery and Data Mining (ACM, 2000), pp. 275\u2013279","DOI":"10.1145\/347090.347150"},{"issue":"1","key":"2578_CR53","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1109\/TKDE.2010.76","volume":"23","author":"F Rasheed","year":"2011","unstructured":"Rasheed F, Al-Shalalfa M, Alhajj R (2011) Efficient periodicity mining in time series databases using suffix trees. IEEE Trans Knowl Data Eng 23(1):79\u201394","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"2578_CR54","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1007\/s10618-021-00753-9","volume":"35","author":"J Huang","year":"2021","unstructured":"Huang J, Jaysawal BP, Wang C (2021) Mining full, inner and tail periodic patterns with perfect, imperfect and asynchronous periodicity simultaneously. Data Min. Knowl. Discov. 35(4):1225\u20131257","journal-title":"Data Min. Knowl. Discov."},{"key":"2578_CR55","doi-asserted-by":"crossref","unstructured":"Zhang Q, Guo D, Zhao X, Li X, Wang X. Seasonal-Periodic Subgraph Mining in Temporal Networks, in Proc. 29th ACM Intern. Conf. on Information and Knowledge Management (ACM, 2020), pp. 2309\u20132312","DOI":"10.1145\/3340531.3412091"},{"key":"2578_CR56","doi-asserted-by":"crossref","unstructured":"Islam MA, Acharjee UK. Mining Periodic Patterns and Accuracy Calculation for Activity Monitoring Using RF Tag Arrays, in Proceedings of International Joint Conference on Computational Intelligence (Springer, 2018), pp. 85\u201395","DOI":"10.1007\/978-981-13-7564-4_8"},{"issue":"1","key":"2578_CR57","doi-asserted-by":"publisher","first-page":"2047","DOI":"10.1007\/s13755-019-0070-8","volume":"7","author":"D Zhang","year":"2019","unstructured":"Zhang D, Lee K, Lee I (2019) Multi-level medical periodic patterns from human movement behaviors. Health Inf. Sci. Syst. 7(1):2047\u20132501","journal-title":"Health Inf. Sci. Syst."},{"issue":"4","key":"2578_CR58","doi-asserted-by":"publisher","first-page":"2667","DOI":"10.1007\/s11192-020-03840-8","volume":"126","author":"S Hosseini","year":"2021","unstructured":"Hosseini S, Baziyad H, Norouzi R, Khiabani SJ, Gid\u00f3falvi G, Albadvi A, Alimohammadi A, Seyedabrishami S (2021) Mapping the intellectual structure of GIS-T field (2008\u20132019): a dynamic co-word analysis. Scientometrics 126(4):2667\u20132688","journal-title":"Scientometrics"},{"issue":"8","key":"2578_CR59","doi-asserted-by":"publisher","first-page":"6625","DOI":"10.1007\/s11192-021-04038-2","volume":"126","author":"A Pourhatami","year":"2021","unstructured":"Pourhatami A, Kaviyani-Charati M, Kargar B, Baziyad H, Kargar M, Olmeda-G\u00f3mez C (2021) Mapping the intellectual structure of the coronavirus field (2000\u20132020): a co-word analysis. Scientometrics 126(8):6625\u20136657","journal-title":"Scientometrics"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-025-02578-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-025-02578-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-025-02578-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T10:59:24Z","timestamp":1757156364000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-025-02578-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,25]]},"references-count":59,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["2578"],"URL":"https:\/\/doi.org\/10.1007\/s13042-025-02578-0","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"type":"print","value":"1868-8071"},{"type":"electronic","value":"1868-808X"}],"subject":[],"published":{"date-parts":[[2025,2,25]]},"assertion":[{"value":"20 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 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":"The authors have no conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}