{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:41:38Z","timestamp":1730274098513,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isi.2011.5983998","type":"proceedings-article","created":{"date-parts":[[2011,8,16]],"date-time":"2011-08-16T19:28:09Z","timestamp":1313522889000},"page":"187-191","source":"Crossref","is-referenced-by-count":4,"title":["Privacy preserving two-party k-means clustering over vertically partitioned dataset"],"prefix":"10.1109","author":[{"given":"Zhenmin","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jerzy W.","family":"Jaromczyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"journal-title":"UCI Machine Learning Repository","year":"2007","author":"asuncion","key":"14"},{"key":"11","article-title":"Refining initial points for K-means clusteimg","author":"bradley","year":"1996","journal-title":"Proc 15th ICML"},{"key":"12","article-title":"On private secure scalar product computation for privacy preserving data mining","author":"goethals","year":"2005","journal-title":"Information Security and Cryptography ICISC2004"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014145"},{"key":"2","article-title":"Privacy preserving k-means clustering over vertically partitioned data sets","author":"vaidya","year":"2003","journal-title":"9th ACM SIGKDD"},{"key":"1","article-title":"Privacy preserving data mining","author":"lindell","year":"2000","journal-title":"Advances in Cryptology (crypto'Oo)"},{"key":"10","article-title":"Secure two-party k-means clustering","author":"bunn","year":"2007","journal-title":"14th ACM Conference on Computer and Communication Security"},{"key":"7","article-title":"How to play any mental gamesa completeness theorem for protocols with honesty majority","author":"goldreich","year":"1987","journal-title":"J 9th ACM Symposium on the Theory of Computing"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"5","article-title":"Communication-efficient privacy preserving clustering","volume":"3","author":"jagnnathan","year":"2010","journal-title":"Transaction on Data Privacy"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150477"},{"journal-title":"How to Securely Perform Computations on Secure-shared Data","year":"2007","author":"dan","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656"}],"event":{"name":"2011 IEEE International Conference on Intelligence and Security Informatics (ISI 2011)","start":{"date-parts":[[2011,7,10]]},"location":"Beijing, China","end":{"date-parts":[[2011,7,12]]}},"container-title":["Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5975309\/5983989\/05983998.pdf?arnumber=5983998","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T12:20:28Z","timestamp":1490098828000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5983998\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isi.2011.5983998","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}