{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:58:32Z","timestamp":1760709512079},"reference-count":33,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Expert Systems with Applications"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1016\/j.eswa.2018.01.003","type":"journal-article","created":{"date-parts":[[2018,1,31]],"date-time":"2018-01-31T12:26:51Z","timestamp":1517401611000},"page":"41-67","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/http\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":13,"special_numbering":"C","title":["Mining incrementally closed item sets with constructive pattern set"],"prefix":"10.1016","volume":"100","author":[{"given":"Thanh-Trung","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.eswa.2018.01.003_bib0001","series-title":"Proceedings of the fifth ACM SIGKDD international conference on knowledge discovery and data mining","first-page":"287","article-title":"An efficient algorithm to update large itemsets with early pruning","author":"Ayan","year":"1999"},{"key":"10.1016\/j.eswa.2018.01.003_bib0002","series-title":"Proceeding of the ACM-SIGMOD international conference on management of data (SIGMOD\u201998)","first-page":"85","article-title":"Efficiently mining long patterns from databases","author":"Bayardo","year":"1998"},{"issue":"1","key":"10.1016\/j.eswa.2018.01.003_bib0003","first-page":"35","article-title":"Incremental association mining using a closed-set lattice","volume":"39","author":"Ceglar","year":"2007","journal-title":"Journal of Research and Practice in Information Technology"},{"key":"10.1016\/j.eswa.2018.01.003_bib0004","series-title":"Proceedings of the twelfth international conference on data engineering","first-page":"106","article-title":"Large databases: An incremental updating technique","author":"Cheung","year":"1996"},{"key":"10.1016\/j.eswa.2018.01.003_bib0005","series-title":"Proceedings of the fifth international conference on database systems for advanced applications","first-page":"185","article-title":"A general incremental technique for updating discovered association rules","author":"Cheung","year":"1997"},{"key":"10.1016\/j.eswa.2018.01.003_bib0006","series-title":"Proceedings of the seventh international database engineering and application symposium","first-page":"111","article-title":"Incremental mining of frequent patterns without candidate generation or support constraint","author":"Cheung","year":"2003"},{"key":"10.1016\/j.eswa.2018.01.003_bib0007","series-title":"Proceedings of the fifteenth Canadian conference on artificial intelligence","article-title":"Mining incremental association rules with generalized FP-tree","author":"Ezeife","year":"2002"},{"key":"10.1016\/j.eswa.2018.01.003_bib0008","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/978-3-642-15105-7_23","article-title":"Mining closed itemsets in data stream using formal concept analysis","volume":"6263","author":"Gupta","year":"2010","journal-title":"Data Warehousing and Knowledge Discovery, LNCS"},{"issue":"4","key":"10.1016\/j.eswa.2018.01.003_bib0009","doi-asserted-by":"crossref","first-page":"2424","DOI":"10.1016\/j.eswa.2007.04.009","article-title":"Incrementally fast updated frequent pattern trees","volume":"34","author":"Hong","year":"2008","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2018.01.003_bib0010","series-title":"Proceeding of PAKDD99","first-page":"109","article-title":"Incremental discovering association rules: A concept lattice approach","author":"Hu","year":"1999"},{"key":"10.1016\/j.eswa.2018.01.003_bib0011","series-title":"Database Systems for Advanced Applications","first-page":"417","article-title":"An efficient approach for maintaining association rules based on adjusting FP-tree structures","volume":"2973","author":"Koh","year":"2004"},{"key":"10.1016\/j.eswa.2018.01.003_bib0012","series-title":"SPO-tree: Efficient single pass ordered incremental pattern mining","first-page":"265","volume":"6862","author":"Koh","year":"2011"},{"issue":"6","key":"10.1016\/j.eswa.2018.01.003_bib0013","doi-asserted-by":"crossref","first-page":"2703","DOI":"10.1016\/j.eswa.2013.11.002","article-title":"Incrementally building frequent closed itemset lattice","volume":"41","author":"La","year":"2014","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2018.01.003_bib0014","series-title":"Proceedings of the tenth international conference on information and knowledge management","first-page":"263","article-title":"Sliding-window filtering: An efficient algorithm for incremental mining","author":"Lee","year":"2001"},{"key":"10.1016\/j.eswa.2018.01.003_bib0015","series-title":"Proceedings of the research issues on data mining and knowledge discovery","article-title":"Maintenance of discovered association rules: When to update?","author":"Lee","year":"1997"},{"key":"10.1016\/j.eswa.2018.01.003_bib0016","series-title":"Proceedings of the fifth IEEE international conference on data mining (ICDM\u201905)","article-title":"CanTree: A tree structure for efficient incremental mining of frequent patterns","author":"Leung","year":"2005"},{"key":"10.1016\/j.eswa.2018.01.003_bib0017","series-title":"AdvancedData Mining and Applications","first-page":"56","article-title":"A fast algorithm for maintenance of association rules in incremental databases","volume":"vol.\u00a04093","author":"Li","year":"2006"},{"issue":"1","key":"10.1016\/j.eswa.2018.01.003_bib0018","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s00354-008-0072-6","article-title":"Using the structure of prelarge trees to incrementally mine frequent itemset","volume":"28","author":"Lin","year":"2010","journal-title":"New Generation Computing"},{"key":"10.1016\/j.eswa.2018.01.003_bib0019","series-title":"Proceeding of the seventh international conference on database theory (ICDT\u201999)","first-page":"398","article-title":"Discovering frequent closed itemsets for association rules","author":"Pasquier","year":"1999"},{"issue":"1","key":"10.1016\/j.eswa.2018.01.003_bib0020","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s10472-012-9329-3","article-title":"Relational concept analysis: Mining concept lattices from multi-relational data","volume":"67","author":"Rouane-Hacene","year":"2013","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"10.1016\/j.eswa.2018.01.003_bib0021","series-title":"Proceedings of the workshop on CEURs, CLA","first-page":"191","article-title":"Fast mining of iceberg lattices: A modular approach using generators","volume":"volume 959","author":"Szathmary","year":"2011"},{"key":"10.1016\/j.eswa.2018.01.003_bib0022","first-page":"259","article-title":"Efficient single-pass frequent pattern mining using a prefix-tree","author":"Tanbeer","year":"2008","journal-title":"Elsevier International Journal Information Science"},{"key":"10.1016\/j.eswa.2018.01.003_bib0023","series-title":"Proceeding of the third ACM SIGKDD international conference on knowledge discovery and data mining","first-page":"263","article-title":"An efficient algorithm for the incremental updation of association rules in large databases","author":"Thomas","year":"1997"},{"issue":"5","key":"10.1016\/j.eswa.2018.01.003_bib0024","first-page":"28","article-title":"Batch processing for incremental FP-tree construction","volume":"5","author":"Totad","year":"2010","journal-title":"International Journal of Computing and Applied IJCA"},{"key":"10.1016\/j.eswa.2018.01.003_bib0025","article-title":"Batch incremental processing for FP-tree construction using FP-Growth algorithm","volume":"26","author":"Totad","year":"2012","journal-title":"Knowledge Information Systems"},{"key":"10.1016\/j.eswa.2018.01.003_bib0026","series-title":"Proceedings of the ninth international conference on conceptual structures","first-page":"290","article-title":"Building concept (Galois) lattices from parts: Generalizing the incremental methods","author":"Valtchev","year":"2001"},{"issue":"6","key":"10.1016\/j.eswa.2018.01.003_bib0027","doi-asserted-by":"crossref","first-page":"924","DOI":"10.1016\/j.dam.2007.08.004","article-title":"A framework for incremental generation of closed itemsets","volume":"156","author":"Valtchev","year":"2008","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.eswa.2018.01.003_bib0028","series-title":"Proceedings of the workshop on integrating data mining and knowledge management (in conjuction with ICDM2001)","article-title":"Knowledge management in association rule mining","author":"Veloso","year":"2001"},{"key":"10.1016\/j.eswa.2018.01.003_bib0029","series-title":"Proceedings of the second SIAM international conferece on data mining","article-title":"Mining frequent itemsets in evolving databases","author":"Veloso","year":"2002"},{"key":"10.1016\/j.eswa.2018.01.003_bib0030","series-title":"Frequent pattern mining using modified CP-tree for knowledge discovery","first-page":"254","volume":"6440","author":"Vishnu Priya","year":"2010"},{"key":"10.1016\/j.eswa.2018.01.003_bib0031","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.knosys.2013.02.003","article-title":"A lattice-based approach for mining most generalization association rules","volume":"45","author":"Vo","year":"2013","journal-title":"Knowledge-Based Systems"},{"issue":"4","key":"10.1016\/j.eswa.2018.01.003_bib0032","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":"Applied Intelligence"},{"key":"10.1016\/j.eswa.2018.01.003_bib0033","series-title":"Proceedings of the fourteenth Canadian conference on artificial intelligence","article-title":"A low-scan incremental association rule maintenance method","author":"Zhou","year":"2001"}],"container-title":["Expert Systems with Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0957417418300022?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:S0957417418300022?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,8,24]],"date-time":"2018-08-24T10:53:24Z","timestamp":1535108004000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0957417418300022"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":33,"alternative-id":["S0957417418300022"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.eswa.2018.01.003","relation":{},"ISSN":["0957-4174"],"issn-type":[{"value":"0957-4174","type":"print"}],"subject":[],"published":{"date-parts":[[2018,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Mining incrementally closed item sets with constructive pattern set","name":"articletitle","label":"Article Title"},{"value":"Expert Systems with Applications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.eswa.2018.01.003","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}