{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:53:54Z","timestamp":1764996834594},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401896"},{"type":"electronic","value":"9783540448532"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44853-5_25","type":"book-chapter","created":{"date-parts":[[2007,11,30]],"date-time":"2007-11-30T23:01:31Z","timestamp":1196463691000},"page":"336-342","source":"Crossref","is-referenced-by-count":9,"title":["Privacy Sensitive Distributed Data Mining from Multi-party Data"],"prefix":"10.1007","author":[{"given":"Hillol","family":"Kargupta","sequence":"first","affiliation":[]},{"given":"Kun","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Jessica","family":"Ryan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,5,27]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"R. Agrawal and S. Ramakrishnan. Privacy-preserving data mining. In Proceedings of SIGMOD Conference, pages 439\u2013450, 2000.","key":"25_CR1","DOI":"10.1145\/342009.335438"},{"unstructured":"R. Arriaga and S. Vempala. An algorithmic theory of learning: Robust concepts and random projection. In Proc. of the 40th Foundations of Computer Science, New York, New York, 1999.","key":"25_CR2"},{"unstructured":"M. Kantarcioglu and C. Clifton. Privacy-preserving distributed mining of association rules on horizontally partitioned data, 2002.","key":"25_CR3"},{"key":"25_CR4","series-title":"Technical Report","volume-title":"Random value perturbation: Does it really preserve privacy?","author":"H. Kargupta","year":"2003","unstructured":"H. Kargupta, S. Datta, and K. Sivakumar. Random value perturbation: Does it really preserve privacy? Technical Report TR-CS-03-25, Computer Science and Electrical Engineering Department, University of Maryland, Baltimore County, 2003."},{"key":"25_CR5","series-title":"Technical Report","volume-title":"Random projection and privacy preserving correlation computation from distributed data","author":"H. Kargupta","year":"2003","unstructured":"H. Kargupta, K. Liu, and J. Ryan. Random projection and privacy preserving correlation computation from distributed data. Technical Report TR-CS-03-24, Computer Science and Electrical Engineering Department, University of Maryland, Baltimore County, 2003."},{"unstructured":"H. Kargupta, B. Park, D. Hershberger, and E. Johnson. Collective data mining: A new perspective towards distributed data mining. In Advances in Distributed and Parallel Knowledge Discovery, Eds: Kargupta, Hillol and Chan, Philip. AAAI\/MIT Press, 2000.","key":"25_CR6"},{"unstructured":"R. Hecht-Nielsen. Context vectors: general purpose approximate meaning representations self-organized from raw data. Computational Intelligence: Imitating Life, pages 43\u201356, 1994.","key":"25_CR7"}],"container-title":["Lecture Notes in Computer Science","Intelligence and Security Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44853-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T20:39:15Z","timestamp":1551127155000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44853-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401896","9783540448532"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-44853-5_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}