{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T11:14:14Z","timestamp":1781003654758,"version":"3.54.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s11704-016-6245-4","type":"journal-article","created":{"date-parts":[[2018,3,28]],"date-time":"2018-03-28T12:37:12Z","timestamp":1522240632000},"page":"357-381","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":63,"title":["CLS-Miner: efficient and effective closed high-utility itemset mining"],"prefix":"10.1007","volume":"13","author":[{"given":"Thu-Lan","family":"Dam","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kenli","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philippe","family":"Fournier-Viger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Quang-Huy","family":"Duong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,4,11]]},"reference":[{"key":"6245_CR1","first-page":"487","volume-title":"Proceedings of the 20th International Conference on Very Large Data Bases","author":"R Agrawal","year":"1994","unstructured":"Agrawal R, Srikant R. Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases. 1994, 487\u2013499"},{"key":"6245_CR2","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/956750.956788","volume-title":"Proceedings of the 9th ACMSIGKDD International Conference on Knowledge Discovery and Data Mining","author":"MJ Zaki","year":"2003","unstructured":"Zaki MJ, Gouda K. Fast vertical mining using diffsets. In: Proceedings of the 9th ACMSIGKDD International Conference on Knowledge Discovery and Data Mining. 2003, 326\u2013335"},{"issue":"1","key":"6245_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J W Han","year":"2004","unstructured":"Han J W, Pei J, Yin Y W. Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Mining and Knowledge Discovery, 2004, 8(1): 53\u201387","journal-title":"Data Mining and Knowledge Discovery"},{"key":"6245_CR4","first-page":"211","volume-title":"Proceedings of IEEE International Conference on Data Mining","author":"J Han","year":"2002","unstructured":"Han J, Wang J, Lu Y, Tzvetkov P. Mining top-k frequent closed patterns without minimum support. In: Proceedings of IEEE International Conference on Data Mining. 2002, 211\u2013218"},{"issue":"10","key":"6245_CR5","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. Fast algorithms for frequent itemset mining using fptrees. IEEE Transactions on Knowledge and Data Engineering, 2005, 17(10): 1347\u20131362","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"13","key":"6245_CR6","doi-asserted-by":"publisher","first-page":"5424","DOI":"10.1016\/j.eswa.2015.03.004","volume":"42","author":"Z H Deng","year":"2015","unstructured":"Deng Z H, Lv S L. PrePost+: an efficient N-lists-based algorithm for mining frequent itemsets via children-parent equivalence pruning. Expert Systems with Applications, 2015, 42(13): 5424\u20135432","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"6245_CR7","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/s10489-015-0748-9","volume":"45","author":"T L Dam","year":"2016","unstructured":"Dam T L, Li K, Fournier-Viger P, Duong Q H. An efficient algorithm for mining top-rank-k frequent patterns. Applied Intelligence, 2016, 45(1): 96\u2013111","journal-title":"Applied Intelligence"},{"key":"6245_CR8","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/11430919_79","volume-title":"Proceedings of Pacific-Asia Conference on Knowledge Discovery and Data Mining","author":"Y Liu","year":"2005","unstructured":"Liu Y, Liao WK, Choudhary A. A two-phase algorithm for fast discovery of high utility itemsets. In: Proceedings of Pacific-Asia Conference on Knowledge Discovery and Data Mining. 2005, 689\u2013695"},{"key":"6245_CR9","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1145\/2396761.2396773","volume-title":"Proceedings of the 21st ACM International Conference on Information and Knowledge Management","author":"M Liu","year":"2012","unstructured":"Liu M, Qu J. Mining high utility itemsets without candidate generation. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management. 2012, 55\u201364"},{"issue":"8","key":"6245_CR10","doi-asserted-by":"publisher","first-page":"1772","DOI":"10.1109\/TKDE.2012.59","volume":"25","author":"V Tseng","year":"2013","unstructured":"Tseng V, Shie B E, Wu C W, Yu P. Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Transactions on Knowledge and Data Engineering, 2013, 25(8): 1772\u20131786","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"6245_CR11","first-page":"83","volume-title":"Proceedings of International Symposium on Methodologies for Intelligent Systems","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger P, Wu C W, Zida S, Tseng V. FHM: faster high-utility itemset mining using estimated utility co-occurrence pruning. In: Proceedings of International Symposium on Methodologies for Intelligent Systems. 2014, 83\u201392"},{"issue":"1","key":"6245_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/ijdwm.2014010101","volume":"10","author":"W Song","year":"2014","unstructured":"Song W, Liu Y, Li J. BAHUI: fast and memory efficient mining of high utility itemsets based on bitmap. International Journal of Data Warehousing and Mining, 2014, 10(1): 1\u201315","journal-title":"International Journal of Data Warehousing and Mining"},{"key":"6245_CR13","first-page":"1","volume-title":"Knowledge and Information Systems","author":"W Song","year":"2015","unstructured":"Song W, Zhang Z, Li J. A high utility itemset mining algorithm based on subsume index. Knowledge and Information Systems, 2015, 1\u201326"},{"key":"6245_CR14","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.knosys.2016.04.016","volume":"104","author":"Q H Duong","year":"2016","unstructured":"Duong Q H, Liao B, Fournier-Viger P, Dam T L. An efficient algorithm for mining the top-k high utility itemsets, using novel threshold raising and pruning strategies. Knowledge-Based Systems, 2016, 104: 106\u2013122","journal-title":"Knowledge-Based Systems"},{"issue":"12","key":"6245_CR15","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1109\/TKDE.2009.46","volume":"21","author":"C Ahmed","year":"2009","unstructured":"Ahmed C, Tanbeer S, Jeong B S, Lee Y K. Efficient tree structures for high utility pattern mining in incremental databases. IEEE Transactions on Knowledge and Data Engineering, 2009, 21(12): 1708\u20131721","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"3","key":"6245_CR16","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/s11704-010-0102-7","volume":"4","author":"Q Yang","year":"2010","unstructured":"Yang Q. Three challenges in data mining. Frontiers of Computer Science in China, 2010, 4(3): 324\u2013333","journal-title":"Frontiers of Computer Science in China"},{"issue":"4","key":"6245_CR17","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1109\/TPDS.2016.2603511","volume":"28","author":"J Chen","year":"2017","unstructured":"Chen J, Li K, Tang Z, Bilal K, Yu S, Weng C, Li K. A parallel random forest algorithm for big data in a spark cloud computing environment. IEEE Transactions on Parallel and Distributed Systems, 2017, 28(4): 919\u2013933","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"1","key":"6245_CR18","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10489-013-0443-7","volume":"40","author":"W Song","year":"2014","unstructured":"Song W, Liu Y, Li J. Mining high utility itemsets by dynamically pruning the tree structure. Applied Intelligence, 2014, 40(1): 29\u201343","journal-title":"Applied Intelligence"},{"key":"6245_CR19","unstructured":"Fournier-Viger P, Lin J C W, Duong Q H, Dam T L. In: Fujita H, Ali M, Selamat A, et al, eds. FHM+: Faster High-Utility Itemset Mining Using Length Upper-Bound Reduction. Cham: Springer International Publishing, 2016, 115\u2013127"},{"issue":"3","key":"6245_CR20","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1109\/TKDE.2014.2345377","volume":"27","author":"V S Tseng","year":"2015","unstructured":"Tseng V S, Wu C W, Fournier-Viger P, Yu P S. Efficient algorithms for mining the concise and lossless representation of high utility itemsets. IEEE Transactions on Knowledge and Data Engineering, 2015, 27(3): 726\u2013739","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"6245_CR21","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N Pasquier","year":"1999","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L. Efficient mining of association rules using closed itemset lattices. Information Systems, 1999, 24(1): 25\u201346","journal-title":"Information Systems"},{"issue":"1","key":"6245_CR22","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. Fast and memory efficient mining of frequent closed itemsets. IEEE Transactions on Knowledge and Data Engineering, 2006, 18(1): 21\u201336","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"4","key":"6245_CR23","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TKDE.2005.60","volume":"17","author":"M J Zaki","year":"2005","unstructured":"Zaki M J, Hsiao C J. Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Transactions on Knowledge and Data Engineering, 2005, 17(4): 462\u2013478","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"6245_CR24","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/978-3-319-14717-8_2","volume-title":"Proceedings of International Conference on Advanced Data Mining and Applications","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger P. FHN: efficient mining of high-utility itemsets with negative unit profits. In: Proceedings of International Conference on Advanced Data Mining and Applications. 2014, 16\u201329"},{"issue":"1","key":"6245_CR25","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TKDE.2015.2458860","volume":"28","author":"V Tseng","year":"2016","unstructured":"Tseng V, Wu CW, Fournier-Viger P, Yu P. Efficient algorithms for mining top-k high utility itemsets. IEEE Transactions on Knowledge and Data Engineering, 2016, 28(1): 54\u201367","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"6245_CR26","first-page":"187","volume-title":"Proceedings of Conference on Technologies and Applications of Artificial Intelligence","author":"C W Wu","year":"2015","unstructured":"Wu C W, Fournier-Viger P, Gu J Y, Tseng V S. Mining closed+ high utility itemsets without candidate generation. In: Proceedings of Conference on Technologies and Applications of Artificial Intelligence. 2015, 187\u2013194"},{"key":"6245_CR27","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1109\/ICDM.2003.1250893","volume-title":"Proceedings of the 3rd IEEE International Conference on Data Mining","author":"R Chan","year":"2003","unstructured":"Chan R, Yang Q, Shen Y D. Mining high utility itemsets. In: Proceedings of the 3rd IEEE International Conference on Data Mining. 2003, 19\u201326"},{"issue":"1","key":"6245_CR28","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10115-012-0492-y","volume":"38","author":"G C Lan","year":"2014","unstructured":"Lan G C, Hong T P, Tseng V S. An efficient projection-based indexing approach for mining high utility itemsets. Knowledge and Information Systems, 2014, 38(1): 85\u2013107","journal-title":"Knowledge and Information Systems"},{"issue":"3","key":"6245_CR29","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10618-005-0002-x","volume":"11","author":"K Gouda","year":"2005","unstructured":"Gouda K, Zaki M J. Genmax: An efficient algorithm for mining maximal frequent itemsets. Data Mining and Knowledge Discovery, 2005, 11(3): 223\u2013242","journal-title":"Data Mining and Knowledge Discovery"},{"key":"6245_CR30","volume-title":"Proceedings of IEEE ICDM Workshop on Frequent Itemset Mining Implementations","author":"T Uno","year":"2004","unstructured":"Uno T, Kiyomi M, Arimura H. LCMver. 2: efficient mining algorithms for frequent\/closed\/maximal itemsets. In: Proceedings of IEEE ICDM Workshop on Frequent Itemset Mining Implementations. 2004"},{"issue":"1\u20132","key":"6245_CR31","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s10472-013-9372-8","volume":"70","author":"L Szathmary","year":"2014","unstructured":"Szathmary L, Valtchev P, Napoli A, Godin R, Boc A, Makarenkov V. A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes. Annals of Mathematics and Artificial Intelligence, 2014, 70(1\u20132): 81\u2013105","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"6245_CR32","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/978-3-319-14717-8_3","volume-title":"Proceedings of the International Conference on Advanced Data Mining and Applications","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger P, Wu C W, Tseng V S. Novel concise representations of high utility itemsets using generator patterns. In: Proceedings of the International Conference on Advanced Data Mining and Applications. 2014, 30\u201343"},{"issue":"17","key":"6245_CR33","doi-asserted-by":"publisher","first-page":"12947","DOI":"10.1016\/j.eswa.2012.05.035","volume":"39","author":"B E Shie","year":"2012","unstructured":"Shie B E, Philip S Y, Tseng V S. Efficient algorithms for mining maximal high utility itemsets from data streams with different models. Expert Systems with Applications, 2012, 39(17): 12947\u201312960","journal-title":"Expert Systems with Applications"},{"key":"6245_CR34","first-page":"398","volume-title":"Proceedings of the International Conference on Database Theory","author":"N Pasquier","year":"1999","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L. Discovering frequent closed itemsets for association rules. In: Proceedings of the International Conference on Database Theory. 1999, 398\u2013416"},{"key":"6245_CR35","first-page":"3569","volume":"15","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger P, Gomariz A, Gueniche T, Soltani A, Wu C W, Tseng V S. SPMF: a Java open-source pattern mining library. Journal of Machine Learning Research, 2014, 15: 3569\u20133573","journal-title":"Journal of Machine Learning Research"},{"key":"6245_CR36","volume-title":"NU-MineBench 2.0. CUCIS Technical Report CUCIS-2005-08-01","author":"J Pisharath","year":"2005","unstructured":"Pisharath J, Liu Y, Liao W K, Choudhary A, Memik G, Parhi J. NU-MineBench 2.0. CUCIS Technical Report CUCIS-2005-08-01. 2005"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-016-6245-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11704-016-6245-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-016-6245-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T20:45:54Z","timestamp":1693601154000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11704-016-6245-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["6245"],"URL":"https:\/\/doi.org\/10.1007\/s11704-016-6245-4","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4]]},"assertion":[{"value":"28 April 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}