{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:23:23Z","timestamp":1725575003167},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540233183"},{"type":"electronic","value":"9783540301325"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30132-5_29","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T02:15:59Z","timestamp":1294971359000},"page":"178-188","source":"Crossref","is-referenced-by-count":1,"title":["A Peer-to-Peer Approach to Parallel Association Rule Mining"],"prefix":"10.1007","author":[{"given":"Hiroshi","family":"Ishikawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasuo","family":"Shioya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeshi","family":"Omi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manabu","family":"Ohta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaoru","family":"Katayama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases. In: Proc.VLDB, pp. 487\u2013499 (1994)"},{"issue":"6","key":"29_CR2","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1109\/69.553164","volume":"8","author":"R. Agrawal","year":"1996","unstructured":"Agrawal, R., Shafer, J.: Parallel Mining of Association Rules. IEEE Trans. Knowledge and Data Eng.\u00a08(6), 962\u2013969 (1996)","journal-title":"IEEE Trans. Knowledge and Data Eng."},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Brin, S., et al.: Dynamic Itemset Counting and Implication Rules for Market Basket Data. In: Proc. ACM SIGMOD Conf. Management of Data, pp. 255\u2013264 (1997)","DOI":"10.1145\/253260.253325"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Cheung, D., Hu, K., Xia, S.: Asynchronous Parallel Algorithm for Mining Association Rules on Shared-Memory Multi-Processors. In: Proc. 10th ACM Symp. Parallel Algorithms and Architectures, pp. 279\u2013288 (1998)","DOI":"10.1145\/277651.277694"},{"key":"29_CR5","unstructured":"DBGen, \n                      \n                        http:\/\/research.microsoft.com\/~Gray\/DBGen\/"},{"key":"29_CR6","volume-title":"The Grid: Blueprint for a New Computing Infrastructure","author":"I. Foster","year":"1999","unstructured":"Foster, I., Kesselman, C.: The Grid: Blueprint for a New Computing Infrastructure. Morgan-Kaufmann, San Francisco (1999)"},{"key":"29_CR7","unstructured":"Gong, L.: Project JXTA: A technology overview. Technical report, SUN Microsystems (2001), \n                      \n                        http:\/\/www.jxta.org\/project\/www\/docs\/TechOverview.pdf"},{"key":"29_CR8","unstructured":"MySQL, \n                      \n                        http:\/\/www.mysql.com\/"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Park, J.S., Chen, M., Yu, P.S.: An Effective Hash Based Algorithm for Mining Association Rules. In: Proc. ACM SIGMOD Conf, pp. 175\u2013186 (1995)","DOI":"10.1145\/223784.223813"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Park, J.S., Chen, M., Yu, P.S.: Efficient Parallel Data Mining for Association Rules. In: Proc. ACM Int\u2019l Conf. Information and Knowledge Management, pp. 31\u201336 (1995)","DOI":"10.1145\/221270.221320"},{"key":"29_CR11","unstructured":"Perl, \n                      \n                        http:\/\/www.perl.com\/"},{"key":"29_CR12","unstructured":"Savasere, A., Omiecinski, E., Navathe, S.B.: An Efficient Algorithm for Mining Association Rules in Large Databases. In: Proc. VLDB, pp. 432\u2013444 (1995)"},{"key":"29_CR13","unstructured":"SETI@HOME, \n                      \n                        http:\/\/setiathome.ssl.berkeley.edu\/"},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1109\/PDIS.1996.568664","volume-title":"Proc. 4th Int\u2019l Conf. Parallel and Distributed Information Systems","author":"T. Shintani","year":"1996","unstructured":"Shintani, T., Kitsuregawa, M.: Hash Based Parallel Algorithms for Mining Association Rules. In: Proc. 4th Int\u2019l Conf. Parallel and Distributed Information Systems, pp. 19\u201330. IEEE, Los Alamitos (1996)"},{"key":"29_CR15","unstructured":"Yang, B., Garcia-Molina, H.: Comparing Hybrid Peer-to-Peer Systems. In: Proc.VLDB, pp. 561\u2013570 (2001)"},{"key":"29_CR16","volume-title":"Proc. Supercomputing 1996","author":"M.J. Zaki","year":"1996","unstructured":"Zaki, M.J., et al.: Parallel Data Mining for Association Rules on Shared-Memory Multi- Processors. In: Proc. Supercomputing 1996, IEEE, Los Alamitos (1996)"}],"container-title":["Lecture Notes in Computer Science","Knowledge-Based Intelligent Information and Engineering Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30132-5_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:49:18Z","timestamp":1620013758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30132-5_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540233183","9783540301325"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30132-5_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}