{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T04:52:45Z","timestamp":1770353565070,"version":"3.49.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,9,28]],"date-time":"2020-09-28T00:00:00Z","timestamp":1601251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,28]],"date-time":"2020-09-28T00:00:00Z","timestamp":1601251200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s10489-020-01899-7","type":"journal-article","created":{"date-parts":[[2020,9,28]],"date-time":"2020-09-28T05:02:42Z","timestamp":1601269362000},"page":"1439-1459","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Mining frequent weighted closed itemsets using the WN-list structure and an early pruning strategy"],"prefix":"10.1007","volume":"51","author":[{"given":"Huong","family":"Bui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2723-1138","authenticated-orcid":false,"given":"Bay","family":"Vo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tu-Anh","family":"Nguyen-Hoang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Unil","family":"Yun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,28]]},"reference":[{"key":"1899_CR1","doi-asserted-by":"publisher","first-page":"6991","DOI":"10.1007\/s10586-018-2053-y","volume":"22","author":"JSA Bhavithra","year":"2019","unstructured":"Bhavithra JSA (2019) Personalized web page recommendation using case-based clustering and weighted association rule mining. Clust Comput 22:6991\u20137002","journal-title":"Clust Comput"},{"issue":"3","key":"1899_CR2","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1109\/TCYB.2019.2896267","volume":"50","author":"W Gan","year":"2020","unstructured":"Gan W, Lin JCW, Fournier-Viger P, Chao HC, Yu PS (2020) HUOPM: high-utility occupancy pattern mining. IEEE Transactions on Cybernetics 50(3):1195\u20131208","journal-title":"IEEE Transactions on Cybernetics"},{"key":"1899_CR3","doi-asserted-by":"publisher","first-page":"27584","DOI":"10.1109\/ACCESS.2020.2970181","volume":"8","author":"RU Kiran","year":"2020","unstructured":"Kiran RU, Reddy PPC, Zettsu K, Toyoda M, Kitsuregawa M, Reddy PK (2020) Efficient discovery of weighted frequent neighborhood itemsets in very large spatiotemporal databases. IEEE Access 8:27584\u201327596","journal-title":"IEEE Access"},{"key":"1899_CR4","doi-asserted-by":"crossref","unstructured":"Lakshmi KS, Vadivu G (2019) A novel approach for disease comorbidity prediction using weighted association rule mining, J Ambient Intell Humaniz Comput, pp. 1\u20138","DOI":"10.1007\/s12652-019-01217-1"},{"key":"1899_CR5","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.jpdc.2020.05.017","volume":"144","author":"MK Vanahalli","year":"2020","unstructured":"Vanahalli MK, Patil N (2020) Distributed load balancing frequent colossal closed itemset mining algorithm for high dimensional dataset. Journal of Parallel and Distributed Computing 144:136\u2013152","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"1899_CR6","doi-asserted-by":"publisher","first-page":"106064","DOI":"10.1016\/j.knosys.2020.106064","volume":"201-202","author":"B Vo","year":"2020","unstructured":"Vo B, Bui H, Vo T, Le T (2020) Mining top-rank-k frequent weighted itemsets using WN-list structures and an early pruning strategy. Knowl-Based Syst 201-202:106064","journal-title":"Knowl-Based Syst"},{"key":"1899_CR7","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.asoc.2016.01.010","volume":"41","author":"Z Deng","year":"2016","unstructured":"Deng Z (2016) DiffNodesets: an efficient structure for fast mining frequent itemsets. Appl Soft Comput 41:214\u2013223","journal-title":"Appl Soft Comput"},{"key":"1899_CR8","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Lin JCW, Vo B, Chi TT, Zhang J, Le HB (2017) A survey of itemset mining, Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, vol. 7, no. 4","DOI":"10.1002\/widm.1207"},{"key":"1899_CR9","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.ins.2019.03.050","volume":"489","author":"P Fourier-Viger","year":"2019","unstructured":"Fourier-Viger P, Li Z, Lin JC-W, Kiran RU, Fujita H (2019) Efficient algorithms to identify periodic patterns in multiple sequences. Inf Sci 489:205\u2013226","journal-title":"Inf Sci"},{"key":"1899_CR10","unstructured":"Han J, Pei J, Mortazavi-Asl B, Pinto H, Chen Q, Dayal U, Hsu M-C (2001) Prefixspan: Mining sequential patterns efficiently by prefix-projected pattern growth, in The 17th International Conference on Data Engineering, Heidelberg, Germany"},{"issue":"1","key":"1899_CR11","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1017\/S0269888912000331","volume":"28","author":"C Jiang","year":"2013","unstructured":"Jiang C, Coenen F, Zito M (2013) A survey of frequent subgraph mining algorithms. Knowl Eng Rev 28(1):75\u2013105","journal-title":"Knowl Eng Rev"},{"issue":"23","key":"1899_CR12","first-page":"18","volume":"46","author":"E Duneja","year":"2012","unstructured":"Duneja E, Sachan AK (2012) A survey on frequent itemset mining with association rules. International Journal of Computer Applications 46(23):18\u201324","journal-title":"International Journal of Computer Applications"},{"key":"1899_CR13","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/j.eswa.2017.10.039","volume":"96","author":"H Bui","year":"2018","unstructured":"Bui H, Vo B, Nguyen H, Nguyen-Hoang TA, Hong TP (2018) A weighted N-list-based method for mining frequent weighted itemsets. Expert Syst Appl 96:388\u2013405","journal-title":"Expert Syst Appl"},{"issue":"1","key":"1899_CR14","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10115-017-1103-8","volume":"56","author":"W Gan","year":"2018","unstructured":"Gan W, Lin JCW, Fourier-Viger P, Chao HC, Zhan J, Zhang J (2018) Exploiting highly qualified pattern with frequency and weight occupancy. Knowl Inf Syst 56(1):165\u2013196","journal-title":"Knowl Inf Syst"},{"key":"1899_CR15","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.engappai.2017.03.004","volume":"61","author":"W Gan","year":"2017","unstructured":"Gan W, Lin JCW, Fourier-Viger P, Chao HC, Wu JMT, Zhan J (2017) Extracting recent weighted-based patterns from uncertain temporal databases. Eng Appl Artif Intell 61:161\u2013172","journal-title":"Eng Appl Artif Intell"},{"issue":"1","key":"1899_CR16","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1142\/S0218488517500052","volume":"25","author":"G Lee","year":"2017","unstructured":"Lee G, Yun U, Ryu K (2017) Mining frequent weighted itemsets without storing transaction IDs and generating candidates. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 25(1):111\u2013144","journal-title":"International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems"},{"issue":"6","key":"1899_CR17","doi-asserted-by":"publisher","first-page":"1549","DOI":"10.1142\/S0219622017500341","volume":"16","author":"JCW Lin","year":"2017","unstructured":"Lin JCW, Gan W, Fourier-Viger P, Hong TP, Chao HC (2017) Mining weighted frequent itemsets without candidate generation in uncertain databases. International Journal of Information Technology & Decision Making 16(6):1549\u20131579","journal-title":"International Journal of Information Technology & Decision Making"},{"key":"1899_CR18","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.engappai.2015.06.009","volume":"45","author":"JCW Lin","year":"2015","unstructured":"Lin JCW, Gan W, Fournier-Viger P, Hong TP (2015) RWFIM: recent weighted-frequent itemsets mining. Eng Appl Artif Intell 45:18\u201332","journal-title":"Eng Appl Artif Intell"},{"issue":"4","key":"1899_CR19","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1007\/s10489-016-0799-6","volume":"45","author":"H Nguyen","year":"2016","unstructured":"Nguyen H, Vo B, Nguyen M, Pedrycz W (2016) An efficient algorithm for mining frequent weighted itemsets using interval word segments. Appl Intell 45(4):1008\u20131020","journal-title":"Appl Intell"},{"issue":"4","key":"1899_CR20","doi-asserted-by":"publisher","first-page":"1256","DOI":"10.1016\/j.eswa.2012.08.065","volume":"40","author":"B Vo","year":"2013","unstructured":"Vo B, Coenen F, Le B (2013) A new method for mining frequent weighted itemsets based on WIT-trees. Expert Syst Appl 40(4):1256\u20131264","journal-title":"Expert Syst Appl"},{"key":"1899_CR21","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.ins.2018.12.070","volume":"481","author":"P Fournier-Viger","year":"2019","unstructured":"Fournier-Viger P, Zhang Y, Lin JCW, Hamido F, Koh YS (2019) Mining local and peak high utility itemsets. Inf Sci 481:344\u2013367","journal-title":"Inf Sci"},{"key":"1899_CR22","unstructured":"Gan W, Lin JCW, Fourier-Viger P, Chao HC, Tseng VS, Yu PS (2019) A survey of utility-oriented pattern mining, IEEE Trans Knowl Data Eng, pp. 1\u201320"},{"issue":"2","key":"1899_CR23","first-page":"e1242","volume":"8","author":"W Gan","year":"2018","unstructured":"Gan W, Lin JC-W, Fournier-Viger P, Chao H-C, Hong T-P, Fujita H (2018) A survey of incremental high-utility itemset mining. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery 8(2):e1242","journal-title":"Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery"},{"key":"1899_CR24","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.knosys.2019.03.022","volume":"175","author":"LTT Nguyen","year":"2019","unstructured":"Nguyen LTT, Nguyen P, Nguyen TDD, Vo B, Fournier-Viger P, Tseng VS (2019) Mining high-utility itemsets in dynamic profit databases. Knowl-Based Syst 175:130\u2013144","journal-title":"Knowl-Based Syst"},{"key":"1899_CR25","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.knosys.2017.12.029","volume":"144","author":"U Yun","year":"2018","unstructured":"Yun U, Kim D, Yoon E, Fujita H (2018) Damped window based high average utility pattern mining over data streams. Knowl-Based Syst 144:188\u2013205","journal-title":"Knowl-Based Syst"},{"key":"1899_CR26","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.future.2019.09.024","volume":"103","author":"U Yun","year":"2020","unstructured":"Yun U, Nam H, Kim J, Kim H, Baek Y, Lee J, Yoon E, Truong T, Vo B, Pedrycz W (2020) Efficient transaction deleting approach of pre-large based high utility pattern mining in dynamic databases. Futur Gener Comput Syst 103:58\u201378","journal-title":"Futur Gener Comput Syst"},{"key":"1899_CR27","doi-asserted-by":"crossref","unstructured":"Tao F, Murtagh F Farid M (2003) Weighted association rule mining using weighted support and significance framework, in Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC","DOI":"10.1145\/956750.956836"},{"issue":"19","key":"1899_CR28","doi-asserted-by":"publisher","first-page":"6648","DOI":"10.1016\/j.eswa.2015.04.048","volume":"42","author":"T Le","year":"2015","unstructured":"Le T, Vo B (2015) An N-list-based algorithm for mining frequent closed patterns. Expert Syst Appl 42(19):6648\u20136657","journal-title":"Expert Syst Appl"},{"key":"1899_CR29","doi-asserted-by":"crossref","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules, in Database Theory - ICDT'99, Jerusalem, Israel","DOI":"10.1007\/3-540-49257-7_25"},{"key":"1899_CR30","unstructured":"Pei J, Han J Mao R (2000) CLOSET: an efficient algorithm for mining frequent closet itemsets, in 2000 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, Dallas, Texas, USA"},{"issue":"8","key":"1899_CR31","doi-asserted-by":"publisher","first-page":"7196","DOI":"10.1016\/j.eswa.2012.01.062","volume":"39","author":"B Vo","year":"2012","unstructured":"Vo B, Hong L, Le B (2012) DBV-miner: a dynamic bit-vector approach for fast mining frequent closed itemsets. Expert Syst Appl 39(8):7196\u20137206","journal-title":"Expert Syst Appl"},{"issue":"1","key":"1899_CR32","first-page":"199","volume":"33","author":"B Vo","year":"2017","unstructured":"Vo B (2017) An efficient method for mining frequent weighted closed itemsets from weighted item transaction databases. Journal of Information Science & Engineering 33(1):199\u2013216","journal-title":"Journal of Information Science & Engineering"},{"issue":"2","key":"1899_CR33","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. Frontiers of Computer Science 13(2):357\u2013381","journal-title":"Frontiers of Computer Science"},{"key":"1899_CR34","doi-asserted-by":"crossref","unstructured":"Fournier-Viger PZS, Lin JCW, Wu CW, Tseng VS (2016) EFIM-closed: fast and memory efficient discovery of closed high-utility itemsets, in International Conference on Machine Learning and Data Mining in Pattern Recognition, New York","DOI":"10.1007\/978-3-319-41920-6_15"},{"key":"1899_CR35","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.ins.2019.05.006","volume":"495","author":"LTT Nguyen","year":"2019","unstructured":"Nguyen LTT, Vu VV, Lam MTH, Duong TTM, Manh LT, Nguyen TTT, Vo B, Fujita H (2019) An efficient method for mining high utility closed itemsets. Inf Sci 495:78\u201399","journal-title":"Inf Sci"},{"key":"1899_CR36","doi-asserted-by":"publisher","first-page":"109928","DOI":"10.1109\/ACCESS.2020.3001975","volume":"8","author":"T Wei","year":"2020","unstructured":"Wei T, Wang B, Zhang Y, Hu K, Yao Y, Liu H (2020) FCHUIM: efficient frequent and closed high-utility itemsets mining. IEEE Access 8:109928\u2013109939","journal-title":"IEEE Access"},{"key":"1899_CR37","volume-title":"\"Weighted association rules: model and algorithm,\" in Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD-98)","author":"GD Ramkumar","year":"1998","unstructured":"Ramkumar GD, Ranka S, Tsur S (1998) \"Weighted association rules: model and algorithm,\" in Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD-98). New York City, New York"},{"key":"1899_CR38","doi-asserted-by":"crossref","unstructured":"Yun U, Leggett JJ (2005) WFIM: weighted frequent itemset mining with a weight range and a minimum weight, in Proceedings of the 2005 SIAM International Conference on Data Mining","DOI":"10.1137\/1.9781611972757.76"},{"issue":"2","key":"1899_CR39","doi-asserted-by":"publisher","first-page":"413","DOI":"10.3233\/IDA-150723","volume":"19","author":"GC Lan","year":"2015","unstructured":"Lan GC, Hong TP, Lee HY, Lin CW (2015) Tightening upper bounds for mining weighted frequent itemsets. Intelligent Data Analysis 19(2):413\u2013429","journal-title":"Intelligent Data Analysis"},{"key":"1899_CR40","doi-asserted-by":"crossref","unstructured":"Li Z, Chen F, Wu J, Liu Z, Liu W (2020) Efficient weighted probabilistic frequent itemset mining in uncertain databases, Expert Systems, p. e12551","DOI":"10.1111\/exsy.12551"},{"issue":"4","key":"1899_CR41","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TKDE.2005.60","volume":"17","author":"M Zaki","year":"2005","unstructured":"Zaki M, Hsiao C (2005) Efficient algorithm for mining closed itemsets and their lattice structure. IEEE Transaction on Knowledge and Data Engineering 17(4):462\u2013478","journal-title":"IEEE Transaction on Knowledge and Data Engineering"},{"key":"1899_CR42","doi-asserted-by":"crossref","unstructured":"Zaki MJ, Gouda K (2003) \"Fast vertical mining using diffsets, in Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA","DOI":"10.1145\/956750.956788"},{"issue":"9","key":"1899_CR43","doi-asserted-by":"publisher","first-page":"2008","DOI":"10.1007\/s11432-012-4638-z","volume":"55","author":"Z Deng","year":"2012","unstructured":"Deng Z, Wang Z, Jiang J (2012) A new algorithm for fast mining frequent itemsets using N-lists. SCIENCE CHINA Inf Sci 55(9):2008\u20132030","journal-title":"SCIENCE CHINA Inf Sci"},{"key":"1899_CR44","doi-asserted-by":"crossref","unstructured":"Wang J, Han J, Pei J (2003) CLOSET+ : searching for best strategies for mining frequent closed itemsets,\" in Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA","DOI":"10.1145\/956750.956779"},{"issue":"10","key":"1899_CR45","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1109\/TKDE.2005.166","volume":"17","author":"G Grahne","year":"2005","unstructured":"Grahne G, Zhu J (2005) Fast algorithms for frequent itemset mining using FP-trees. IEEE Trans Knowl Data Eng 17(10):1347\u20131362","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"1899_CR46","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":"1899_CR47","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.eswa.2016.09.023","volume":"67","author":"T Hashem","year":"2017","unstructured":"Hashem T, Karim MR, Samiullah M, Ahmed CF (2017) An efficient dynamic superset bit-vector approach for mining frequent closed itemsets and their lattice structure. Expert Syst Appl 67:252\u2013271","journal-title":"Expert Syst Appl"},{"key":"1899_CR48","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.ins.2018.08.009","volume":"496","author":"MK Vanahalli","year":"2019","unstructured":"Vanahalli MK, Patil N (2019) An efficient parallel row enumerated algorithm for mining frequent colossal closed itemsets from high dimensional datasets. Inf Sci 496:343\u2013362","journal-title":"Inf Sci"},{"issue":"10","key":"1899_CR49","doi-asserted-by":"publisher","first-page":"4505","DOI":"10.1016\/j.eswa.2014.01.025","volume":"41","author":"Z Deng","year":"2014","unstructured":"Deng Z, Lv S (2014) Fast mining frequent itemsets using Nodesets. Expert Syst Appl 41(10):4505\u20134512","journal-title":"Expert Syst Appl"},{"issue":"1","key":"1899_CR50","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.eswa.2014.07.045","volume":"42","author":"Q Huynh-Thi-Le","year":"2015","unstructured":"Huynh-Thi-Le Q, Le T, Vo B, Le B (2015) An efficient and effective algorithm for mining top-rank-k frequent patterns. Expert Syst Appl 42(1):156\u2013164","journal-title":"Expert Syst Appl"},{"issue":"3","key":"1899_CR51","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/B:DAMI.0000040429.96086.c7","volume":"9","author":"MJ Zaki","year":"2004","unstructured":"Zaki MJ (2004) Mining non-redundant association rules. Data Min Knowl Disc 9(3):223\u2013248","journal-title":"Data Min Knowl Disc"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01899-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-020-01899-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01899-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,28]],"date-time":"2021-09-28T00:04:01Z","timestamp":1632787441000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-020-01899-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,28]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["1899"],"URL":"https:\/\/doi.org\/10.1007\/s10489-020-01899-7","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,28]]},"assertion":[{"value":"28 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}