{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:15:08Z","timestamp":1725574508612},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540210474"},{"type":"electronic","value":"9783540245711"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24571-1_35","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T10:32:42Z","timestamp":1294396362000},"page":"381-392","source":"Crossref","is-referenced-by-count":6,"title":["Reducing Communication Cost in a Privacy Preserving Distributed Association Rule Mining"],"prefix":"10.1007","author":[{"given":"Mafruz Zaman","family":"Ashrafi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Taniar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kate","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Parallel and Distributed Association Mining: A Survey. IEEE Concurrency (October-December 1999)","DOI":"10.1109\/4434.806975"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Rizvi, S.J., Haritsa, J.R.: Maintaining Data Privacy in Association Rule Mining. In: Proc. of 20th International Conference on Very Large Databases, Hong Kong (2002)","DOI":"10.1016\/B978-155860869-6\/50066-4"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Evfimievski, A., Srikant, R., Agrawal, R., Gehrke, J.: Privacy Preserving Mining Association Rules. In: Proc. of the SIGKDDD 2002 (2002)","DOI":"10.1145\/775047.775080"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy Preserving Association Rule Mining in Vertically Partitioned Data. In: Proc. of ACM SIGKDD (July 2002)","DOI":"10.1145\/775047.775142"},{"key":"35_CR5","unstructured":"Kantercioglu, M., Clifton, C.: Privacy Preserving Distributed Mining of Association Rules on Horizontal Partitioned Data. In: Proc. of DMKD (2002)"},{"key":"35_CR6","unstructured":"Atallah, M., Bertino, E., Elmagarmid, A., Ibrahim, M., Verykios, V.: Disclosure Limitation of Sensitive Rules. In: Proc. of the KDEX (November 1999)"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Dasseni, E., Verykios, V.S., Elmagarmid, A.K., Bertino, E.: Hiding Association Rules by Using Confidence and Support. In: Proc. of the Intl. Info. Hiding Workshop(IHW) (April 2001)","DOI":"10.1007\/3-540-45496-9_27"},{"issue":"6","key":"35_CR8","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1109\/69.553164","volume":"8","author":"R. Agrawal","year":"1996","unstructured":"Agrawal, R., Shafer, J.C.: Parallel Mining of Association Rules. IEEE Transactions on Knowledge and Data Engineering\u00a08(6), 962\u2013969 (1996)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Cheung, D.W., Ng, V.T., Fu, A.W., Fu, Y.: Efficient Mining of Association Rules in Distributed Databases. In: IEEE TKDE, vol.\u00a08(6), pp. 911\u2013922 (1996)","DOI":"10.1109\/69.553158"},{"key":"35_CR10","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Database. In: Proc. of the 2oth Intl. Conf. on Very Large Databases, pp. 407\u2013419 (1994)"},{"key":"35_CR11","unstructured":"Goldriech, O.: Secure Multipart Computation Working Draft Version 1.3 (June 2001)"},{"key":"35_CR12","unstructured":"Blake, C.L., Merz, C.J.: UCI Repository of Machine Learning Databases, University of California, Irvine (1998) www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Kohavi, R., Broadley, C., Frasca, B., Mason, L., Zheng, Z.: KDD-Cup 2000 organizers report: Peeling the onion. In: SIGKDD Explorations, vol.\u00a02(2), pp. 86\u201398 (2000), http:\/\/www.ecn.purdue.edu\/KDDCUP\/","DOI":"10.1145\/380995.381033"},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"Schuster, A., Wolff, R.: Communication-Efficient Distributed Mining of Association Rules. In: Proc. ACM SIGMOD, Santa Barbara,","DOI":"10.1145\/375663.375728"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24571-1_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T13:42:09Z","timestamp":1559914929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24571-1_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540210474","9783540245711"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24571-1_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}