{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:07:28Z","timestamp":1761808048066,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,2,2]],"date-time":"2016-02-02T00:00:00Z","timestamp":1454371200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea (KR)","doi-asserted-by":"publisher","award":["NRF No. 20152062051","NRF No. 20155054624"],"award-info":[{"award-number":["NRF No. 20152062051","NRF No. 20155054624"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea (NRF)","doi-asserted-by":"crossref","award":["2013005682"],"award-info":[{"award-number":["2013005682"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Business for Cooperative R&D between Industry, Academy, and Research Institute funded Korea Small and Medium Business Administration","award":["C0232102"],"award-info":[{"award-number":["C0232102"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10489-015-0750-2","type":"journal-article","created":{"date-parts":[[2016,2,2]],"date-time":"2016-02-02T02:54:03Z","timestamp":1454381643000},"page":"152-173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Efficient mining of high utility pattern with considering of rarity and length"],"prefix":"10.1007","volume":"45","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":[[2016,2,2]]},"reference":[{"key":"750_CR1","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: 20th international conference on very large data bases, pp 487\u2013499"},{"issue":"12","key":"750_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"},{"issue":"10","key":"750_CR3","doi-asserted-by":"crossref","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":"750_CR4","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Proc. of the 2000 ACM SIGMOD int\u2019l conf. on management of data, pp 1\u201312","DOI":"10.1145\/342009.335372"},{"key":"750_CR5","unstructured":"Han J, Fu Y (1995) Discovery of multiple-level association rules from large databases. In: Proc. of the 21th int\u2019l conf. on very large database (VLDB 1995), pp 420\u2013431"},{"key":"750_CR6","doi-asserted-by":"crossref","unstructured":"Hong T, Lee C, Wang S (2009) Mining high average-utility itemsets. SMC 2009:2526\u20132530","DOI":"10.1109\/ICSMC.2009.5346333"},{"issue":"7","key":"750_CR7","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":"750_CR8","doi-asserted-by":"crossref","unstructured":"Hong T, Lee C, Wang S (2009) An Incremental Mining Algorithm for High Average-Utility Itemsets. ISPAN 2009:421\u2013425","DOI":"10.1109\/I-SPAN.2009.24"},{"issue":"1","key":"750_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.dss.2004.09.007","volume":"42","author":"Y Hu","year":"2006","unstructured":"Hu Y, Chen Y (2006) Mining association rules with multiple minimum supports: a new mining algorithm and a support tuning mechanism. Decis Support Syst 42(1):1\u201324","journal-title":"Decis Support Syst"},{"key":"750_CR10","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.asoc.2014.10.047","volume":"28","author":"Y Hu","year":"2015","unstructured":"Hu Y, Tsai C, Tai C, Chiang I (2015) A novel approach for mining cyclically repeated patterns with multiple minimum supports. Appl Soft Comput 28:90\u201399","journal-title":"Appl Soft Comput"},{"issue":"1","key":"750_CR11","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/j.eswa.2014.07.045","volume":"42","author":"Q Huynh-Thi-Le","year":"2015","unstructured":"Huynh-Thi-Le Q, Le T, Vo B, Le HB (2015) An efficient and effective algorithm for mining top-rank-k frequent patterns. Expert Syst Appl 42(1):156\u2013164","journal-title":"Expert Syst Appl"},{"key":"750_CR12","unstructured":"Kiran RU, Reddy PK (2009) An improved multiple minimum support based approach to mine rare association rules. CIDM 2009:340\u2013347"},{"key":"750_CR13","doi-asserted-by":"crossref","unstructured":"Kiran RU, Reddy PK (2011) Novel techniques to reduce search space in multiple minimum supports-based frequent pattern mining algorithms. In: Proceedings of the 14th international conference on extending database technology, pp 11\u201320","DOI":"10.1145\/1951365.1951370"},{"key":"750_CR14","first-page":"193","volume":"28","author":"G Lan","year":"2012","unstructured":"Lan G, Hong T, Tseng VS (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":"750_CR15","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1142\/S0219622012500307","volume":"11","author":"G Lan","year":"2012","unstructured":"Lan G, Hong T, Tseng VS (2012) Efficiently mining high average-utility itemsets with an improved upper-bound strategy. Int J Inf Technol Decis Mak 11(5):1009\u2013","journal-title":"Int J Inf Technol Decis Mak"},{"issue":"1","key":"750_CR16","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10115-012-0492-y","volume":"38","author":"G Lan","year":"2014","unstructured":"Lan G, Hong T, 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":"2","key":"750_CR17","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 streams. Expert Syst Appl 41(2):694\u2013708","journal-title":"Expert Syst Appl"},{"key":"750_CR18","first-page":"239256","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:239256","journal-title":"Knowl-Based Syst"},{"key":"750_CR19","unstructured":"Lee W, Stolfo SJ, Mok KW (1998) Mining audit data to build intrusion detection models. In: Proceedings of the 4th international conference on knowledge discovery and data mining (KDD 1998), pp 66\u201372"},{"issue":"1","key":"750_CR20","doi-asserted-by":"crossref","first-page":"43","DOI":"10.3233\/IDA-140695","volume":"19","author":"C Lin","year":"2015","unstructured":"Lin C, Lan G, Hong T (2015) Mining high utility itemsets for transaction deletion in a dynamic databases. Intell Data Analy 19(1):43\u201355","journal-title":"Intell Data Analy"},{"key":"750_CR21","doi-asserted-by":"crossref","unstructured":"Liu B, Hsu W, Ma Y (1999) Mining association rules with multiple minimum supports. KDD \u201999 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining:337\u2013341","DOI":"10.1145\/312129.312274"},{"key":"750_CR22","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao W, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. Advan Knowl Disc Data Mining:689\u2013695","DOI":"10.1007\/11430919_79"},{"key":"750_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), pp 55","DOI":"10.1145\/2396761.2396773"},{"key":"750_CR24","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 T-F, Hsueh S-C (2012) High utility pattern mining using the maximal itemset property and lexicographic tree structures. Inf Sci 215:1\u201314","journal-title":"Inf Sci"},{"key":"750_CR25","first-page":"131","volume":"5990","author":"C Lin","year":"2010","unstructured":"Lin C, Hong T, Lu W (2010) Efficiently mining high average utility itemsets with a tree structure. ACIIDS 5990:131\u2013139","journal-title":"ACIIDS"},{"key":"750_CR26","first-page":"33","volume":"2014","author":"T Lu","year":"2014","unstructured":"Lu T, Vo B, Nguyen HT, Hong T (2014) A new method for mining high average utility itemsets. CISIM 2014:33\u201342","journal-title":"CISIM"},{"key":"750_CR27","unstructured":"Mannila H (1998) Database methods for data mining. In: ACM SIGKDD Conf. on knowledge discovery and data mining (KDD 1998) tutorial"},{"issue":"4","key":"750_CR28","first-page":"642","volume":"31","author":"SB Patil","year":"2009","unstructured":"Patil SB, Kumaraswamy VS (2009) Intelligent and effective heart attack prediction system using data mining and artificial neural network. Eur J Sci Res 31(4):642\u2013656","journal-title":"Eur J Sci Res"},{"key":"750_CR29","unstructured":"Pisharath J, Liu Y, Ozisikyilmaz B, Narayanan R, Liao WK, Choudhary A, Memik G NU-MineBench version 2.0 dataset and technical report, http:\/\/cucis.ece.northwestern.edu\/projects\/DMS\/"},{"issue":"1","key":"750_CR30","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/s10489-013-0506-9","volume":"41","author":"G Pyun","year":"2014","unstructured":"Pyun G, Yun U (2014) Mining Top-k frequent patterns with combination reducing techniques. Appl Intell 41(1):76\u201398","journal-title":"Appl Intell"},{"issue":"6","key":"750_CR31","doi-asserted-by":"crossref","first-page":"1027","DOI":"10.3233\/IDA-140683","volume":"18","author":"H Ryang","year":"2014","unstructured":"Ryang H, Yun U, Ryu K (2014) Discovering high utility itemsets with multiple minimum supports. Intell Data Analy 18(6):1027\u20131047","journal-title":"Intell Data Analy"},{"key":"750_CR32","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":"750_CR33","doi-asserted-by":"crossref","unstructured":"Tempaiboolkul J (2013) Mining rare association rules in a distributed environment using multiple minimum supports. ICIS 2013:295\u2013299","DOI":"10.1109\/ICIS.2013.6607857"},{"key":"750_CR34","doi-asserted-by":"crossref","unstructured":"Tseng VS, Wu CW, Shie BE, Yu PS (2010) UP-Growth: an efficient algorithm for high utility itemset mining. In: Proc. of the 16th ACM SIGKDD int\u2019l conf. on knowledge discovery and data mining (KDD 2010), pp 253\u2013262","DOI":"10.1145\/1835804.1835839"},{"issue":"5","key":"750_CR35","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1016\/j.knosys.2011.02.010","volume":"24","author":"CH Weng","year":"2011","unstructured":"Weng CH (2011) Mining fuzzy specific rare itemsets for education data. Knowl-Based Syst 24(5):697\u2013708","journal-title":"Knowl-Based Syst"},{"key":"750_CR36","doi-asserted-by":"crossref","unstructured":"Xu T, Dong X (2013) Mining frequent patterns with multiple minimum supports using basic Apriori. ICNC 2013:957\u2013961","DOI":"10.1109\/ICNC.2013.6818114"},{"issue":"3","key":"750_CR37","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0164-1212(02)00128-0","volume":"67","author":"H Yun","year":"2003","unstructured":"Yun H, Ha D, Hwang B, Ryu K (2003) Mining association rules on significant rare data using relative support. J Syst Softw 67(3):181\u2013191","journal-title":"J Syst Softw"},{"issue":"2","key":"750_CR38","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s10489-014-0601-6","volume":"42","author":"U Yun","year":"2014","unstructured":"Yun U, Ryang H (2014) Incremental high utility pattern mining with static and dynamic databases. Appl Intell 42(2):323\u2013352","journal-title":"Appl Intell"},{"issue":"8","key":"750_CR39","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":"750_CR40","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1142\/S0218488514500470","volume":"22","author":"U Yun","year":"2014","unstructured":"Yun U, Yoon E (2014) An efficient approach for mining weighted approximate closed frequent patterns considering noise constraints. Int J Uncertainty Fuzziness Knowledge Based Syst 22(6):879\u2013912","journal-title":"Int J Uncertainty Fuzziness Knowledge Based Syst"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-015-0750-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-015-0750-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-015-0750-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T01:56:11Z","timestamp":1567562171000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-015-0750-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,2]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["750"],"URL":"https:\/\/doi.org\/10.1007\/s10489-015-0750-2","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2016,2,2]]}}}