{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T05:05:55Z","timestamp":1724562355038},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T00:00:00Z","timestamp":1298937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1016\/j.asoc.2010.07.011","type":"journal-article","created":{"date-parts":[[2010,8,12]],"date-time":"2010-08-12T08:59:08Z","timestamp":1281603548000},"page":"2129-2133","source":"Crossref","is-referenced-by-count":6,"title":["Mining disjunctive consequent association rules"],"prefix":"10.1016","volume":"11","author":[{"given":"Ding-An","family":"Chiang","sequence":"first","affiliation":[]},{"given":"Yi-Fan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yi-Hsin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Zhi-Yang","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Mei-Hua","family":"Hsu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.asoc.2010.07.011_bib0005","series-title":"Data Mining","author":"Adriaans","year":"1996"},{"key":"10.1016\/j.asoc.2010.07.011_bib0010","series-title":"Proc. ACM SIGMOD Int\u2019l Conf. on Management of Data","article-title":"Mining association rules between sets of items in large databases","author":"Agrawal","year":"1993"},{"key":"10.1016\/j.asoc.2010.07.011_bib0015","series-title":"Proc. Int\u2019l Conf. Very Large Data Bases","article-title":"Fast algorithms for mining association rules","author":"Agrawal","year":"1994"},{"key":"10.1016\/j.asoc.2010.07.011_bib0020","series-title":"Proc. ACM SIGMOD Int\u2019l Conf. on Management of Data","article-title":"Dynamic itemset counting and implication rules for market basket data","author":"Brin","year":"1997"},{"key":"10.1016\/j.asoc.2010.07.011_bib0025","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1109\/69.806937","article-title":"Mining multiple-level association rules in large databases","volume":"11","author":"Han","year":"1999","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/j.asoc.2010.07.011_bib0030","series-title":"Proc. ACM SIGMOD Int\u2019l Conf. on Management of Data","article-title":"Mining frequent patterns without candidate generation","author":"Han","year":"2000"},{"key":"10.1016\/j.asoc.2010.07.011_bib0040","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1109\/TKDE.2002.1000342","article-title":"Pincer-search: an efficient algorithm for discovering the maximum frequent set","volume":"14","author":"Lin","year":"2002","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/j.asoc.2010.07.011_bib0045","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1109\/TKDE.2003.1161582","article-title":"Alternative interest measures for mining associations in databases","volume":"15","author":"Omiecinski","year":"2003","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/j.asoc.2010.07.011_bib0050","series-title":"Proc. ACM SIGMOD Int\u2019l Conf. Management of Data","article-title":"An effective hash-based algorithm for mining association rules","author":"Park","year":"1995"},{"key":"10.1016\/j.asoc.2010.07.011_bib0055","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1109\/69.634757","article-title":"Using a hash-based method with transaction trimming for mining association rules","volume":"9","author":"Park","year":"1997","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/j.asoc.2010.07.011_bib0060","series-title":"Proc. ACM SIGMOD Int\u2019l Conf. on Management of Data","article-title":"Efficiently mining long patterns from databases","author":"Roberto","year":"1998"},{"key":"10.1016\/j.asoc.2010.07.011_bib0065","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/j.datak.2005.09.001","article-title":"Association rules mining in vertically partitioned databases","volume":"59","author":"Rozenberg","year":"2006","journal-title":"Data and Knowledge Engineering"},{"key":"10.1016\/j.asoc.2010.07.011_bib0070","series-title":"Proc. 21th VLDB","article-title":"An efficient algorithm for mining association rules in large database","author":"Savasere","year":"1995"},{"key":"10.1016\/j.asoc.2010.07.011_bib0090","first-page":"1367","article-title":"Mining association rules with composite items","volume":"2","author":"Xinfeng Ye","year":"1997","journal-title":"IEEE Transactions on Computational Cybernetics and Simulation"}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494610001924?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494610001924?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,8]],"date-time":"2018-12-08T22:24:17Z","timestamp":1544307857000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494610001924"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["S1568494610001924"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2010.07.011","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2011,3]]}}}