{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T21:20:31Z","timestamp":1768339231079,"version":"3.49.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T00:00:00Z","timestamp":1753574400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T00:00:00Z","timestamp":1753574400000},"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,11]]},"DOI":"10.1007\/s13042-025-02745-3","type":"journal-article","created":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T14:01:58Z","timestamp":1753624918000},"page":"9109-9126","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Targeted mining of periodic and high-utility patterns"],"prefix":"10.1007","volume":"16","author":[{"given":"Qingfeng","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Wensheng","family":"Gan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,27]]},"reference":[{"key":"2745_CR1","unstructured":"Agrawal R, Srikant R et\u00a0al (1994) Fast algorithms for mining association rules. In: the 20th International Conference on Very Large Data Bases, Santiago, pp. 487\u2013499"},{"key":"2745_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10489-024-06062-0","volume":"55","author":"R Ahmed Rizvee","year":"2025","unstructured":"Ahmed Rizvee R, Farhan Ahmed C, Leung CK (2025) A tree-based framework to mine top-k closed sequential patterns. Appl Intell 55:1\u201329","journal-title":"Appl Intell"},{"key":"2745_CR3","unstructured":"Chan R, Yang Q, Shen YD (2003) Mining high utility itemsets. In: The 3rd IEEE International Conference on Data Mining, IEEE Computer Society, pp. 19\u201319"},{"key":"2745_CR4","doi-asserted-by":"publisher","first-page":"6992","DOI":"10.1007\/s10489-022-03850-4","volume":"53","author":"Z Cheng","year":"2023","unstructured":"Cheng Z, Fang W, Shen W, Lin J, Yuan B (2023) An efficient utility-list based high-utility itemset mining algorithm. Appl Intell 53:6992\u20137006","journal-title":"Appl Intell"},{"key":"2745_CR5","first-page":"652","volume":"36","author":"W Fang","year":"2023","unstructured":"Fang W, Jiang H, Lu H, Sun J, Wu X, Lin J (2023) GPU-based efficient parallel heuristic algorithm for high-utility itemset mining in large transaction datasets. IEEE Trans Knowl Data Eng 36:652\u2013667","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2745_CR6","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Lin J.C.W, Duong Q.H, Dam T.L (2016). PHM: mining periodic high-utility itemsets, in: Industrial Conference on Data Mining, Springer. pp. 64\u201379","DOI":"10.1007\/978-3-319-41561-1_6"},{"key":"2745_CR7","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Mwamikazi E, Gueniche T, Faghihi U (2013) MEIT: Memory efficient itemset tree for targeted association rule mining. In: Advanced Data Mining and Applications, Springer, New York, pp. 95\u2013106","DOI":"10.1007\/978-3-642-53917-6_9"},{"key":"2745_CR8","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Wu CW, Zida S, Tseng VS (2014) FHM: Faster high-utility itemset mining using estimated utility co-occurrence pruning. In: 21st International Symposium on Foundations of Intelligent Systems, Springer New York, pp 83\u201392","DOI":"10.1007\/978-3-319-08326-1_9"},{"key":"2745_CR9","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1216","volume":"7","author":"W Gan","year":"2017","unstructured":"Gan W, Lin J, Chao HC, Zhan J (2017) Data mining in distributed environment: a survey. Data Min Knowl Disc 7:e1216","journal-title":"Data Min Knowl Disc"},{"key":"2745_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2024.120262","volume":"662","author":"Y Gui","year":"2024","unstructured":"Gui Y, Gan W, Wu Y, Yu PS (2024) Privacy preserving rare itemset mining. Inf Sci 662:120262","journal-title":"Inf Sci"},{"key":"2745_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J Han","year":"2000","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. ACM SIGMOD Rec 29:1\u201312","journal-title":"ACM SIGMOD Rec"},{"key":"2745_CR12","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.ins.2020.08.028","volume":"557","author":"X Han","year":"2021","unstructured":"Han X, Liu X, Li J, Gao H (2021) Efficient top-k high utility itemset mining on massive data. Inf Sci 557:382\u2013406","journal-title":"Inf Sci"},{"key":"2745_CR13","doi-asserted-by":"crossref","unstructured":"Huang S, Gan W, Miao J (2023a). Targeted querying of closed high-utility itemsets, in: IEEE International Conference on Big Data, IEEE. pp. 5967\u20135976","DOI":"10.1109\/BigData59044.2023.10386927"},{"key":"2745_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.107047","volume":"126","author":"S Huang","year":"2023","unstructured":"Huang S, Gan W, Miao J, Han X, Fournier-Viger P (2023) Targeted mining of top-k high utility itemsets. Eng Appl Artif Intell 126:107047","journal-title":"Eng Appl Artif Intell"},{"key":"2745_CR15","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/TPAMI.2023.3324799","volume":"46","author":"A Jazayeri","year":"2024","unstructured":"Jazayeri A, Yang CC (2024) Frequent pattern mining in continuous-time temporal networks. IEEE Trans Pattern Anal Mach Intell 46:305\u2013321","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"2745_CR16","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1080\/08839514.2014.891839","volume":"28","author":"S Kannimuthu","year":"2014","unstructured":"Kannimuthu S, Premalatha K (2014) Discovery of high utility itemsets using genetic algorithm with ranked mutation. Appl Artif Intell 28:337\u2013359","journal-title":"Appl Artif Intell"},{"key":"2745_CR17","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s42979-023-01967-y","volume":"4","author":"MJ Kenny Kumar","year":"2023","unstructured":"Kenny Kumar MJ, Rana D (2023) RSPHUIM: Recent short period high utility itemset mining. SN Computer Science 4:485","journal-title":"SN Computer Science"},{"key":"2745_CR18","doi-asserted-by":"crossref","unstructured":"Kimura G, Hayamizu Y, Kiran R.U, Kitsuregawa M, Goda K (2023). Efficient parallel mining of high-utility itemsets on multicore processors, in: The 39th IEEE International Conference on Data Engineering, IEEE. pp. 638\u2013652","DOI":"10.1109\/ICDE55515.2023.00388"},{"key":"2745_CR19","doi-asserted-by":"publisher","first-page":"1522","DOI":"10.1109\/TKDE.2003.1245290","volume":"15","author":"M Kubat","year":"2003","unstructured":"Kubat M, Hafez A, Raghavan VV, Lekkala JR, Chen WK (2003) Itemset trees for targeted association querying. IEEE Trans Knowl Data Eng 15:1522\u20131534","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2745_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.106182","volume":"123","author":"F Lai","year":"2023","unstructured":"Lai F, Zhang X, Chen G, Gan W (2023) Mining periodic high-utility itemsets with both positive and negative utilities. Eng Appl Artif Intell 123:106182","journal-title":"Eng Appl Artif Intell"},{"key":"2745_CR21","doi-asserted-by":"publisher","first-page":"2509","DOI":"10.1007\/s10115-023-01831-8","volume":"65","author":"M Li","year":"2023","unstructured":"Li M, Han M, Chen Z, Wu H, Zhang X (2023) FCHM-stream: fast closed high utility itemsets mining over data streams. Knowl Inf Syst 65:2509\u20132539","journal-title":"Knowl Inf Syst"},{"key":"2745_CR22","doi-asserted-by":"publisher","first-page":"8981","DOI":"10.1109\/TKDE.2024.3438274","volume":"36","author":"Y Li","year":"2024","unstructured":"Li Y, Ma C, Gao R, Wu Y, Li J, Wang W, Wu X (2024) OPF-Miner: Order-preserving pattern mining with forgetting mechanism for time series. IEEE Trans Knowl Data Eng 36:8981\u20138995","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2745_CR23","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.knosys.2016.08.022","volume":"111","author":"J Lin","year":"2016","unstructured":"Lin J, Fournier-Viger P, Gan W (2016) FHN: An efficient algorithm for mining high-utility itemsets with negative unit profits. Knowl-Based Syst 111:283\u2013298","journal-title":"Knowl-Based Syst"},{"key":"2745_CR24","doi-asserted-by":"crossref","unstructured":"Liu M, Qu J (2012). Mining high utility itemsets without candidate generation, in: the 21st ACM International Conference on Information and Knowledge Management, pp. 55\u201364","DOI":"10.1145\/2396761.2396773"},{"key":"2745_CR25","doi-asserted-by":"publisher","first-page":"29319","DOI":"10.1007\/s10489-023-05076-4","volume":"53","author":"X Liu","year":"2023","unstructured":"Liu X, Chen G, Wu F, Wen S, Zuo W (2023) Mining top-k high average-utility itemsets based on breadth-first search. Appl Intell 53:29319\u201329337","journal-title":"Appl Intell"},{"key":"2745_CR26","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao W.k, Choudhary A (2005). A two-phase algorithm for fast discovery of high utility itemsets, in: Advances in Knowledge Discovery and Data Mining, Springer. pp. 689\u2013695","DOI":"10.1007\/11430919_79"},{"key":"2745_CR27","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/j.ins.2022.12.092","volume":"624","author":"JM Luna","year":"2023","unstructured":"Luna JM, Kiran RU, Fournier-Viger P, Ventura S (2023) Efficient mining of top-k high utility itemsets through genetic algorithms. Inf Sci 624:529\u2013553","journal-title":"Inf Sci"},{"key":"2745_CR28","unstructured":"Miao J, Gan W, Wan S, Wu Y, Fournier-Viger P (2022a). Towards target high-utility itemsets. arXiv preprint arXiv:2206.06157"},{"key":"2745_CR29","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1109\/TAI.2022.3171530","volume":"4","author":"J Miao","year":"2022","unstructured":"Miao J, Wan S, Gan W, Sun J, Chen J (2022) Targeted high-utility itemset querying. IEEE Transactions on Artificial Intelligence 4:871\u2013883","journal-title":"IEEE Transactions on Artificial Intelligence"},{"key":"2745_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.110733","volume":"276","author":"TD Nguyen","year":"2023","unstructured":"Nguyen TD, Tung N, Pham T, Nguyen LT (2023) Parallel approaches to extract multi-level high utility itemsets from hierarchical transaction databases. Knowledge Based Systems 276:110733","journal-title":"Knowledge Based Systems"},{"key":"2745_CR31","doi-asserted-by":"crossref","unstructured":"Nofong V.M, Okai P.O, Abdel-Fatao H, Kwashie S, Bewong M, Wondoh J (2022). Towards efficient discovery of target high utility itemsets, in: IEEE International Conference on Data Mining Workshops, IEEE. pp. 517\u2013526","DOI":"10.1109\/ICDMW58026.2022.00073"},{"key":"2745_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.120356","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 Appl 228:120356","journal-title":"Expert Syst Appl"},{"key":"2745_CR33","doi-asserted-by":"publisher","first-page":"10224","DOI":"10.1109\/TKDE.2023.3256126","volume":"35","author":"JF Qu","year":"2023","unstructured":"Qu JF, Fournier-Viger P, Liu M, Hang B, Hu C (2023) Mining high utility itemsets using prefix trees and utility vectors. IEEE Trans Knowl Data Eng 35:10224\u201310236","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2745_CR34","first-page":"1","volume":"25","author":"UK Rage","year":"2024","unstructured":"Rage UK, Pamalla V, Toyoda M, Kitsuregawa M (2024) PAMI: An open-source python library for pattern mining. J Mach Learn Res 25:1\u20136","journal-title":"J Mach Learn Res"},{"key":"2745_CR35","doi-asserted-by":"publisher","first-page":"7672","DOI":"10.1109\/TCYB.2022.3198661","volume":"53","author":"T Ryu","year":"2023","unstructured":"Ryu T, Kim H, Lee C, Kim H, Vo B, Lin J, Pedrycz W, Yun U (2023) Scalable and efficient approach for high temporal fuzzy utility pattern mining. IEEE Transactions on Cybernetics 53:7672\u20137685","journal-title":"IEEE Transactions on Cybernetics"},{"key":"2745_CR36","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s10115-023-01948-w","volume":"66","author":"P Sra","year":"2024","unstructured":"Sra P, Chand S (2024) A residual utility-based concept for high-utility itemset mining. Knowl Inf Syst 66:211\u2013235","journal-title":"Knowl Inf Syst"},{"key":"2745_CR37","first-page":"1169","volume":"44","author":"K Subramanian","year":"2023","unstructured":"Subramanian K, Kandhasamy P (2023) Mining high utility itemsets using genetic algorithm based-particle swarm optimization (GA-PSO). Journal of Intelligent & Fuzzy Systems 44:1169\u20131189","journal-title":"Journal of Intelligent & Fuzzy Systems"},{"key":"2745_CR38","doi-asserted-by":"crossref","unstructured":"Tanbeer S.K, Ahmed C.F, Jeong B.S, Lee Y.K (2009). Discovering periodic-frequent patterns in transactional databases, in: Advances in Knowledge Discovery and Data Mining, Springer. pp. 242\u2013253","DOI":"10.1007\/978-3-642-01307-2_24"},{"key":"2745_CR39","doi-asserted-by":"crossref","unstructured":"Trasierras A.M, Luna J.M, Fournier-Viger P, Ventura S (2024). Data Heterogeneity\u2019s Impact on the Performance of Frequent Itemset Mining Algorithms. Information Sciences , 120981","DOI":"10.1016\/j.ins.2024.120981"},{"key":"2745_CR40","doi-asserted-by":"publisher","first-page":"1772","DOI":"10.1109\/TKDE.2012.59","volume":"25","author":"VS Tseng","year":"2012","unstructured":"Tseng VS, Shie BE, Wu CW, Yu PS (2012) Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans Knowl Data Eng 25:1772\u20131786","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2745_CR41","doi-asserted-by":"crossref","unstructured":"Tseng V.S, Wu C.W, Shie B.E, Yu P.S (2010). UP-Growth: an efficient algorithm for high utility itemset mining, in: The 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 253\u2013262","DOI":"10.1145\/1835804.1835839"},{"key":"2745_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121489","volume":"237","author":"N Tung","year":"2024","unstructured":"Tung N, Nguyen TD, Nguyen LT, Vo B (2024) An efficient method for mining high-utility itemsets from unstable negative profit databases. Expert Syst Appl 237:121489","journal-title":"Expert Syst Appl"},{"key":"2745_CR43","doi-asserted-by":"crossref","unstructured":"Wan X, Han X (2024). Efficient top-k frequent itemset mining on massive data. Data Science and Engineering , 1\u201327","DOI":"10.1007\/s41019-024-00241-2"},{"key":"2745_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115449","volume":"184","author":"Y Wu","year":"2021","unstructured":"Wu Y, Lei R, Li Y, Guo L, Wu X (2021) HAOP-Miner: Self-adaptive high-average utility one-off sequential pattern mining. Expert Syst Appl 184:115449","journal-title":"Expert Syst Appl"},{"key":"2745_CR45","doi-asserted-by":"crossref","unstructured":"Xu Y, Peng C, Chen J, Gan W, Wan S (2023). Mining rare utility patterns within target items, in: IEEE International Conference on Big Data, IEEE. pp. 6015\u20136024","DOI":"10.1109\/BigData59044.2023.10386702"},{"key":"2745_CR46","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2024.121218","volume":"681","author":"Y Yan","year":"2024","unstructured":"Yan Y, Niu X, Zhang Z, Fournier-Viger P, Ye L, Min F (2024) Efficient high utility itemset mining without the join operation. Inf Sci 681:121218","journal-title":"Inf Sci"},{"key":"2745_CR47","doi-asserted-by":"crossref","unstructured":"Zhang P, Chen J, Wan S, Gan W (2022a). Targeted mining of rare high-utility patterns, in: IEEE International Conference on Big Data, IEEE. pp. 6271\u20136280","DOI":"10.1109\/BigData55660.2022.10020226"},{"key":"2745_CR48","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.118945","volume":"637","author":"X Zhang","year":"2023","unstructured":"Zhang X, Lai F, Chen G, Gan W (2023) Mining high-utility sequences with positive and negative values. Inf Sci 637:118945","journal-title":"Inf Sci"},{"key":"2745_CR49","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/j.ins.2022.11.009","volume":"618","author":"X Zhang","year":"2022","unstructured":"Zhang X, Qi Y, Chen G, Gan W, Fournier-Viger P (2022) Fuzzy-driven periodic frequent pattern mining. Inf Sci 618:253\u2013269","journal-title":"Inf Sci"},{"key":"2745_CR50","doi-asserted-by":"crossref","unstructured":"Zida S, Fournier-Viger P, Lin J.C.W, Wu C.W, Tseng V.S (2015). EFIM: a highly efficient algorithm for high-utility itemset mining, in: Mexican International Conference on Artificial Intelligence, Springer. pp. 530\u2013546","DOI":"10.1007\/978-3-319-27060-9_44"}],"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-02745-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-025-02745-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-025-02745-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T11:24:42Z","timestamp":1762514682000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-025-02745-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,27]]},"references-count":50,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["2745"],"URL":"https:\/\/doi.org\/10.1007\/s13042-025-02745-3","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,27]]},"assertion":[{"value":"13 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 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":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}