{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T11:53:02Z","timestamp":1775735582462,"version":"3.50.1"},"reference-count":43,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004085","name":"Ministry of Education, Science and Technology","doi-asserted-by":"publisher","award":["20152062051"],"award-info":[{"award-number":["20152062051"]}],"id":[{"id":"10.13039\/501100004085","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004085","name":"Ministry of Education, Science and Technology","doi-asserted-by":"publisher","award":["2018R1D1A1A09083"],"award-info":[{"award-number":["2018R1D1A1A09083"]}],"id":[{"id":"10.13039\/501100004085","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1016\/j.ins.2019.04.050","type":"journal-article","created":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T11:04:59Z","timestamp":1556103899000},"page":"37-59","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":44,"special_numbering":"C","title":["Advanced approach of sliding window based erasable pattern mining with list structure of industrial fields"],"prefix":"10.1016","volume":"494","author":[{"given":"Unil","family":"Yun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gangin","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eunchul","family":"Yoon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2019.04.050_bib0001","series-title":"Proceedings of the 20th International Conference on Very Large Data Bases","first-page":"487","article-title":"Fast algorithms for mining association rules","author":"Agrawal","year":"1994"},{"issue":"Aug.","key":"10.1016\/j.ins.2019.04.050_bib0002","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.ins.2016.03.007","article-title":"Mining interesting patterns from uncertain databases","volume":"354","author":"Ahmed","year":"2016","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2019.04.050_bib0003","series-title":"Proceedings of the 11th IEEE International Conference on High Performance Computing and Communications","first-page":"400","article-title":"Efficient mining of weighted frequent patterns over data streams","author":"Ahmed","year":"2009"},{"issue":"12, Dec","key":"10.1016\/j.ins.2019.04.050_bib0004","doi-asserted-by":"crossref","first-page":"1708","DOI":"10.1109\/TKDE.2009.46","article-title":"Efficient tree structures for high utility pattern mining in incremental databases","volume":"21","author":"Ahmed","year":"2009","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"9, Jan","key":"10.1016\/j.ins.2019.04.050_bib0005","doi-asserted-by":"crossref","first-page":"7976","DOI":"10.1016\/j.eswa.2012.01.117","article-title":"Single-pass incremental and interactive mining for weighted frequent patterns","volume":"39","author":"Ahmed","year":"2012","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.ins.2019.04.050_bib0006","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.engappai.2016.01.004","article-title":"Complex diseases SNP selection and classification by hybrid Association rule mining and artificial neural network - based evolutionary algorithms","volume":"51","author":"Boutorh","year":"2016","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"2, Feb","key":"10.1016\/j.ins.2019.04.050_bib0007","doi-asserted-by":"crossref","first-page":"2183","DOI":"10.1016\/j.eswa.2011.07.011","article-title":"An efficient algorithm of frequent XML query pattern mining for ebXML applications in e-commerce","volume":"39","author":"Chang","year":"2012","journal-title":"Expert Syst. Appl."},{"issue":"10, Oct.","key":"10.1016\/j.ins.2019.04.050_bib0008","doi-asserted-by":"crossref","first-page":"1444","DOI":"10.1016\/j.compbiomed.2013.07.009","article-title":"Frequent patterns mining in multiple biological sequences","volume":"43","author":"Chen","year":"2013","journal-title":"Comput. Biol. Med."},{"issue":"Feb.","key":"10.1016\/j.ins.2019.04.050_bib0009","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.ins.2016.07.075","article-title":"Reality mining: A prediction algorithm for disease dynamics based on mobile big data","volume":"379","author":"Chen","year":"2017","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2019.04.050_bib0010","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.envsoft.2015.12.011","article-title":"Environmental conflict analysis using an integrated grey clustering and entropy-weight method: A case study of a mining project in Peru","volume":"77","author":"Delgado","year":"2016","journal-title":"Env. Modell. Softw."},{"key":"10.1016\/j.ins.2019.04.050_bib0011","series-title":"Proceedings of the 8th International Conference on Machine Learning and Cybernetics","first-page":"67","article-title":"MINING ERASABLE ITEMSETS","volume":"1","author":"Deng","year":"2009"},{"issue":"Nov.","key":"10.1016\/j.ins.2019.04.050_bib0012","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/978-3-642-17316-5_20","article-title":"An Efficient Algorithm for Mining Erasable Itemsets","author":"Deng","year":"2010","journal-title":"Adv. Data Mining Appl."},{"issue":"4, Mar.","key":"10.1016\/j.ins.2019.04.050_bib0013","doi-asserted-by":"crossref","first-page":"4453","DOI":"10.1016\/j.eswa.2011.09.143","article-title":"Fast mining erasable itemsets using NC_sets","volume":"39","author":"Deng","year":"2012","journal-title":"Expert Syst. Appl."},{"issue":"1, Jan","key":"10.1016\/j.ins.2019.04.050_bib0014","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","article-title":"Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach","volume":"8","author":"Han","year":"2004","journal-title":"Data Min. Knowl. Discov."},{"key":"10.1016\/j.ins.2019.04.050_bib0015","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.neucom.2015.02.081","article-title":"Event photo mining from Twitter using keyword bursts and image clustering","volume":"172","author":"Kaneko","year":"2016","journal-title":"Neurocomputing"},{"key":"10.1016\/j.ins.2019.04.050_bib0016","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.future.2016.07.018","article-title":"ClowdFlows: Online workflows for distributed big data mining","volume":"68","author":"Kranjc","year":"2017","journal-title":"Future Gener. Comput. Syst."},{"issue":"Jan","key":"10.1016\/j.ins.2019.04.050_bib0017","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.engappai.2013.09.002","article-title":"MEI: An efficient algorithm for mining erasable itemsets","volume":"27","author":"Le","year":"2014","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.ins.2019.04.050_bib0018","series-title":"IEEE International Conference on Systems, Man, and Cybernetics","first-page":"2270","article-title":"An efficient algorithm for mining erasable itemsets using the difference of NC-sets","author":"Le","year":"2013"},{"key":"10.1016\/j.ins.2019.04.050_bib0019","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.future.2016.09.007","article-title":"A new efficient approach for mining uncertain frequent patterns using minimum data structure without false positives","volume":"68","author":"Lee","year":"2017","journal-title":"Future Gener. Comput. Syst."},{"issue":"6","key":"10.1016\/j.ins.2019.04.050_bib0020","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0218001416500129","article-title":"Approximate maximal frequent pattern mining with weight conditions and error tolerance","volume":"30","author":"Lee","year":"2016","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"key":"10.1016\/j.ins.2019.04.050_bib0021","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.engappai.2016.03.003","article-title":"Erasable itemset mining over incremental databases with weight conditions","volume":"52","author":"Lee","year":"2016","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"3","key":"10.1016\/j.ins.2019.04.050_bib0022","first-page":"1145","article-title":"Mining weighted erasable patterns by using underestimated constraint-based pruning technique","volume":"28","author":"Lee","year":"2015","journal-title":"J. Intell. Fuzzy Syst."},{"issue":"2","key":"10.1016\/j.ins.2019.04.050_bib0023","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1016\/j.eswa.2013.07.094","article-title":"Sliding window based weighted maximal frequent pattern mining over data streams","volume":"41","author":"Lee","year":"2014","journal-title":"Expert Syst. Appl."},{"issue":"Feb","key":"10.1016\/j.ins.2019.04.050_bib0024","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.ins.2015.10.011","article-title":"A distributed ensemble approach for mining healthcare data under privacy constraints","volume":"330","author":"Li","year":"2016","journal-title":"Inf. Sci."},{"issue":"Nov","key":"10.1016\/j.ins.2019.04.050_bib0025","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.ins.2015.05.006","article-title":"A novel method for constrained class association rule mining","volume":"320","author":"Nguyen","year":"2015","journal-title":"Inf. Sci."},{"issue":"Apr.","key":"10.1016\/j.ins.2019.04.050_bib0026","first-page":"73","article-title":"A new approach for mining Top-Rank-k erasable itemsets","volume":"8397","author":"Nguyen","year":"2014","journal-title":"Intell. Inf. Database Syst."},{"issue":"May","key":"10.1016\/j.ins.2019.04.050_bib0027","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.knosys.2011.07.003","article-title":"Finding \"interesting\" trends in social networks using frequent pattern mining and self organizing maps","volume":"29","author":"Nohuddin","year":"2012","journal-title":"Knowl.-Based Syst."},{"issue":"Feb","key":"10.1016\/j.ins.2019.04.050_bib0028","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.ins.2016.06.036","article-title":"Dependable large scale behavioral patterns mining from sensor data using Hadoop platform","volume":"379","author":"Rashid","year":"2017","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2019.04.050_bib0029","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/j.eswa.2016.03.001","article-title":"High utility pattern mining over data streams with sliding window technique","volume":"57","author":"Ryang","year":"2016","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"10.1016\/j.ins.2019.04.050_bib0030","doi-asserted-by":"crossref","first-page":"395","DOI":"10.3233\/IDA-160811","article-title":"Fast Algorithm for high utility pattern mining with the sum of item quantities","volume":"20","author":"Ryang","year":"2016","journal-title":"Intell. Data Anal."},{"key":"10.1016\/j.ins.2019.04.050_bib0031","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.knosys.2014.12.010","article-title":"Top-k high utility pattern mining with effective threshold raising strategies","volume":"76","author":"Ryang","year":"2015","journal-title":"Knowl. Based Syst."},{"issue":"6, November","key":"10.1016\/j.ins.2019.04.050_bib0032","doi-asserted-by":"crossref","first-page":"1027","DOI":"10.3233\/IDA-140683","article-title":"Discovering high utility itemsets with multiple minimum supports","volume":"18","author":"Ryang","year":"2014","journal-title":"Intell. Data Anal."},{"issue":"1","key":"10.1016\/j.ins.2019.04.050_bib0033","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s10462-016-9458-x","article-title":"Hadith data mining and classification: a comparative analysis","volume":"46","author":"Saloot","year":"2016","journal-title":"Artif. Intell. Rev."},{"key":"10.1016\/j.ins.2019.04.050_bib0034","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.eswa.2016.10.028","article-title":"Mining erasable itemsets with subset and superset itemset constraints","volume":"69","author":"Vo","year":"2017","journal-title":"Expert Syst. Appl."},{"issue":"4, March","key":"10.1016\/j.ins.2019.04.050_bib0035","doi-asserted-by":"crossref","first-page":"1256","DOI":"10.1016\/j.eswa.2012.08.065","article-title":"A new method for mining frequent weighted itemsets based on WIT-trees","volume":"40","author":"Vo","year":"2013","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.ins.2019.04.050_bib0036","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/j.future.2014.10.018","article-title":"Role mining using answer set programming","volume":"55","author":"Ye","year":"2016","journal-title":"Future Gener. Comput. Syst."},{"issue":"4, June","key":"10.1016\/j.ins.2019.04.050_bib0037","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1007\/s10489-013-0487-8","article-title":"An efficient algorithm for incrementally mining frequent closed itemsets","volume":"40","author":"Yen","year":"2014","journal-title":"Appl. Intell."},{"key":"10.1016\/j.ins.2019.04.050_bib0038","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/j.future.2016.10.027","article-title":"Mining of high average-utility itemsets using novel list structure and pruning strategy","volume":"68","author":"Yun","year":"2017","journal-title":"Future Gener. Comput. Syst."},{"key":"10.1016\/j.ins.2019.04.050_bib0039","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1016\/j.asoc.2016.09.003","article-title":"Monitoring vehicle outliers based on clustering technique","volume":"49","author":"Yun","year":"2016","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.ins.2019.04.050_bib0040","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.future.2015.12.012","article-title":"Sliding window based weighted erasable stream pattern mining for stream data applications","volume":"59","author":"Yun","year":"2016","journal-title":"Future Gener. Comput. Syst."},{"issue":"6","key":"10.1016\/j.ins.2019.04.050_bib0041","first-page":"3605","article-title":"Mining recent high average utility patterns based on sliding window from stream data","volume":"30","author":"Yun","year":"2016","journal-title":"J. Intell. Fuzzy Syst."},{"key":"10.1016\/j.ins.2019.04.050_bib0042","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/j.eswa.2016.01.049","article-title":"Incremental mining of weighted maximal frequent itemsets from dynamic databases","volume":"54","author":"Yun","year":"2016","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"10.1016\/j.ins.2019.04.050_bib0043","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0218213015500074","article-title":"Efficient mining of robust closed weighted sequential patterns without information loss","volume":"24","author":"Yun","year":"2015","journal-title":"Int. J. Artif. Intell. Tools"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0020025517300385?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0020025517300385?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T04:49:54Z","timestamp":1758084594000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025517300385"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":43,"alternative-id":["S0020025517300385"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.ins.2019.04.050","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2019,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Advanced approach of sliding window based erasable pattern mining with list structure of industrial fields","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.ins.2019.04.050","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}