{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:59:53Z","timestamp":1725512393502},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681243"},{"type":"electronic","value":"9783540681250"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68125-0_34","type":"book-chapter","created":{"date-parts":[[2008,5,10]],"date-time":"2008-05-10T07:40:05Z","timestamp":1210405205000},"page":"381-392","source":"Crossref","is-referenced-by-count":6,"title":["Protecting Privacy in Incremental Maintenance for Distributed Association Rule Mining"],"prefix":"10.1007","author":[{"given":"W. K.","family":"Wong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David W.","family":"Cheung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edward","family":"Hung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: VLDB, Santiago, Chile (1994)"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: SIGMOD, Dallas, Texas (2000)","DOI":"10.1145\/342009.335438"},{"key":"34_CR3","unstructured":"IBM Almaden\u00a0Research Center. Synthetic data generation code for association and sequential patterns"},{"key":"34_CR4","unstructured":"Cheung, D.W., Han, J., Ng, V.T., Wong, C.Y.: Maintenance of discovered association rules in large databases: An incremental updating technique. In: ICDE, Washington, DC, USA (1996)"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Cheung, D.W., Lee, S.D., Kao, B.: A general incremental technique for maintaining discovered association rules. In: Database Systems for advanced Applications, Melbourne, Australia (1997)","DOI":"10.1142\/9789812819536_0020"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Cheung, D.W., Ng, V., Fu, A.W., Fu, Y.: Efficient mining of association rules in distributed databases. Special Issue in Data Mining, IEEE Transaction on Knowledge and Data Engineering\u00a08(6) (December 1996)","DOI":"10.1109\/69.553158"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Clifton, C., Kantarcioglu, M., Vaidya, J., Lin, X., Zhu, M.: Tools for privacy preserving distributed data mining. In: ACM SIGKDD Explorations Newsletter (2002)","DOI":"10.1145\/772862.772867"},{"key":"34_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography, May 2004, vol.\u00a02. Weizmann Institute of Science, Israel (2004)"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Ioannidis, I., Grama, A.: An efficient protocol for yao\u2019s millionaires\u2019 problem. In: HICSS, Waikoloa Village, Hawaii (2003)","DOI":"10.1109\/HICSS.2003.1174464"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Kantarcio\u011flu, M., Clifton, C.: Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE Trans. Knowledge Data Eng.\u00a016(4) (July 2004)","DOI":"10.1109\/TKDE.2004.45"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy preserving association rule mining in vertically partitioned data. In: KDD, Edmonton, Alberta, Canada (2002)","DOI":"10.1145\/775047.775142"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Secure set intersection cardinality with application to association rule mining. Journal of Computer Security\u00a013(4) (November 2005)","DOI":"10.3233\/JCS-2005-13401"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: Proceedings of the 27th IEEE Symposium on Foundations of Computer Sciences (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68125-0_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:36:38Z","timestamp":1620016598000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68125-0_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540681243","9783540681250"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68125-0_34","relation":{},"subject":[]}}