{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T19:51:53Z","timestamp":1767901913085,"version":"3.49.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"17","license":[{"start":{"date-parts":[[2016,3,9]],"date-time":"2016-03-09T00:00:00Z","timestamp":1457481600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61503092"],"award-info":[{"award-number":["61503092"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s00500-016-2106-1","type":"journal-article","created":{"date-parts":[[2016,3,9]],"date-time":"2016-03-09T03:03:58Z","timestamp":1457492638000},"page":"5103-5121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":115,"title":["A binary PSO approach to mine high-utility itemsets"],"prefix":"10.1007","volume":"21","author":[{"given":"Jerry Chun-Wei","family":"Lin","sequence":"first","affiliation":[]},{"given":"Lu","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Fournier-Viger","sequence":"additional","affiliation":[]},{"given":"Tzung-Pei","family":"Hong","sequence":"additional","affiliation":[]},{"given":"Miroslav","family":"Voznak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,9]]},"reference":[{"issue":"11","key":"2106_CR1","doi-asserted-by":"crossref","first-page":"2227","DOI":"10.1007\/s00500-013-1196-2","volume":"18","author":"S Agrawal","year":"2013","unstructured":"Agrawal S, Silakari S (2013) FRPSO: Fletcher-Reeves based particle swarm optimization for multimodal function optimization. Soft Comput 18(11):2227\u20132243","journal-title":"Soft Comput"},{"key":"2106_CR2","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. Int Conf Very Large Data Bases 1215:487\u2013499"},{"issue":"12","key":"2106_CR3","doi-asserted-by":"crossref","first-page":"1708","DOI":"10.1109\/TKDE.2009.46","volume":"21","author":"CF Ahmed","year":"2009","unstructured":"Ahmed CF, Tanbeer SK, Jeong BS, Le 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":"2106_CR4","doi-asserted-by":"crossref","unstructured":"Cattral R, Oppacher F, Graham KJL (2009) Techniques for evolutionary rule discovery in data mining. IEEE Congr Evolut Comput :1737\u20131744","DOI":"10.1109\/CEC.2009.4983151"},{"key":"2106_CR5","doi-asserted-by":"crossref","unstructured":"Chan R, Yang Q, Shen YD (2003) Minging high utility itemsets. IEEE Int Conf Data Mining :19\u201326","DOI":"10.1109\/ICDM.2003.1250893"},{"issue":"6","key":"2106_CR6","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1109\/69.553155","volume":"8","author":"MS Chen","year":"1996","unstructured":"Chen MS, Han J, Yu PS (1996) Data mining: an overview from a database perspective. IEEE Trans Knowl Data Eng 8(6):866\u2013883","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2106_CR7","doi-asserted-by":"crossref","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. Found Intell Syst 8502:83\u201392","journal-title":"Found Intell Syst"},{"key":"2106_CR8","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/978-3-319-14717-8_3","volume":"8933","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger P, Wu CW, Tseng VS (2014) Novel concise representations of high utility itemsets using generator patterns. Adv Data Mining Appl 8933:30\u201343","journal-title":"Adv Data Mining Appl"},{"key":"2106_CR9","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Zida S (2015) FOSHU: faster on-shelf high utility itemsets mining with or without negative unit profit. ACM Symp Appl Comput :857\u2013864","DOI":"10.1145\/2695664.2695823"},{"key":"2106_CR10","unstructured":"Frequent itemset mining dataset repository (2012). http:\/\/fimi.ua.ac.be\/data\/"},{"issue":"4","key":"2106_CR11","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1007\/s00500-010-0591-1","volume":"15","author":"W Gong","year":"2010","unstructured":"Gong W, Cai Z, Ling CX (2010) DE\/BBO: a hybrid differential evolution with biogeography-based optimization for global numerical optimization. Soft Comput 15(4):645\u2013665","journal-title":"Soft Comput"},{"issue":"1","key":"2106_CR12","doi-asserted-by":"crossref","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 Disc 8(1):53\u201387","journal-title":"Data Min Knowl Disc"},{"key":"2106_CR13","volume-title":"Adaptation in Natural and Artificial Systems, Cambridge","author":"J Holland","year":"1975","unstructured":"Holland J (1975) Adaptation in Natural and Artificial Systems, Cambridge. MIT Press, USA"},{"issue":"4","key":"2106_CR14","doi-asserted-by":"crossref","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":"2106_CR15","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1997) A discrete binary version of particle swarm algorithm. IEEE Int Conf Syst Man Cybern 5:4104\u20134108","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"2106_CR16","first-page":"1942","volume":"4","author":"J Kennedy","year":"1995","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. IEEE Int Conf Neural Netw 4:1942\u20131948","journal-title":"IEEE Int Conf Neural Netw"},{"issue":"1","key":"2106_CR17","first-page":"326336","volume":"11","author":"RJ Kuo","year":"2011","unstructured":"Kuo RJ, Chao CM, Chiu YT (2011) Application of particle swarm optimization to association rule mining. Appl Soft Comput 11(1):326336","journal-title":"Appl Soft Comput"},{"issue":"1","key":"2106_CR18","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10115-012-0492-y","volume":"38","author":"GC Lan","year":"2013","unstructured":"Lan GC, Hong TP, Tseng VS (2013) An efficient projection-based indexing approach for mining high utility itemsets. Knowl Inf Syst 38(1):85\u2013107","journal-title":"Knowl Inf Syst"},{"key":"2106_CR19","unstructured":"Li XT, Yin MH (2015) A particle swarm inspired cuckoo search algorithm for real parameter optimization. Soft Comput :1\u201325"},{"issue":"2","key":"2106_CR20","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/s00500-014-1262-4","volume":"19","author":"XL Liang","year":"2014","unstructured":"Liang XL, Li WF, Zhang Y, Zhou MC (2014) An adaptive particle swarm optimization method based on clustering. Soft Comput 19(2):431\u2013448","journal-title":"Soft Comput"},{"key":"2106_CR21","unstructured":"Lin CW, Gan WS, Fournier-Viger P, Hong TP (2015) Mining high-utility itemsets with multiple minimum utility thresholds. Int C* Conf Comput Sci Softw Eng :9\u201317"},{"key":"2106_CR22","doi-asserted-by":"crossref","unstructured":"Lin JCW, Yang L, Fournier-Viger P, Wu MT, Hong TP, Wang LSL (2015) A Swarm-based approach to mine high-utility itemsets. Multidiscip Int Soc Netw Conf","DOI":"10.1007\/978-3-662-48319-0_48"},{"issue":"6","key":"2106_CR23","doi-asserted-by":"crossref","first-page":"7419","DOI":"10.1016\/j.eswa.2010.12.082","volume":"38","author":"CW Lin","year":"2011","unstructured":"Lin CW, Hong TP, Lu WH (2011) An effective tree structure for mining high utility itemsets. Expert Syst Appl 38(6):7419\u20137424","journal-title":"Expert Syst Appl"},{"key":"2106_CR24","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao WK, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. Lecture Notes Comput Sci :689\u2013695","DOI":"10.1007\/11430919_79"},{"key":"2106_CR25","doi-asserted-by":"crossref","unstructured":"Liu M, Qu J (2012) Mining high utility itemsets without candidate generation. ACM Int Conf Inf Knowl Manag :55\u201364","DOI":"10.1145\/2396761.2396773"},{"issue":"3","key":"2106_CR26","doi-asserted-by":"crossref","first-page":"227","DOI":"10.3233\/ICA-2010-0340","volume":"17","author":"M Martnez-Ballesteros","year":"2010","unstructured":"Martnez-Ballesteros M, Martnez-lvarez F, Riquelme JC (2010) Mining quantitative association rules based on evolutionary computation and its application to atmospheric pollution. Integr Comput Aided Eng 17(3):227\u2013242","journal-title":"Integr Comput Aided Eng"},{"key":"2106_CR27","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/978-3-642-21515-5_12","volume":"6728","author":"MI Menhas","year":"2011","unstructured":"Menhas MI, Fei M, Wang L, Fu X (2011) A novel hybrid binary PSO algorithm. Lect Notes Comput Sci 6728:93\u2013100","journal-title":"Lect Notes Comput Sci"},{"key":"2106_CR28","unstructured":"Microsoft (1996) Example database foodmart of Microsoft analysis services. http:\/\/msdn.microsoft.com\/en-us\/library\/aa217032(SQL.80).aspx"},{"issue":"7","key":"2106_CR29","doi-asserted-by":"crossref","first-page":"20282044","DOI":"10.1016\/j.patcog.2012.12.011","volume":"46","author":"N Nouaouria","year":"2013","unstructured":"Nouaouria N, Boukadouma M, Proulx R (2013) Particle swarm classification: a survey and positioning. Pattern Recogn 46(7):20282044","journal-title":"Pattern Recogn"},{"key":"2106_CR30","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/978-3-642-28320-8_28","volume":"7104","author":"R Pears","year":"2012","unstructured":"Pears R, Koh YS (2012) Weighted association rule mining using particle swarm pptimization. Lect Notes Comput Sci 7104:327\u2013338","journal-title":"Lect Notes Comput Sci"},{"key":"2106_CR31","unstructured":"Salleb-Aouissi A, Vrain C, Nortet C (2007) QuantMiner: a genetic algorithm for mining quantitative association rules. Int Jt Conf Artif Intell 7:1035\u20131040"},{"key":"2106_CR32","doi-asserted-by":"crossref","first-page":"1832","DOI":"10.1016\/j.engappai.2013.06.003","volume":"26","author":"KNVD Sarath","year":"2013","unstructured":"Sarath KNVD, Ravi V (2013) Association rule mining using binary particle swarm optimization. Eng Appl Artif Intell 26:1832\u20131840","journal-title":"Eng Appl Artif Intell"},{"issue":"4","key":"2106_CR33","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution\u2013a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11(4):341\u2013359","journal-title":"J Global Optim"},{"issue":"2","key":"2106_CR34","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s00500-014-1255-3","volume":"19","author":"CW Tsai","year":"2015","unstructured":"Tsai CW, Huang KW, Yang CS, Chiang MC (2015) A fast particle swarm optimization for clustering. Soft Comput 19(2):321\u2013338","journal-title":"Soft Comput"},{"key":"2106_CR35","doi-asserted-by":"crossref","unstructured":"Tseng VS, Wu CW, Shie BE, Yu PS (2010) UP-growth: an efficient algorithm for high utility itemset mining. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 253\u2013262","DOI":"10.1145\/1835804.1835839"},{"key":"2106_CR36","doi-asserted-by":"crossref","unstructured":"Wu CW, Shie BE, Tseng VS, Yu PS (2012) Mining top-k high utility itemsets. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 78\u201386","DOI":"10.1145\/2339530.2339546"},{"key":"2106_CR37","doi-asserted-by":"crossref","unstructured":"Yao H, Hamilton HJ, Butz CJ (2004) A foundational approach to mining itemset utilities from databases. SIAM Int Conf Data Mining 4:211\u2013225","DOI":"10.1137\/1.9781611972740.51"},{"issue":"3","key":"2106_CR38","doi-asserted-by":"crossref","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"},{"key":"2106_CR39","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/978-3-540-74553-2_26","volume":"4654","author":"SJ Yen","year":"2007","unstructured":"Yen SJ, Lee YS (2007) Mining high utility quantitative association rules. Lect Notes Comput Sci 4654:283\u2013292","journal-title":"Lect Notes Comput Sci"},{"key":"2106_CR40","doi-asserted-by":"crossref","unstructured":"Zida S, Fournier-Viger P, Lin CW, Wu CW, Tseng VS (2015) EFIM: a highly efficient algorithm for high-utility itemset mining. In: Mexican International Conference on Artificial Intelligence","DOI":"10.1007\/978-3-319-27060-9_44"},{"key":"2106_CR41","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/j.ins.2014.01.045","volume":"285","author":"M Zihayat","year":"2014","unstructured":"Zihayat M, An A (2014) Mining top-k high utility patterns over data streams. Inf Sci 285:138\u2013161","journal-title":"Inf Sci"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-016-2106-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2106-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2106-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2106-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T06:28:36Z","timestamp":1567664916000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-016-2106-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,9]]},"references-count":41,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["2106"],"URL":"https:\/\/doi.org\/10.1007\/s00500-016-2106-1","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,9]]}}}