{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T23:26:09Z","timestamp":1771543569111,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,3,11]],"date-time":"2017-03-11T00:00:00Z","timestamp":1489190400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Natural Science Foundation of China (CN)","award":["61503092"],"award-info":[{"award-number":["61503092"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s10489-017-0896-1","type":"journal-article","created":{"date-parts":[[2017,3,11]],"date-time":"2017-03-11T03:54:53Z","timestamp":1489204493000},"page":"331-346","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["A fast algorithm for mining high average-utility itemsets"],"prefix":"10.1007","volume":"47","author":[{"given":"Jerry Chun-Wei","family":"Lin","sequence":"first","affiliation":[]},{"given":"Shifeng","family":"Ren","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Fournier-Viger","sequence":"additional","affiliation":[]},{"given":"Tzung-Pei","family":"Hong","sequence":"additional","affiliation":[]},{"given":"Ja-Hwung","family":"Su","sequence":"additional","affiliation":[]},{"given":"Bay","family":"Vo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,11]]},"reference":[{"key":"896_CR1","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: International conference on very large data bases, pp 487\u2013499"},{"key":"896_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"},{"issue":"12","key":"896_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, 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":"896_CR4","unstructured":"Eltabakh MY, Ouzzani M, Khalil MA, Aref WG, Elmagarmid AK (2008) Incremental mining for frequent patterns in evolving time series datatabases. Computer Science Technical Reports 1707"},{"key":"896_CR5","doi-asserted-by":"crossref","unstructured":"Erwin A, Gopalan RP, Achuthan NR (2008) Efficient mining of high utility itemsets from large datasets. In: The Pacific-Asia conference on advances in knowledge discovery and data mining, pp 554\u2013561","DOI":"10.1007\/978-3-540-68125-0_50"},{"issue":"2","key":"896_CR6","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1109\/69.683753","volume":"10","author":"MS Chen","year":"1998","unstructured":"Chen MS, Park JS, Yu PS (1998) Efficient data mining for path traversal patterns. IEEE Trans Knowl Data Eng 10(2):209\u2013221","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"896_CR7","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Wu CW, Zida S, Tseng VS (2014) FHM: faster high-utility itemset mining using estimated utility co-occurrence pruning. In: International symposium on methodologies for intelligent systems, pp 83\u201392","DOI":"10.1007\/978-3-319-08326-1_9"},{"key":"896_CR8","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/978-3-319-46131-1_8","volume":"9853","author":"P Fournier-Viger","year":"2016","unstructured":"Fournier-Viger P, Lin JCW, Gomariz A, Gueniche T, Soltani A, Deng Z, Lam HT (2016) The SPMF open-source data mining library version 2. Lect Notes Comput Sci 9853:36\u201340","journal-title":"Lect Notes Comput Sci"},{"key":"896_CR9","unstructured":"Grahne G, Zhu J (2003) Efficiently using prefix-trees in mining frequent itemsets. In: IEEE ICDM workshop on frequent itemset mining"},{"key":"896_CR10","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:53\u201387","journal-title":"Data Min Knowl Disc"},{"issue":"7","key":"896_CR11","doi-asserted-by":"crossref","first-page":"8259","DOI":"10.1016\/j.eswa.2011.01.006","volume":"38","author":"TP Hong","year":"2011","unstructured":"Hong TP, Lee CH, Wang SL (2011) Effective utility mining with the measure of average utility. Expert Syst Appl 38(7):8259\u20138265","journal-title":"Expert Syst Appl"},{"issue":"5","key":"896_CR12","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1142\/S0219622012500307","volume":"11","author":"GC Lan","year":"2012","unstructured":"Lan GC, Hong TP, Tseng VS (2012) Efficiently mining high average-utility itemsets with an improved upper-bound. Int J Inf Technol Decis Mak 11(5):1009\u20131030","journal-title":"Int J Inf Technol Decis Mak"},{"issue":"1","key":"896_CR13","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.datak.2007.06.009","volume":"64","author":"YC Li","year":"2008","unstructured":"Li YC, Yeh JS, Chang CC (2008) Isolated items discarding strategy for discovering high utility itemsets. Data Knowl Eng 64(1):198\u2013217","journal-title":"Data Knowl Eng"},{"key":"896_CR14","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao W, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. In: The Pacific Asia knowledge discovery and data mining, pp 689\u2013695","DOI":"10.1007\/11430919_79"},{"key":"896_CR15","doi-asserted-by":"crossref","unstructured":"Lin CW, Hong TP, Lu WH (2010) Efficiently mining high average utility itemsets with a tree structure. In: The Asian conference on intelligent information and database systems, pp 131\u2013139","DOI":"10.1007\/978-3-642-12145-6_14"},{"key":"896_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ins.2012.05.015","volume":"215","author":"MY Lin","year":"2012","unstructured":"Lin MY, Tu TF, Hsueh SC (2012) High utility pattern mining using the maximal itemset property and lexicographic tree structures. Inf Sci 215:1\u201314","journal-title":"Inf Sci"},{"issue":"12","key":"896_CR17","doi-asserted-by":"crossref","first-page":"5303","DOI":"10.1016\/j.eswa.2015.02.022","volume":"42","author":"YF Lin","year":"2015","unstructured":"Lin YF, Wu CW, Huang CF, Tseng VS (2015) Discovering utility-based episode rules in complex event sequences. Expert Syst Appl 42(12):5303\u20135314","journal-title":"Expert Syst Appl"},{"issue":"2","key":"896_CR18","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.aei.2016.04.002","volume":"30","author":"JCW Lin","year":"2016","unstructured":"Lin JCW, Li T, Fournier-Viger P, Hong TP, Zhan J, Voznak M (2016) An efficient algorithm to mine high average-utility itemsets. Adv Eng Inform 30(2):233\u2013243","journal-title":"Adv Eng Inform"},{"key":"896_CR19","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao WK, Choudhary A (2005) A fast high utility itemsets mining algorithm. In: The international workshop on utility-based data mining, pp 90\u201399","DOI":"10.1145\/1089827.1089839"},{"key":"896_CR20","doi-asserted-by":"crossref","unstructured":"Liu M, Qu J (2012) Mining high utility itemsets without candidate generation. In: ACM international conference on information and knowledge management, pp 55\u201364","DOI":"10.1145\/2396761.2396773"},{"issue":"5","key":"896_CR21","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1109\/TKDE.2015.2510012","volume":"25","author":"J Liu","year":"2016","unstructured":"Liu J, Wang K, Fung BCM (2016) Mining high utility patterns in one phase without generating candidates. IEEE Trans Knowl Data Eng 25(5):1245\u20131257","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"896_CR22","doi-asserted-by":"crossref","unstructured":"Lu T, Vo B, Nguyen HT, Hong TP (2014) A new method for mining high average utility itemsets. Lect Notes Comput Sci:33\u201342","DOI":"10.1007\/978-3-662-45237-0_5"},{"issue":"1","key":"896_CR23","doi-asserted-by":"crossref","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":"896_CR24","unstructured":"Pei J, Han J, Mao R (2000) CLOSET: an efficient algorithm for mining frequent closed itemsets. In: ACM SIGMOD workshop on research issues in data mining and knowledge discovery, pp 21\u2013 30"},{"key":"896_CR25","doi-asserted-by":"crossref","unstructured":"Tanbeer SK, Ahmed CF, Jeong BS, Lee YK (2008) Efficient frequent pattern mining over data streams. In: ACM conference on information and knowledge management, pp 1447\u2013 1448","DOI":"10.1145\/1458082.1458326"},{"key":"896_CR26","doi-asserted-by":"crossref","unstructured":"Yao H, Hamilton HJ, Butz CJ (2004) A foundational approach to mining itemset utilities from databases. In: SIAM international conference on data mining, pp 482\u2013486","DOI":"10.1137\/1.9781611972740.51"},{"key":"896_CR27","unstructured":"Yao H, Hamilton HJ, Geng L (2006) A unified framework for utility based measures for mining itemsets. In: The international workshop on utility-based data mining, pp 27\u201328"},{"key":"896_CR28","doi-asserted-by":"crossref","unstructured":"Yen SJ, Lee YS (2007) Mining high utility quantitative association rules. International Conference on Big Data Analytics and Knowledge Discovery, pp 283\u2013292","DOI":"10.1007\/978-3-540-74553-2_26"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-017-0896-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-017-0896-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-017-0896-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T16:25:24Z","timestamp":1568910324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-017-0896-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,11]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["896"],"URL":"https:\/\/doi.org\/10.1007\/s10489-017-0896-1","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,11]]}}}