{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:59:56Z","timestamp":1725890396379},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540676270"},{"type":"electronic","value":"9783540451518"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45151-x_10","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T07:14:10Z","timestamp":1187248450000},"page":"109-120","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Distributed Algorithm for Computing Association Rules"],"prefix":"10.1007","author":[{"given":"Yijun","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chi-Ping","family":"Tsang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,7]]},"reference":[{"issue":"6","key":"10_CR1","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1109\/69.553164","volume":"8","author":"R. Agrawal","year":"1996","unstructured":"R. Agrawal and J. C. Shafer, Parallel Mining of Association Rules: Design, Implementation, and Experience, IEEE Transactions on Knowledge and Data Engineering, 8(6), 962\u2013969, 1996.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10_CR2","unstructured":"R. Agrawal and R. Srikant, Fast Algorithms for Mining Association Rules, Proceedings of the 20th VLDB Conference, 487\u2013499, 1994."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"R. Agrawal and R. Srikant, Mining Sequential Patterns, Proceedings of the 11th International Conference on Data Engineering, 1995.","DOI":"10.1109\/ICDE.1995.380415"},{"issue":"6","key":"10_CR4","doi-asserted-by":"publisher","first-page":"884","DOI":"10.1109\/69.553158","volume":"8","author":"D. W. Cheung","year":"1996","unstructured":"D. W. Cheung, Vincent T. Ng, Ada W. Fu and Y. Fu, Efficient Mining of Association Rules in Distributed Databases, IEEE transactions on Knowledge and Data Engineering, 8(6), 884\u2013897, 1996.","journal-title":"IEEE transactions on Knowledge and Data Engineering"},{"key":"10_CR5","unstructured":"U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy. Advances in Knowledge Discovery and Data Mining, AAA\/MIT Press, 1996."},{"issue":"1\u20134","key":"10_CR6","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0020-0255(99)00068-7","volume":"120","author":"X. Lin","year":"1999","unstructured":"X. Lin, Y. Li and C.P. Tsang, Applying On-Line Bitmap Indexing to Reduce Counting Costs in Mining Association Rules, Information Science, 120(1\u20134), 197\u2013208, 1999.","journal-title":"Information Science"},{"key":"10_CR7","unstructured":"Y. Li, On Efficient Computation of Association Rules, Master Thesis, University of New South Wales, 2000."},{"key":"10_CR8","unstructured":"R. Ng and J. Han, Efficient and Effective Clustering Method for Spatial Data Mining, Proc Int\u2019l Conf. Very Large Data Bases, 144\u2013155, Santiago, Chile, Sept, 1994."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"J. S. Park, M. S. Chen, and P. S. Yu, An Effective Hash-Based Algorithm for Mining Association Rules, Proc. ACM-SIGMOD Int\u2019l Conf. Management of Data, 175\u2013186, 1995.","DOI":"10.1145\/223784.223813"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"J. S. Park, M. S. Chen, and P. S. Yu, Efficient Parallel Data Mining for Association Rules, Proc. Int\u2019l Conf. Information and Knowledge Management, 1995.","DOI":"10.1145\/221270.221320"},{"key":"10_CR11","unstructured":"A. Savasere, E. Omiecinski, and S. Navathe, An Efficient Algorithms for Mining Association Rules in Large Databases, Proc. Int\u2019l Conf. Very Large Data Bases, 432\u2013444, Zurich, Sept. 1995."}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45151-X_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T18:04:22Z","timestamp":1550772262000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45151-X_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676270","9783540451518"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45151-x_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}