{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T15:35:57Z","timestamp":1767713757808,"version":"3.35.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T00:00:00Z","timestamp":1736467200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T00:00:00Z","timestamp":1736467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s10489-024-06151-0","type":"journal-article","created":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T09:14:41Z","timestamp":1736500481000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An efficient PSO-based evolutionary model for closed high-utility itemset mining"],"prefix":"10.1007","volume":"55","author":[{"given":"Simen","family":"Carstensen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8768-9709","authenticated-orcid":false,"given":"Jerry Chun-Wei","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,10]]},"reference":[{"issue":"2","key":"6151_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/170036.170072","volume":"22","author":"R Agrawal","year":"1993","unstructured":"Agrawal R, Imieli\u0144ski T, Swami A (1993) Mining association rules between sets of items in large databases. ACM SIGMOD Record 22(2):207\u2013216","journal-title":"ACM SIGMOD Record"},{"issue":"3","key":"6151_CR2","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.datak.2005.10.004","volume":"59","author":"H Yao","year":"2006","unstructured":"Yao H, Hamilton HJ (2006) Mining itemset utilities from transaction databases. Data Knowl Eng 59(3):603\u2013626","journal-title":"Data Knowl Eng"},{"issue":"3","key":"6151_CR3","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1109\/TKDE.2014.2345377","volume":"27","author":"VS Tseng","year":"2015","unstructured":"Tseng VS, Wu CW, Fournier-Viger P, Yu PS (2015) Efficient algorithms for mining the concise and lossless representation of high utility itemsets. IEEE Trans Knowl Data Eng 27(3):726\u2013739","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"6151_CR4","doi-asserted-by":"publisher","first-page":"19568","DOI":"10.1109\/ACCESS.2018.2819162","volume":"6","author":"W Song","year":"2018","unstructured":"Song W, Huang C (2018) Mining high utility itemsets using bio-inspired algorithms: A diverse optimal value framework. IEEE Access 6:19568\u201319582","journal-title":"IEEE Access"},{"key":"6151_CR5","first-page":"689","volume":"3518","author":"Y Liu","year":"2005","unstructured":"Liu Y, Liao W, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. Adv Knowl Discov Data Min 3518:689\u2013695","journal-title":"Adv Knowl Discov Data Min"},{"issue":"12","key":"6151_CR6","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1109\/TKDE.2009.46","volume":"21","author":"CF Ahmed","year":"2009","unstructured":"Ahmed CF, Tanbeer SK, Jeong BS, Lee YK (2009) Efficient tree structures for high utility pattern mining in incremental databases. IEEE Trans Knowl Data Eng 21(12):1708\u20131721","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"6151_CR7","doi-asserted-by":"crossref","unstructured":"Tseng V, Wu CW, Shie BE, Yu P (2010) UP-Growth: An efficient algorithm for high utility itemset mining. ACM SIGKDD international conference on knowledge discovery and data mining, pp 253-262","DOI":"10.1145\/1835804.1835839"},{"key":"6151_CR8","doi-asserted-by":"crossref","unstructured":"Liu M, Qu J (2012) Mining High Utility Itemsets without Candidate Generation. ACM international conference on information and knowledge management, pp 55-64","DOI":"10.1145\/2396761.2396773"},{"key":"6151_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-08326-1_9","volume":"8502","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger P, Wu CW, Zida S, Tseng VS (2014) FHM: Faster high-utility itemset mining using estimated utility co-occurrence pruning. Lect Notes Comput Sci 8502:83\u201392","journal-title":"Lect Notes Comput Sci"},{"key":"6151_CR10","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-319-27060-9_44","volume":"9413","author":"S Zida","year":"2015","unstructured":"Zida S, Fournier-Viger P, Lin JCW, Wu CW, Tseng VS (2015) EFIM: A highly efficient algorithm for high-utility itemset mining. Lect Notes Comput Sci 9413:530\u2013546","journal-title":"Lect Notes Comput Sci"},{"key":"6151_CR11","doi-asserted-by":"crossref","unstructured":"Liu J, Wang K, Fung M (2012) Direct discovery of high utility itemsets without candidate generation. IEEE 12th international conference on data mining, pp 984\u2013989","DOI":"10.1109\/ICDM.2012.20"},{"issue":"6","key":"6151_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3363571","volume":"13","author":"JMT Wu","year":"2019","unstructured":"Wu JMT, Lin JCW, Tamrakar A (2019) High-utility itemset mining with effective pruning strategies. ACM Trans Knowl Discov Data 13(6):1\u201322","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"4","key":"6151_CR13","doi-asserted-by":"publisher","first-page":"108865","DOI":"10.1016\/j.knosys.2022.108865","volume":"248","author":"P Wu","year":"2022","unstructured":"Wu P, Niu X, Fournier-Viger P, Huang C, Wang B (2022) UBP-Miner: An efficient bit based high utility itemset mining algorithm. Knowl-Based Syst 248(4):108865","journal-title":"Knowl-Based Syst"},{"key":"6151_CR14","doi-asserted-by":"crossref","unstructured":"Wu CW, FournierViger P, Gu JY, Tseng VS (2015) Mining closed+ high utility itemsets without candidate generation. In: Conference on technologies and applications of artificial intelligence, pp 187\u2013194","DOI":"10.1109\/TAAI.2015.7407089"},{"key":"6151_CR15","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-319-41920-6_15","volume":"9729","author":"P Fournier-Viger","year":"2016","unstructured":"Fournier-Viger P, Zida S, Lin JCW, Wu CW, Tseng VS (2016) EFIM-closed: Fast and memory efficient discovery of closed high-utility itemsets. Mach Learn Data Min Pattern Recognit 9729:199\u2013213","journal-title":"Mach Learn Data Min Pattern Recognit"},{"issue":"2","key":"6151_CR16","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s11704-016-6245-4","volume":"13","author":"TL Dam","year":"2019","unstructured":"Dam TL, Li K, Fournier-Viger P, Duong QH (2019) CLS-Miner: Efficient and effective closed high-utility itemset mining. Front Comput Sci 13(2):357\u2013381","journal-title":"Front Comput Sci"},{"key":"6151_CR17","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle Swarm Optimization. The international conference on neural networks, vol 4, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"6151_CR18","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.engappai.2016.07.006","volume":"55","author":"JCW Lin","year":"2016","unstructured":"Lin JCW, Yang L, Fournier-Viger P, Wu JMT, Honf TP, Wang LSL, Zhan J (2016) Mining high-utility itemsets based on particle swarm optimization. Eng Appl Artif Intell 55:320\u2013330","journal-title":"Eng Appl Artif Intell"},{"issue":"17","key":"6151_CR19","doi-asserted-by":"publisher","first-page":"5103","DOI":"10.1007\/s00500-016-2106-1","volume":"21","author":"JCW Lin","year":"2016","unstructured":"Lin JCW, Yang L, Fournier-Viger P, Hong TP, Voznak M (2016) A binary PSO approach to mine high-utility itemsets. Soft Comput 21(17):5103\u20135121","journal-title":"Soft Comput"},{"key":"6151_CR20","first-page":"38","volume":"12447","author":"W Song","year":"2020","unstructured":"Song W, Li J (2020) Discovering high utility itemsets using set-based particle swarm optimization. Adv Data Min Appl 12447:38\u201353","journal-title":"Adv Data Min Appl"},{"key":"6151_CR21","doi-asserted-by":"publisher","first-page":"109073","DOI":"10.1016\/j.asoc.2022.109073","volume":"124","author":"W Fang","year":"2022","unstructured":"Fang W, Zhang Q, Lu H, Lin JCW (2022) High-utility itemsets mining based on binary particle swarm optimization with multiple adjustment strategies. Appl Soft Comput 124:109073","journal-title":"Appl Soft Comput"},{"key":"6151_CR22","first-page":"98","volume":"88","author":"W Song","year":"2021","unstructured":"Song W, Nan J (2021) Mining high utility itemsets using ant colony optimization, advances in natural computation, fuzzy systems and knowledge. Discovery 88:98\u2013107","journal-title":"Discovery"},{"issue":"8","key":"6151_CR23","doi-asserted-by":"publisher","first-page":"8839","DOI":"10.1007\/s10489-021-02922-1","volume":"52","author":"S Pramanik","year":"2021","unstructured":"Pramanik S, Goswami A (2021) Discovery of closed high utility itemsets using a fast nature-inspired ant colony algorithm. Appl Intell 52(8):8839\u20138855","journal-title":"Appl Intell"},{"key":"6151_CR24","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Lin JCW, Gomariz A, Gueniche T, Soltani A, Deng Z, Lam HT (2016) The SPMF OpenSource data mining library version 2. Joint European conference on machine learning and knowledge discovery in databases, pp 36-40","DOI":"10.1007\/978-3-319-46131-1_8"},{"issue":"4","key":"6151_CR25","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(4):337\u2013359","journal-title":"Appl Artif Intell"},{"key":"6151_CR26","doi-asserted-by":"publisher","first-page":"176799","DOI":"10.1109\/ACCESS.2019.2958150","volume":"7","author":"Z Qiang","year":"2019","unstructured":"Qiang Z, Wei F, Jun S, Quan W (2019) Improved genetic algorithm for high-utility itemset mining. IEEE Access 7:176799\u2013176813","journal-title":"IEEE Access"},{"key":"6151_CR27","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.knosys.2016.10.027","volume":"116","author":"JMT Wu","year":"2017","unstructured":"Wu JMT, Zhan J, Lin JCW (2017) An ACO-based approach to mine high-utility itemsets. Knowl-Based Syst 116:102\u2013113","journal-title":"Knowl-Based Syst"},{"key":"6151_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-93040-4_1","volume":"10939","author":"W Song","year":"2018","unstructured":"Song W, Huang C (2018) Discovering high utility itemsets based on the artificial bee colony algorithm. Adv Knowl Discov Data Min 10939:3\u201314","journal-title":"Adv Knowl Discov Data Min"},{"key":"6151_CR29","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-030-78811-7_38","volume":"12690","author":"W Song","year":"2021","unstructured":"Song W, Li J, Huang C (2021) Artificial fish swarm algorithm for mining high utility itemsets. Adv Swarm Intell 12690:407\u2013419","journal-title":"Adv Swarm Intell"},{"key":"6151_CR30","doi-asserted-by":"publisher","first-page":"107422","DOI":"10.1016\/j.asoc.2021.107422","volume":"108","author":"JCW Lin","year":"2021","unstructured":"Lin JCW, Djenouri Y, Srivastava G, Yun U, Fournier-Viger P (2021) A predictive GA-based model for closed high-utility itemset mining. Appl Soft Comput 108:107422","journal-title":"Appl Soft Comput"},{"key":"6151_CR31","doi-asserted-by":"publisher","first-page":"10604","DOI":"10.1007\/s10489-021-03134-3","volume":"52","author":"JCW Lin","year":"2022","unstructured":"Lin JCW, Djenouri Y, Srivastava G, Yun U, Fournier-Viger P (2022) Efficient evolutionary computation model of closed high-utility itemset mining. Appl Intell 52:10604\u201310616","journal-title":"Appl Intell"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-024-06151-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-024-06151-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-024-06151-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T14:54:28Z","timestamp":1738335268000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-024-06151-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,10]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["6151"],"URL":"https:\/\/doi.org\/10.1007\/s10489-024-06151-0","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2025,1,10]]},"assertion":[{"value":"4 December 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"292"}}