{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:30:53Z","timestamp":1775010653508,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,2,14]],"date-time":"2017-02-14T00:00:00Z","timestamp":1487030400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s10489-016-0890-z","type":"journal-article","created":{"date-parts":[[2017,2,14]],"date-time":"2017-02-14T06:49:21Z","timestamp":1487054961000},"page":"114-131","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":41,"title":["Efficient algorithm for mining high average-utility itemsets in incremental transaction databases"],"prefix":"10.1007","volume":"47","author":[{"given":"Donggyu","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Unil","family":"Yun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,14]]},"reference":[{"key":"890_CR1","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: 20th international conference on very large data bases, pp 487\u2013499"},{"issue":"12","key":"890_CR2","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 B, Lee Y (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":"890_CR3","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1080\/10556789208805504","volume":"1","author":"KP Bennett","year":"1992","unstructured":"Bennett KP, Mangasarian OL (1992) Robust linear programming discrimination of two linearly inseparable sets. Optim Methods Software 1:23\u201334","journal-title":"Optim Methods Software"},{"key":"890_CR4","unstructured":"Cheung DW, Han J, Ng VT, Wong CY (1996) Maintenance of discovered association rules in large databases: an incremental updating approach. In: The 12th IEEE international conference on data engineering, pp 106\u2013114"},{"key":"890_CR5","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.knosys.2016.04.016","volume":"104","author":"Q Duong","year":"2016","unstructured":"Duong Q, Liao B, Fournier-Viger P, Dam T (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":"890_CR6","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Wu C, Zida S, Tseng V (2014) FHM: faster high-utility itemset mining using estimated utility co-occurrence pruning. In: ISMIS, pp 83\u201392","DOI":"10.1007\/978-3-319-08326-1_9"},{"key":"890_CR7","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.eswa.2016.01.002","volume":"52","author":"Y Fan","year":"2016","unstructured":"Fan Y, Ye Y, Chen L (2016) Malicious sequential pattern mining for automatic malware detection. Expert Syst Appl 52:16\u201325","journal-title":"Expert Syst Appl"},{"key":"890_CR8","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Proceedings of the 2000 ACM SIGMOD international conference on management of data, pp 1\u201312","DOI":"10.1145\/342009.335372"},{"issue":"7","key":"890_CR9","doi-asserted-by":"crossref","first-page":"8259","DOI":"10.1016\/j.eswa.2011.01.006","volume":"38","author":"T Hong","year":"2011","unstructured":"Hong T, Lee C, Wang S (2011) Effective utility mining with the measure of average utility. Expert Syst Appl 38(7):8259\u20138265","journal-title":"Expert Syst Appl"},{"key":"890_CR10","doi-asserted-by":"crossref","unstructured":"Hong T, Lee C, Wang S (2009) An incremental mining algorithm for high average-utility itemsets. In: ISPAN 2009, pp 421\u2013425","DOI":"10.1109\/I-SPAN.2009.24"},{"key":"890_CR11","unstructured":"Koh J, Shieh S (2003) An efficient approach for maintaining association rules based on adjusting FP-tree structures. In: DASFAA, pp 417\u2013424"},{"issue":"5","key":"890_CR12","doi-asserted-by":"crossref","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":"890_CR13","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/s10489-015-0750-2","volume":"45","author":"D Kim","year":"2016","unstructured":"Kim D, Yun U (2016) Efficient mining of high utility pattern with considering of rarity and length. Appl Intell 45(1):152\u2013173","journal-title":"Appl Intell"},{"issue":"5","key":"890_CR14","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.3233\/IDA-160861","volume":"20","author":"D Kim","year":"2016","unstructured":"Kim D, Yun U (2016) Mining high utility itemsets based on the time decaying model. Intell Data Anal 20 (5):1157\u20131180","journal-title":"Intell Data Anal"},{"key":"890_CR15","first-page":"193","volume":"28","author":"G Lan","year":"2012","unstructured":"Lan G, Hong T, Tseng V (2012) A projection-based approach for discovering high average-utility itemsets. J Inf Sci Eng 28:193\u2013209","journal-title":"J Inf Sci Eng"},{"issue":"5","key":"890_CR16","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1142\/S0219622012500307","volume":"11","author":"G Lan","year":"2012","unstructured":"Lan G, Hong T, Tseng V (2012) Efficiently mining high average-utility itemsets with an improved upper-bound strategy. Int J Inf Technol Decis Making 11(5):1009\u20131030","journal-title":"Int J Inf Technol Decis Making"},{"issue":"19","key":"890_CR17","doi-asserted-by":"crossref","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"},{"issue":"2","key":"890_CR18","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1016\/j.eswa.2013.07.094","volume":"41","author":"G Lee","year":"2014","unstructured":"Lee G, Yun U, Ryu K (2014) Sliding window based weighted maximal frequent pattern mining over data streamss. Expert Syst Appl 41(2):694\u2013708","journal-title":"Expert Syst Appl"},{"key":"890_CR19","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.knosys.2015.08.018","volume":"90","author":"G Lee","year":"2015","unstructured":"Lee G, Yun U, Ryang H (2015) An uncertainty-based approach: frequent itemset mining from uncertain data with different item importance. Knowl-Based Syst 90:239\u2013256","journal-title":"Knowl-Based Syst"},{"issue":"6","key":"890_CR20","first-page":"1","volume":"30","author":"G Lee","year":"2016","unstructured":"Lee G, Yun U, Ryang H, Kim D (2016) Approximate maximal frequent pattern mining with weight conditions and error tolerance. Int J Pattern Recognit Artif Intell 30(6):1\u201342","journal-title":"Int J Pattern Recognit Artif Intell"},{"key":"890_CR21","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.engappai.2016.03.003","volume":"52","author":"G Lee","year":"2016","unstructured":"Lee G, Yun U, Ryang H, Kim D (2016) Erasable itemset mining over incremental databases with weight conditions. Eng Appl Artif Intell 52:213\u2013234","journal-title":"Eng Appl Artif Intell"},{"issue":"3","key":"890_CR22","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1016\/j.aei.2015.06.002","volume":"29","author":"J Lin","year":"2015","unstructured":"Lin J, Gan W, Hong T, Tseng V (2015) Efficient algorithms for mining up-to-date high utility patterns. Adv Eng Inform 29(3):648\u2013661","journal-title":"Adv Eng Inform"},{"key":"890_CR23","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.knosys.2015.12.019","volume":"96","author":"J Lin","year":"2016","unstructured":"Lin J, Gan W, Fournier-Viger P, Hong T, 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":"890_CR24","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, pp 689\u2013695","DOI":"10.1007\/11430919_79"},{"key":"890_CR25","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, pp 55\u201364","DOI":"10.1145\/2396761.2396773"},{"key":"890_CR26","doi-asserted-by":"crossref","unstructured":"Lu T, Vo B, Nguyen HT, Hong T (2014) A new method for mining high average utility itemsets. In: Computer Information Systems and Industrial Management, pp 33\u201342","DOI":"10.1007\/978-3-662-45237-0_5"},{"key":"890_CR27","unstructured":"Pisharath J, Liu Y, Ozisikyilmaz B, Narayanan R, Liao WK, Choudhary A Memik G NU-MineBench version 2.0 dataset and technical report, \n                        http:\/\/cucis.ece.northwestern.edu\/projects\/DMS\/"},{"key":"890_CR28","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"},{"issue":"2","key":"890_CR29","doi-asserted-by":"crossref","first-page":"395","DOI":"10.3233\/IDA-160811","volume":"20","author":"H Ryang","year":"2016","unstructured":"Ryang H, Yun U, Ryu K (2016) Fast algorithm for high utility pattern mining with sum of item quantities. Intell Data Anal 20(2):395\u2013415","journal-title":"Intell Data Anal"},{"issue":"8","key":"890_CR30","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 PS (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":"890_CR31","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/TKDE.2015.2458860","volume":"28","author":"V Tseng","year":"2016","unstructured":"Tseng V, Wu C, Fournier-Viger P, Yu PS (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":"890_CR32","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/j.ins.2008.10.027","volume":"179","author":"SK Tanbeer","year":"2009","unstructured":"Tanbeer SK, Ahmed CF, Jeong B, Lee Y (2009) Efficient single-pass frequent pattern mining using a prefix-tree. Inf Sci 179(5):559\u2013583","journal-title":"Inf Sci"},{"key":"890_CR33","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.knosys.2014.09.012","volume":"73","author":"C Tsai","year":"2015","unstructured":"Tsai C, Lai B (2015) A location-item-time sequential pattern mining algorithm for route recommendation. Knowl-Based Syst 73:97\u2013110","journal-title":"Knowl-Based Syst"},{"issue":"2","key":"890_CR34","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s10489-014-0601-6","volume":"42","author":"U Yun","year":"2015","unstructured":"Yun U, Ryang H (2015) Incremental high utility pattern mining with static and dynamic databases. Appl Intell 42(2):323\u2013352","journal-title":"Appl Intell"},{"issue":"8","key":"890_CR35","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 K (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"},{"issue":"6","key":"890_CR36","doi-asserted-by":"crossref","first-page":"3605","DOI":"10.3233\/IFS-162106","volume":"30","author":"U Yun","year":"2016","unstructured":"Yun U, Kim D, Ryang H, Lee G, Lee K (2016) Mining recent high average utility patterns based on sliding window from stream data. J Intell Fuzzy Syst 30(6):3605\u20133617","journal-title":"J Intell Fuzzy Syst"},{"key":"890_CR37","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/j.eswa.2016.01.049","volume":"54","author":"U Yun","year":"2016","unstructured":"Yun U, Lee G (2016) Incremental mining of weighted maximal frequent itemsets from dynamic databases. Expert Syst Appl 54:304\u2013327","journal-title":"Expert Syst Appl"},{"key":"890_CR38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.future.2015.12.012","volume":"59","author":"U Yun","year":"2016","unstructured":"Yun U, Lee G (2016) Sliding window based weighted erasable stream pattern mining for stream data applications. Futur Gener Comput Syst 59:1\u201320","journal-title":"Futur Gener Comput Syst"},{"issue":"5","key":"890_CR39","first-page":"1","volume":"8","author":"U Yun","year":"2016","unstructured":"Yun U, Lee G, Kim C (2016) The smallest valid extension-based efficient, rare graph pattern mining, considering length-decreasing support constraints and symmetry characteristics of graphs. Symmetry 8(5):1\u201326","journal-title":"Symmetry"},{"issue":"1","key":"890_CR40","first-page":"1","volume":"24","author":"U Yun","year":"2015","unstructured":"Yun U, Pyun G, Yoon E (2015) Efficient mining of robust closed weighted sequential patterns without information loss. Int J Artif Intell Tools 24(1):1\u201328","journal-title":"Int J Artif Intell Tools"},{"issue":"5","key":"890_CR41","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1111\/exsy.12158","volume":"33","author":"U Yun","year":"2016","unstructured":"Yun U, Lee G, Lee K (2016) Efficient representative pattern mining based on weight and maximality conditions. Expert Syst 33(5):439\u2013462","journal-title":"Expert Syst"},{"key":"890_CR42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.knosys.2015.06.014","volume":"89","author":"J Zhang","year":"2015","unstructured":"Zhang J, Wang Y, Yang D (2015) CCSpan: mining closed contiguous sequential patterns. Knowl-Based Syst 89:1\u201313","journal-title":"Knowl-Based Syst"},{"key":"890_CR43","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.knosys.2015.04.004","volume":"84","author":"X Zhang","year":"2015","unstructured":"Zhang X, Deng Z (2015) Mining summarization of high utility itemsets. Knowl-Based Syst 84:67\u201377","journal-title":"Knowl-Based Syst"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-016-0890-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-016-0890-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-016-0890-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,5]],"date-time":"2017-06-05T14:01:30Z","timestamp":1496671290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-016-0890-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,14]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["890"],"URL":"https:\/\/doi.org\/10.1007\/s10489-016-0890-z","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,14]]}}}