{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T02:36:53Z","timestamp":1780627013678,"version":"3.54.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2017,9,15]],"date-time":"2017-09-15T00:00:00Z","timestamp":1505433600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Youth 1000"},{"name":"MUSED project at NTNU"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s10489-017-1057-2","type":"journal-article","created":{"date-parts":[[2017,9,14]],"date-time":"2017-09-14T18:07:46Z","timestamp":1505412466000},"page":"1859-1877","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":103,"title":["Efficient high utility itemset mining using buffered utility-lists"],"prefix":"10.1007","volume":"48","author":[{"given":"Quang-Huy","family":"Duong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philippe","family":"Fournier-Viger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Heri","family":"Ramampiaro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kjetil","family":"N\u00f8rv\u00e5g","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thu-Lan","family":"Dam","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,9,15]]},"reference":[{"key":"1057_CR1","unstructured":"Agrawal R, Srikan R (1994) Fast algorithms for mining association rules in large databases. In: Proceedings of 20th international conference on very large data bases (VLDB 1994). Morgan Kaufmann, pp 487\u2013499"},{"key":"1057_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (1994) Quest synthetic data generator. Available at. \n                    http:\/\/www.almaden.ibm.com\/cs\/quest\/syndata.html","DOI":"10.1145\/191843.191972"},{"issue":"12","key":"1057_CR3","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 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":"1057_CR4","unstructured":"Ahmed CF, Tanbeer SK, Jeong BS, Lee YK (2009) Efficient mining of utility-based web path traversal patterns. In: Proceedings of the 11th international conference on advanced communication technology - vol 3, ICACT\u201909, pp. 2215\u20132218"},{"key":"1057_CR5","doi-asserted-by":"crossref","unstructured":"Chan R, Yang Q, Shen YD (2003) Mining high utility itemsets. In: Proceedings of the 3rd IEEE international conference on data mining, pp 19\u201326","DOI":"10.1109\/ICDM.2003.1250893"},{"issue":"1","key":"1057_CR6","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/s10489-015-0748-9","volume":"45","author":"TL Dam","year":"2016","unstructured":"Dam TL, Li K, Fournier-Viger P, Duong QH (2016) An efficient algorithm for mining top-rank-k frequent patterns. Appl Intell 45(1):96\u2013111","journal-title":"Appl Intell"},{"key":"1057_CR7","unstructured":"Dam TL, Li K, Fournier-Viger P, Duong QH (2017) CLS-Miner: efficient and effective closed high utility itemset mining. Frontiers of Computer Science, pp 1\u201327"},{"key":"1057_CR8","doi-asserted-by":"crossref","unstructured":"Dam TL, Li K, Fournier-Viger P, Duong QH (2017) An efficient algorithm for mining top-k on-shelf high utility itemsets. Knowl Inf Syst 52(3):621\u2013655","DOI":"10.1007\/s10115-016-1020-2"},{"key":"1057_CR9","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.knosys.2016.04.016","volume":"104","author":"QH Duong","year":"2016","unstructured":"Duong QH, Liao B, Fournier-Viger P, Dam TL (2016) An efficient algorithm for mining the top-k high utility itemsets, using novel threshold raising and pruning strategies. Knowl-Based Syst 104:106\u2013122","journal-title":"Knowl-Based Syst"},{"key":"1057_CR10","first-page":"3569","volume":"15","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger P, Gomariz A, Gueniche T, Soltani A, Wu CW, Tseng V (2014) SPMF: A java open-source pattern mining library. J Mach Learn Res 15:3569\u20133573","journal-title":"J Mach Learn Res"},{"key":"1057_CR11","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Lin JC, Duong Q, Dam T (2016) FHM+: Faster high-utility itemset mining using length upper-bound reduction. In: Proceedings of the 29th international conference on industrial engineering and other applications of applied intelligent systems, pp 115\u2013127","DOI":"10.1007\/978-3-319-42007-3_11"},{"key":"1057_CR12","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Lin JCW, Duong QH, Dam TL (2016) PHM: Mining periodic high-utility itemsets. In: Proceedings of the 16th industrial conference on data mining. Springer, pp 64\u201379. Springer","DOI":"10.1007\/978-3-319-41561-1_6"},{"key":"1057_CR13","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Wu CW, Zida S, Tseng V (2014) FHM: Faster high-utility itemset mining using estimated utility co-occurrence pruning. In: Proceedings of the 21st international symposium on methodologies for intelligent systems, pp 83\u201392","DOI":"10.1007\/978-3-319-08326-1_9"},{"key":"1057_CR14","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Zida S (2015) FOSHU: Faster on-shelf high utility itemset mining \u2013 with or without negative unit profit. In: Proceedings of the 30th annual ACM symposium on applied computing, SAC \u201915, pp 857\u2013864","DOI":"10.1145\/2695664.2695823"},{"issue":"10","key":"1057_CR15","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"},{"key":"1057_CR16","unstructured":"Han J, Wang J, Lu Y, Tzvetkov P (2002) Mining top-k frequent closed patterns without minimum support. In: Proceedings of the IEEE international conference on data mining, pp 211\u2013218"},{"issue":"1","key":"1057_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"JW Han","year":"2004","unstructured":"Han JW, Pei J, Yin YW (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":"1057_CR18","doi-asserted-by":"crossref","unstructured":"Joshi M, Bhalodia D (2016) Mining high utility itemset using graphics processor. In: Proceedings of the international symposium on intelligent systems technologies and applications, pp 665\u2013674","DOI":"10.1007\/978-3-319-47952-1_53"},{"issue":"5","key":"1057_CR19","doi-asserted-by":"publisher","first-page":"2371","DOI":"10.1016\/j.eswa.2014.11.001","volume":"42","author":"S Krishnamoorthy","year":"2015","unstructured":"Krishnamoorthy S (2015) Pruning strategies for mining high utility itemsets. Expert Syst Appl 42(5):2371\u20132381","journal-title":"Expert Syst Appl"},{"issue":"1","key":"1057_CR20","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10115-012-0492-y","volume":"38","author":"GC Lan","year":"2014","unstructured":"Lan GC, Hong TP, Tseng V (2014) An efficient projection-based indexing approach for mining high utility itemsets. Knowl Inf Syst 38(1):85\u2013107","journal-title":"Knowl Inf Syst"},{"key":"1057_CR21","doi-asserted-by":"crossref","unstructured":"Lee S, Park JS (2016) Top-k high utility itemset mining based on utility-list structures. In: Proceedings of the international conference on big data and smart computing, pp 101\u2013108","DOI":"10.1109\/BIGCOMP.2016.7425807"},{"key":"1057_CR22","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.knosys.2015.12.019","volume":"96","author":"JCW Lin","year":"2016","unstructured":"Lin JCW, Gan W, Fournier-Viger P, Hong TP, Tseng V (2016) Efficient algorithms for mining high-utility itemsets in uncertain databases. Knowl-Based Syst 96:171\u2013187","journal-title":"Knowl-Based Syst"},{"key":"1057_CR23","doi-asserted-by":"crossref","unstructured":"Liu M, Qu J (2012) Mining high utility itemsets without candidate generation. In: Proceedings of the 21st ACM international conference on information and knowledge management, CIKM \u201912, pp 55\u201364","DOI":"10.1145\/2396761.2396773"},{"key":"1057_CR24","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao WK, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. In: Proceedings of the 9th pacific-asia conference on advances in knowledge discovery and data mining, PAKDD\u201905, pp 689\u2013695","DOI":"10.1007\/11430919_79"},{"key":"1057_CR25","doi-asserted-by":"crossref","unstructured":"Sahoo J, Das AK, Goswami A (2016) An efficient fast algorithm for discovering closed+ high utility itemsets. Appl Intell 45(1):44\u201374","DOI":"10.1007\/s10489-015-0740-4"},{"issue":"1","key":"1057_CR26","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 (2014) BAHUI: Fast and memory efficient mining of high utility itemsets based on bitmap. Int J Data Warehouse Min 10(1):1\u201315","journal-title":"Int J Data Warehouse Min"},{"issue":"1","key":"1057_CR27","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 (2014) Mining high utility itemsets by dynamically pruning the tree structure. Appl Intell 40(1):29\u2013 43","journal-title":"Appl Intell"},{"issue":"1","key":"1057_CR28","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10115-015-0900-1","volume":"49","author":"W Song","year":"2016","unstructured":"Song W, Zhang Z, Li J (2016) A high utility itemset mining algorithm based on subsume index. Knowl Inf Syst 49(1):315\u2013 340","journal-title":"Knowl Inf Syst"},{"key":"1057_CR29","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1016\/j.protcy.2012.10.053","volume":"6","author":"M Thilagu","year":"2012","unstructured":"Thilagu M, Nadarajan R (2012) Efficiently mining of effective web traversal patterns with average utility. Procedia Technol 6:444\u2013451","journal-title":"Procedia Technol"},{"issue":"8","key":"1057_CR30","doi-asserted-by":"publisher","first-page":"1772","DOI":"10.1109\/TKDE.2012.59","volume":"25","author":"V Tseng","year":"2013","unstructured":"Tseng V, Shie BE, Wu CW, Yu P (2013) Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans Knowl Data Eng 25(8):1772\u20131786","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"1057_CR31","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 (2016) Efficient algorithms for mining top-k high utility itemsets. IEEE Trans Knowl Data Eng 28(1):54\u201367","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"1057_CR32","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s10115-015-0914-8","volume":"49","author":"JZ Wang","year":"2016","unstructured":"Wang JZ, Huang JL, Chen YC (2016) On efficiently mining high utility sequential patterns. Knowl Inf Syst 49(2):597\u2013627","journal-title":"Knowl Inf Syst"},{"key":"1057_CR33","unstructured":"Wu CW, Fournier-Viger P, Gu JY, Tseng V (2015) Mining closed+ high utility itemsets without candidate generation. In: 2015 conference on technologies and applications of artificial intelligence (TAAI), pp 187\u2013194"},{"key":"1057_CR34","unstructured":"Wu CW, Shie BE, Tseng V, Yu PS (2012) Mining top-k high utility itemsets. In: Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201912, pp 78\u201386"},{"key":"1057_CR35","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1186\/1471-2105-14-230","volume":"14","author":"Y-C Liu","year":"2013","unstructured":"Liu Y-C, Cheng C-P, Tseng V (2013) Mining differential top-k co-expression patterns from time course comparative gene expression datasets. BMC Bioinformatics 14:230","journal-title":"BMC Bioinformatics"},{"key":"1057_CR36","doi-asserted-by":"crossref","unstructured":"Yun U, Ryang H, Lee G, Fujita H (2017) An efficient algorithm for mining high utility patterns from incremental databases with one database scan. Knowl-Based Syst 124:188\u2013206","DOI":"10.1016\/j.knosys.2017.03.016"},{"issue":"8","key":"1057_CR37","doi-asserted-by":"publisher","first-page":"3861","DOI":"10.1016\/j.eswa.2013.11.038","volume":"41","author":"U Yun","year":"2014","unstructured":"Yun U, Ryang H, Ryu KH (2014) High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates. Expert Syst Appl 41(8):3861\u20133878","journal-title":"Expert Syst Appl"},{"key":"1057_CR38","unstructured":"Zaki MJ, Gouda K (2003) Fast vertical mining using diffsets. In: Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining, pp 326\u2013335"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-017-1057-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-017-1057-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-017-1057-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,3]],"date-time":"2020-03-03T07:23:25Z","timestamp":1583220205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-017-1057-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,15]]},"references-count":38,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["1057"],"URL":"https:\/\/doi.org\/10.1007\/s10489-017-1057-2","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,15]]},"assertion":[{"value":"15 September 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}