{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:56:37Z","timestamp":1760709397097,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,11,9]],"date-time":"2017-11-09T00:00:00Z","timestamp":1510185600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2017,11,9]],"date-time":"2017-11-09T00:00:00Z","timestamp":1510185600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","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":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Hum. Cent. Comput. Inf. Sci."],"published-print":{"date-parts":[[2017,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Since the concept of high utility pattern mining was proposed to solve the drawbacks of traditional frequent pattern mining approach that cannot handle various features of real-world applications, many different techniques and algorithms for high utility pattern mining have been developed. Moreover, several advanced methods for incremental data processing have been proposed in recent years as the sizes of recent databases obtained in the real world become larger. In this paper, we introduce the basic concept of incremental high utility pattern mining and analyze various relevant methods. In addition, we also conduct performance evaluation for the methods with famous benchmark datasets in order to determine their detailed characteristics. The evaluation shows that the less candidate patterns make algorithms faster.<\/jats:p>","DOI":"10.1186\/s13673-017-0112-7","type":"journal-article","created":{"date-parts":[[2017,8,30]],"date-time":"2017-08-30T11:49:56Z","timestamp":1504093796000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Analyzing of incremental high utility pattern mining based on tree structures"],"prefix":"10.1186","volume":"7","author":[{"given":"Judae","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Unil","family":"Yun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gangin","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,9]]},"reference":[{"key":"112_CR1","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th international conference on very large data bases Santiago de Chile, pp 487\u2013499"},{"issue":"12","key":"112_CR2","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1109\/TKDE.2009.46","volume":"21","author":"CF Ahmed","year":"2009","unstructured":"Ahmed CF, Tanbeer SK, Jeong B-S, Lee Y-K (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":"1","key":"112_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.14400\/JDC.2015.13.7.9","volume":"6","author":"Y Cho","year":"2015","unstructured":"Cho Y, Moon S (2015) Recommender system using periodicity analysis via mining sequential patterns with time-series and frat analysis. J Converg 6(1):9\u201317","journal-title":"J Converg"},{"key":"112_CR4","unstructured":"Choi J, Shin H, Nasridinov A (2016) A comparative study on data mining classification techniques for military applications. J Converg 7"},{"issue":"1","key":"112_CR5","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1186\/s13673-015-0050-1","volume":"5","author":"M Gaur","year":"2015","unstructured":"Gaur M, Pant B (2015) Trusted and secure clustering in mobile pervasive environment. Hum Centric Comput Inf Sci. 5(1):1\u201317","journal-title":"Hum Centric Comput Inf Sci."},{"issue":"1","key":"112_CR6","doi-asserted-by":"publisher","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 (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":"1","key":"112_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13673-016-0064-3","volume":"6","author":"S Jeeva","year":"2016","unstructured":"Jeeva S, Rajsingh E (2016) Intelligent phishing url detection using association rule mining. Hum Centric Comput Inf Sci. 6(1):1\u201319","journal-title":"Hum Centric Comput Inf Sci."},{"issue":"8","key":"112_CR8","doi-asserted-by":"publisher","first-page":"7173","DOI":"10.1016\/j.eswa.2012.01.072","volume":"39","author":"C-W Lin","year":"2012","unstructured":"Lin C-W, Lan G-C, Hong T-P (2012) An incremental mining algorithm for high utility itemsets. Expert Syst Appl 39(8):7173\u20137180","journal-title":"Expert Syst Appl"},{"key":"112_CR9","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao W-K, Choudhary (2005) AN a Two-Phase algorithm for fast discovery of high utility itemsets. Adv Knowl Discov Data Min. Hanoi 689\u2013695","DOI":"10.1007\/11430919_79"},{"issue":"2","key":"112_CR10","first-page":"99","volume":"17","author":"H Ryang","year":"2016","unstructured":"Ryang H, Yun U, Lee G, Kim D, Jung W, Lee J, Gwon G (2016) Performance analysis of incremental high utility pattern mining methods. Korea Internet Inf Soc 17(2):99\u2013100","journal-title":"Korea Internet Inf Soc"},{"issue":"1","key":"112_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1186\/s13673-015-0036-z","volume":"5","author":"A Sato","year":"2015","unstructured":"Sato A, Huang R, Yen N (2015) Design of fusion technique-based mining engine for smart business. Hum Centric Comput Inf Sci. 5(1):1\u201316","journal-title":"Hum Centric Comput Inf Sci."},{"issue":"2","key":"112_CR12","first-page":"10","volume":"6","author":"G Sanna","year":"2015","unstructured":"Sanna G, Angius A, Concas G, Manca D, Eros F (2015) PCE: a knowledge base of semantically disambiguated contents. J Converg 6(2):10\u201318","journal-title":"J Converg"},{"key":"112_CR13","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.chb.2016.11.036","volume":"68","author":"MK Sohrabi","year":"2017","unstructured":"Sohrabi MK, Roshani R (2017) Frequent itemset mining using cellular learning automata. Comput Hum Behav 68:244\u2013253","journal-title":"Comput Hum Behav"},{"issue":"2","key":"112_CR14","doi-asserted-by":"publisher","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":"2","key":"112_CR15","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s10115-016-0986-0","volume":"51","author":"S Zida","year":"2017","unstructured":"Zida S, Fournier-Viger P, Lin JC-W, Tseng VS (2017) EFIM: a fast and memory efficient algorithm for high-utility itemset mining. Knowl Inf Syst 51(2):595\u2013625","journal-title":"Knowl Inf Syst"}],"container-title":["Human-centric Computing and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13673-017-0112-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13673-017-0112-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13673-017-0112-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T08:12:47Z","timestamp":1627632767000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1186\/s13673-017-0112-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,9]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["112"],"URL":"https:\/\/doi.org\/10.1186\/s13673-017-0112-7","relation":{},"ISSN":["2192-1962"],"issn-type":[{"type":"electronic","value":"2192-1962"}],"subject":[],"published":{"date-parts":[[2017,11,9]]},"assertion":[{"value":"10 March 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"31"}}