{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:04:22Z","timestamp":1725573862951},"publisher-location":"Berlin, Heidelberg","reference-count":15,"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_9","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T10:32:42Z","timestamp":1294396362000},"page":"113-124","source":"Crossref","is-referenced-by-count":33,"title":["On Addressing Efficiency Concerns in Privacy-Preserving Mining"],"prefix":"10.1007","author":[{"given":"Shipra","family":"Agrawal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vijay","family":"Krishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayant R.","family":"Haritsa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Agrawal, S., Krishnan, V., Haritsa, J.: Providing Efficiency in Privacy-Preserving Mining, Tech. Rep. TR-2003-02, DSL\/SERC, Indian Institute of Science (2003), \n                    \n                      http:\/\/dsl.serc.iisc.ernet.in\/pub\/TR\/TR-2003-03.pdf"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, D., Aggarwal, C.: On the Design and Quantification of Privacy Preserving Data Mining Algorithms. In: Proc. of 20th ACM Symp. on Principles of Database Systems (May 2001)","DOI":"10.1145\/375551.375602"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proc. of ACM SIGMOD Intl. Conf. on Management of Data (May 1993)","DOI":"10.1145\/170035.170072"},{"key":"9_CR4","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. of 20th Intl. Conf. on Very Large Data Bases (September 1994)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Privacy-Preserving Data Mining. In: Proc. of ACM SIGMOD Intl. Conf. on Management of Data (May 2000)","DOI":"10.1145\/342009.335438"},{"key":"9_CR6","unstructured":"Atallah, M., Bertino, E., Elmagarmid, A., Ibrahim, M., Verykios, V.: Disclosure Limitation of Sensitive Rules. In: Proc. of IEEE Knowledge and Data Engineering Exchange Workshop (November 1999)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Dasseni, E., Verykios, V., Elmagarmid, A., Bertino, E.: Hiding Association Rules by Using Confidence and Support. In: Proc. of 4th Intl. Information Hiding Workshop (April 2001)","DOI":"10.1007\/3-540-45496-9_27"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Evfimievski, A., Srikant, R., Agrawal, R., Gehrke, J.: Privacy Preserving Mining of Association Rules. In: Proc. of 8th ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining (July 2002)","DOI":"10.1145\/775047.775080"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Evfimievski, A., Gehrke, J., Srikant, R.: Limiting Privacy Breaches in Privacy Preserving Data Mining. In: Proc. of ACM Symp. on Principles of Database Systems (June 2003)","DOI":"10.1145\/773153.773174"},{"key":"9_CR10","unstructured":"Kantarcioglu, M., Clifton, C.: Privacy-preserving Distributed Mining of Association Rules on Horizontally Partitioned Data. In: Proc. of ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (June 2002)"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Rizvi, S., Haritsa, J.: Maintaining Data Privacy in Association Rule Mining. In: Proc. of 28th Intl. Conf. on Very Large Databases (August 2002)","DOI":"10.1016\/B978-155860869-6\/50066-4"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Saygin, Y., Verykios, V., Clifton, C.: Using Unknowns to Prevent Discovery of Association Rules. ACM SIGMOD Record\u00a030(4) (2001)","DOI":"10.1145\/604264.604271"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Saygin, Y., Verykios, V., Elmagarmid, A.: Privacy Preserving Association Rule Mining. In: Proc. of 12th Intl. Workshop on Research Issues in Data Engineering (February 2002)","DOI":"10.1109\/RIDE.2002.995109"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy Preserving Association Rule Mining in Vertically Partitioned Data. In: Proc. of 8th ACM SIKGDD Intl. Conf. on Knowledge Discovery and Data Mining (July 2002)","DOI":"10.1145\/775047.775142"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Zheng, Z., Kohavi, R., Mason, L.: Real World Performance of Association Rule Algorithms. In: Proc. of 7th ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining (August 2001)","DOI":"10.1145\/502512.502572"}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T05:04:46Z","timestamp":1553317486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24571-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540210474","9783540245711"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24571-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}