{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T04:22:56Z","timestamp":1729657376715,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1109\/icacci.2015.7275753","type":"proceedings-article","created":{"date-parts":[[2015,9,28]],"date-time":"2015-09-28T17:27:30Z","timestamp":1443461250000},"page":"1078-1084","source":"Crossref","is-referenced-by-count":1,"title":["An adaptive method for mining frequent itemsets efficiently: An improved header tree method"],"prefix":"10.1109","author":[{"given":"O.","family":"Jamsheela","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Raju G.","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.08.006"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.07.094"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2008.10.027"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835839"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-009-0161-2"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-006-0059-1"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.4018\/jkdb.2010070105"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.10.047"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"1724","DOI":"10.1016\/j.ins.2009.01.010","article-title":"FIUT:A new method for mining frequent itemsets","volume":"179","author":"yuh-jiuantsay","year":"2009","journal-title":"Lnformation Sciences"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2012.05.085"},{"key":"ref8","first-page":"13621374","volume":"39","author":"liu","year":"2012","journal-title":"An improved association rules mining method Expert Systems with Applications"},{"key":"ref7","first-page":"487","article-title":"Fast Algorithms for Mining Association Rules","author":"agrawal","year":"1994","journal-title":"Very Large Data Bases Journal"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2013.10.013"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/342009.335372","author":"han","year":"0","journal-title":"Mining Frequent Patterns without CandidateGeneration SIGMOD ‘00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.phpro.2012.02.224"}],"event":{"name":"2015 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","start":{"date-parts":[[2015,8,10]]},"location":"Kochi, India","end":{"date-parts":[[2015,8,13]]}},"container-title":["2015 International Conference on Advances in Computing, Communications and Informatics (ICACCI)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7259950\/7275573\/07275753.pdf?arnumber=7275753","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T16:23:27Z","timestamp":1498235007000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7275753\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/icacci.2015.7275753","relation":{},"subject":[],"published":{"date-parts":[[2015,8]]}}}