{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T03:21:59Z","timestamp":1778556119486,"version":"3.51.4"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,1,10]],"date-time":"2017-01-10T00:00:00Z","timestamp":1484006400000},"content-version":"unspecified","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":["61133005"],"award-info":[{"award-number":["61133005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61432005"],"award-info":[{"award-number":["61432005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61370095"],"award-info":[{"award-number":["61370095"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472124"],"award-info":[{"award-number":["61472124"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61202109"],"award-info":[{"award-number":["61202109"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472126"],"award-info":[{"award-number":["61472126"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"International Science and Technology Cooperation Program of China","award":["2015DFA11240"],"award-info":[{"award-number":["2015DFA11240"]}]},{"name":"International Science and Technology Cooperation Program of China","award":["2014DFBS0010"],"award-info":[{"award-number":["2014DFBS0010"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s10115-016-1020-2","type":"journal-article","created":{"date-parts":[[2017,1,10]],"date-time":"2017-01-10T13:12:17Z","timestamp":1484053937000},"page":"621-655","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["An efficient algorithm for mining top-k on-shelf high utility itemsets"],"prefix":"10.1007","volume":"52","author":[{"given":"Thu-Lan","family":"Dam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenli","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Fournier-Viger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quang-Huy","family":"Duong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,10]]},"reference":[{"key":"1020_CR1","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: VLDB, pp 487\u2013499"},{"key":"1020_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (1994) Quest synthetic data generator. http:\/\/www.almaden.ibm.com\/cs\/quest\/syndata.html","DOI":"10.1145\/191843.191972"},{"key":"1020_CR3","doi-asserted-by":"crossref","unstructured":"Chan R, Yang Q, Shen YD (2003) Mining high utility itemsets. In: Third IEEE international conference on data mining (ICDM 2003), pp 19\u201326","DOI":"10.1109\/ICDM.2003.1250893"},{"issue":"1","key":"1020_CR4","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s10844-013-0265-4","volume":"42","author":"H Chen","year":"2014","unstructured":"Chen H (2014) Mining top-k frequent patterns over data streams sliding window. J Intell Inf Syst 42(1):111\u2013131","journal-title":"J Intell Inf Syst"},{"issue":"1","key":"1020_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-007-0092-4","volume":"16","author":"J Cheng","year":"2008","unstructured":"Cheng J, Ke Y, Ng W (2008) A survey on algorithms for mining frequent itemsets over data streams. Knowl Inf Syst 16(1):1\u201327","journal-title":"Knowl Inf Syst"},{"issue":"9","key":"1020_CR6","doi-asserted-by":"crossref","first-page":"1052","DOI":"10.1109\/TKDE.2004.44","volume":"16","author":"YL Cheung","year":"2004","unstructured":"Cheung YL, Fu AC (2004) Mining frequent itemsets without support threshold: with and without item constraints. IEEE Trans Knowl Data Eng 16(9):1052\u20131069","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"7","key":"1020_CR7","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1016\/j.jss.2007.07.026","volume":"81","author":"CJ Chu","year":"2008","unstructured":"Chu CJ, Tseng VS, Liang T (2008) An efficient algorithm for mining temporal high utility itemsets from data streams. J Syst Softw 81(7):1105\u20131117","journal-title":"J Syst Softw"},{"issue":"2","key":"1020_CR8","first-page":"767","volume":"215","author":"CJ Chu","year":"2009","unstructured":"Chu CJ, Tseng VS, Liang T (2009) An efficient algorithm for mining high utility itemsets with negative item values in large databases. Appl Math Comput 215(2):767\u2013778","journal-title":"Appl Math Comput"},{"key":"1020_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-016-6245-4","author":"TL Dam","year":"2016","unstructured":"Dam TL, Li K, Fournier-Viger P, Duong OH (2016) CLS-Miner: efficient and effective closed high utility itemset mining. Front Comput Sci. doi: 10.1007\/s11704-016-6245-4","journal-title":"Front Comput Sci"},{"issue":"1","key":"1020_CR10","doi-asserted-by":"crossref","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":"1020_CR11","doi-asserted-by":"crossref","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":"1020_CR12","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P (2014) FHN: efficient mining of high-utility itemsets with negative unit profits. In: Advanced data mining and applications, lecture notes in computer science, vol 8933. Springer, Berlin, pp 16\u201329","DOI":"10.1007\/978-3-319-14717-8_2"},{"key":"1020_CR13","first-page":"3569","volume":"15","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger P, Gomariz A, Gueniche T, Soltani A, Wu CW, Tseng VS (2014) SPMF: a java open-source pattern mining library. J Mach Learn Res 15:3569\u20133573","journal-title":"J Mach Learn Res"},{"key":"1020_CR14","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Lin JCW, Gueniche T, Barhate P (2015) Efficient incremental high utility itemset mining. In: Proceedings of the ASE BigData & Social Informatics 2015, ASE BD & SI \u201915. ACM, New York, pp 53:1\u201353:6","DOI":"10.1145\/2818869.2818887"},{"key":"1020_CR15","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: Foundations of intelligent systems, lecture notes in computer science, vol 8502. Springer, Berlin, pp 83\u201392","DOI":"10.1007\/978-3-319-08326-1_9"},{"key":"1020_CR16","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Zida S (2015) FOSHU: faster on-shelf high utility itemset mining\u2014with or without negative unit profit. In: Proceedings of the 30th annual ACM symposium on applied computing, SAC \u201915. ACM, New York, pp 857\u2013864","DOI":"10.1145\/2695664.2695823"},{"key":"1020_CR17","unstructured":"Fu AWC, Kwong RWw, Tang J, (2000) Mining N-most interesting itemsets. In: Proceedings of the 12th international symposium on foundations of intelligent systems, ISMIS \u201900. Springer, London, pp 59\u201367"},{"key":"1020_CR18","doi-asserted-by":"crossref","unstructured":"Golab L, DeHaan D, Demaine ED, Lopez-Ortiz A, Munro JI (2003) Identifying frequent items in sliding windows over on-line packet streams. In: Proceedings of the 3rd ACM SIGCOMM conference on internet measurement, IMC \u201903. ACM, New York, pp 173\u2013178","DOI":"10.1145\/948205.948227"},{"issue":"10","key":"1020_CR19","doi-asserted-by":"crossref","first-page":"1347","DOI":"10.1109\/TKDE.2005.166","volume":"17","author":"G Grahne","year":"2005","unstructured":"Grahne G, Zhu JF (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":"1020_CR20","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J Han","year":"2007","unstructured":"Han J, Cheng H, Xin D, Yan X (2007) Frequent pattern mining: current status and future directions. Data Min Knowl Discov 15(1):55\u201386","journal-title":"Data Min Knowl Discov"},{"issue":"1","key":"1020_CR21","doi-asserted-by":"crossref","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 Discov 8(1):53\u201387","journal-title":"Data Min Knowl Discov"},{"issue":"24","key":"1020_CR22","doi-asserted-by":"crossref","first-page":"4958","DOI":"10.1016\/j.ins.2010.08.024","volume":"180","author":"N Homem","year":"2010","unstructured":"Homem N, Carvalho JP (2010) Finding top-k elements in data streams. Inf Sci 180(24):4958\u20134974","journal-title":"Inf Sci"},{"issue":"7","key":"1020_CR23","doi-asserted-by":"crossref","first-page":"3450","DOI":"10.1016\/j.eswa.2013.10.049","volume":"41","author":"GC Lan","year":"2014","unstructured":"Lan GC, Hong TP, Huang JP, Tseng VS (2014) On-shelf utility mining with negative item values. Expert Syst Appl 41(7):3450\u20133459","journal-title":"Expert Syst Appl"},{"issue":"5","key":"1020_CR24","doi-asserted-by":"crossref","first-page":"5851","DOI":"10.1016\/j.eswa.2010.11.040","volume":"38","author":"GC Lan","year":"2011","unstructured":"Lan GC, Hong TP, Tseng VS (2011) Discovery of high utility itemsets from on-shelf time periods of products. Expert Syst Appl 38(5):5851\u20135857","journal-title":"Expert Syst Appl"},{"issue":"1","key":"1020_CR25","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10115-012-0492-y","volume":"38","author":"GC Lan","year":"2014","unstructured":"Lan GC, Hong TP, Tseng VS (2014) An efficient projection-based indexing approach for mining high utility itemsets. Knowl Inf Syst 38(1):85\u2013107","journal-title":"Knowl Inf Syst"},{"issue":"3","key":"1020_CR26","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/s10115-010-0330-z","volume":"28","author":"HF Li","year":"2011","unstructured":"Li HF, Huang HY, Lee SY (2011) Fast and memory efficient mining of high-utility itemsets from data streams: with and without negative item profits. Knowl Inf Syst 28(3):495\u2013522","journal-title":"Knowl Inf Syst"},{"key":"1020_CR27","doi-asserted-by":"crossref","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"},{"key":"1020_CR28","doi-asserted-by":"crossref","unstructured":"Lin JW, Gan W, Hong TP (2016) Maintaining the discovered high-utility itemsets with transaction modification. Appl Intell 44(1):166\u2013178","DOI":"10.1007\/s10489-015-0697-3"},{"issue":"2","key":"1020_CR29","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1023\/B:DAMI.0000041128.59011.53","volume":"9","author":"G Liu","year":"2004","unstructured":"Liu G, Lu H, Lou W, Xu Y, Yu J (2004) Efficient mining of frequent patterns using ascending frequency ordered prefix-tree. Data Min Knowl Discov 9(2):249\u2013274","journal-title":"Data Min Knowl Discov"},{"key":"1020_CR30","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. ACM, New York, pp 55\u201364","DOI":"10.1145\/2396761.2396773"},{"key":"1020_CR31","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao W, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. In: Advances in knowledge discovery and data mining, lecture notes in computer science, vol 3518. Springer, Berlin, pp 689\u2013695","DOI":"10.1007\/11430919_79"},{"issue":"4","key":"1020_CR32","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/j.datak.2008.11.001","volume":"68","author":"N Manerikar","year":"2009","unstructured":"Manerikar N, Palpanas T (2009) Frequent items in streaming data: an experimental evaluation of the state-of-the-art. Data Knowl Eng 68(4):415\u2013430","journal-title":"Data Knowl Eng"},{"issue":"3","key":"1020_CR33","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1145\/1166074.1166084","volume":"31","author":"A Metwally","year":"2006","unstructured":"Metwally A, Agrawal D, Abbadi AE (2006) An integrated efficient solution for computing frequent and top-k elements in data streams. ACM Trans Database Syst 31(3):1095\u20131133","journal-title":"ACM Trans Database Syst"},{"key":"1020_CR34","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.knosys.2014.12.010","volume":"76","author":"H Ryang","year":"2015","unstructured":"Ryang H, Yun U (2015) Top-k high utility pattern mining with effective threshold raising strategies. Knowl Based Syst 76:109\u2013126","journal-title":"Knowl Based Syst"},{"key":"1020_CR35","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/j.eswa.2016.03.001","volume":"57","author":"H Ryang","year":"2016","unstructured":"Ryang H, Yun U (2016) High utility pattern mining over data streams with sliding window technique. Expert Syst Appl 57:214\u2013231","journal-title":"Expert Syst Appl"},{"issue":"1","key":"1020_CR36","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10115-010-0363-3","volume":"30","author":"A Salam","year":"2012","unstructured":"Salam A, Khayal M (2012) Mining top-k frequent patterns without minimum support threshold. Knowl Inf Syst 30(1):57\u201386","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"1020_CR37","doi-asserted-by":"crossref","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 Warehous Min 10(1):1\u201315","journal-title":"Int J Data Warehous Min"},{"issue":"1","key":"1020_CR38","doi-asserted-by":"crossref","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\u201343","journal-title":"Appl Intell"},{"key":"1020_CR39","doi-asserted-by":"crossref","unstructured":"Song W, Zhang Z, Li J (2016) A high utility itemset mining algorithm based on subsume index. Knowl Inf Syst 49(1):315\u2013340","DOI":"10.1007\/s10115-015-0900-1"},{"issue":"8","key":"1020_CR40","doi-asserted-by":"crossref","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":"1020_CR41","doi-asserted-by":"crossref","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":"5","key":"1020_CR42","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1109\/TKDE.2005.81","volume":"17","author":"JY Wang","year":"2005","unstructured":"Wang JY, Han JW, Lu Y, Tzvetkov P (2005) TFP: an efficient algorithm for mining top-k frequent closed itemsets. IEEE Trans Knowl Data Eng 17(5):652\u2013664","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"1020_CR43","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s10618-006-0042-x","volume":"13","author":"RCW Wong","year":"2006","unstructured":"Wong RCW, Fu AWC (2006) Mining top-k frequent itemsets from data streams. Data Min Knowl Discov 13(2):193\u2013217","journal-title":"Data Min Knowl Discov"},{"key":"1020_CR44","doi-asserted-by":"crossref","unstructured":"Wu CW, Shie BE, Tseng VS, 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. ACM, New York, pp 78\u201386","DOI":"10.1145\/2339530.2339546"},{"issue":"2","key":"1020_CR45","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10115-009-0211-5","volume":"23","author":"B Yang","year":"2010","unstructured":"Yang B, Huang H (2010) TOPSIL-Miner: an efficient algorithm for mining top-K significant itemsets over data streams. Knowl Inf Syst 23(2):225\u2013242","journal-title":"Knowl Inf Syst"},{"issue":"8","key":"1020_CR46","doi-asserted-by":"crossref","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":"1020_CR47","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. ACM, pp 326\u2013335","DOI":"10.1145\/956750.956788"},{"key":"1020_CR48","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":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-016-1020-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-016-1020-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-016-1020-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T17:23:26Z","timestamp":1692638606000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-016-1020-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,10]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["1020"],"URL":"https:\/\/doi.org\/10.1007\/s10115-016-1020-2","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,10]]}}}