{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T04:29:55Z","timestamp":1729657795376,"version":"3.28.0"},"reference-count":10,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,12]]},"DOI":"10.1109\/apscc.2009.5394128","type":"proceedings-article","created":{"date-parts":[[2010,1,26]],"date-time":"2010-01-26T12:34:08Z","timestamp":1264509248000},"page":"163-167","source":"Crossref","is-referenced-by-count":1,"title":["Performance of distributed apriori algorithms on a computational grid"],"prefix":"10.1109","author":[{"given":"Sandeep Singh","family":"Rawat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lakshmi","family":"Rajamani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1133905.1133907"},{"key":"ref3","first-page":"240","article-title":"Three Strategies for Concurrent Processing of Frequent Itemset Queries Using FP-Growth","author":"wojciechowski","year":"2006","journal-title":"KDID"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24768-5_51"},{"key":"ref6","first-page":"487","article-title":"t algorithms for mining association rules","author":"agrawal","year":"1994","journal-title":"Proceedings of 20th VLDB Conference"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000005257.93780.3b"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30075-5_45"},{"journal-title":"Datamining Concepts and Techniques","first-page":"230","year":"2008","key":"ref7"},{"key":"ref2","first-page":"71","article-title":"Association Rules Mining: A Recent Overview","volume":"32","author":"kotsiantis","year":"2006","journal-title":"International Transactions on Computer Science and Engineering"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/3-540-47887-6_13","article-title":"Pruning Redundant Association Rules Using Maximum Entropy Principle","volume":"2336","author":"jaroszewicz","year":"2002","journal-title":"Lecture Notes in Computer Science"},{"key":"ref1","first-page":"1","article-title":"Association Rules Discovery using Grid Services","author":"craus","year":"2005","journal-title":"SETIT"}],"event":{"name":"2009 IEEE Asia-Pacific Services Computing Conference (APSCC)","start":{"date-parts":[[2009,12,7]]},"location":"Singapore, Singapore","end":{"date-parts":[[2009,12,11]]}},"container-title":["2009 IEEE Asia-Pacific Services Computing Conference (APSCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5374429\/5394078\/05394128.pdf?arnumber=5394128","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:06:12Z","timestamp":1497830772000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5394128\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/apscc.2009.5394128","relation":{},"subject":[],"published":{"date-parts":[[2009,12]]}}}