{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:50:12Z","timestamp":1729637412652,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,6]]},"DOI":"10.1109\/ijcnn.2008.4633859","type":"proceedings-article","created":{"date-parts":[[2008,9,29]],"date-time":"2008-09-29T16:31:26Z","timestamp":1222705886000},"page":"628-632","source":"Crossref","is-referenced-by-count":2,"title":["Graph theoretic based algorithm for mining frequent patterns"],"prefix":"10.1109","author":[{"given":"R. S.","family":"Thakur","sequence":"first","affiliation":[]},{"given":"R. C.","family":"Jain","sequence":"additional","affiliation":[]},{"given":"K. R.","family":"Pardasani","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"year":"0","key":"15"},{"key":"13","first-page":"19","article-title":"text document categorization by term association","author":"antonie","year":"2002","journal-title":"IEEE Int Conf Data Mining"},{"journal-title":"Graph Theory with Applications to Engineering and Computer Science","year":"2006","author":"deo","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2000.839445"},{"key":"3","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1006\/jpdc.2000.1693","article-title":"a tree projection algorithm. for generation of frequent itemsets","volume":"61","author":"agrawal","year":"2001","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"2","first-page":"307","article-title":"fast discovery of association rules","author":"agrawal","year":"1996","journal-title":"Advance in Knowledge Discovery and Data Mining"},{"year":"0","key":"1"},{"key":"10","first-page":"432","article-title":"an efficient algorithm for mining association rules in large databases","author":"sarasere","year":"1995","journal-title":"Proc"},{"key":"7","first-page":"398","article-title":"discovering frequent closed itemsets for association, rules","author":"pasquier","year":"1999","journal-title":"ICDT'99"},{"year":"0","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"year":"0","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000023674.74932.4c"},{"year":"0","key":"8"}],"event":{"name":"2008 IEEE International Joint Conference on Neural Networks (IJCNN 2008 - Hong Kong)","start":{"date-parts":[[2008,6,1]]},"location":"Hong Kong, China","end":{"date-parts":[[2008,6,8]]}},"container-title":["2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4625775\/4633757\/04633859.pdf?arnumber=4633859","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T08:10:00Z","timestamp":1497773400000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4633859\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/ijcnn.2008.4633859","relation":{},"subject":[],"published":{"date-parts":[[2008,6]]}}}