{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:50:45Z","timestamp":1764132645650,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/fskd.2011.6019699","type":"proceedings-article","created":{"date-parts":[[2011,9,22]],"date-time":"2011-09-22T15:43:18Z","timestamp":1316706198000},"page":"1206-1211","source":"Crossref","is-referenced-by-count":4,"title":["Privacy preserving spectral clustering over vertically partitioned data sets"],"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":"19","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301312"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.21"},{"key":"17","article-title":"Building decision tree classifier on private data","author":"du","year":"2002","journal-title":"Proc IEEE ICDM Workshop Privacy Security and Data Mining"},{"key":"23","article-title":"The effectiveness of Llyod-Type methods for k-means problem","author":"ostrovsky","year":"2006","journal-title":"42nd IEEE symposium on Foundations of Computer Science"},{"key":"18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-30576-7_16","article-title":"Secure computation of the mean and related statistics","volume":"3378","author":"kiltz","year":"2005","journal-title":"Theory of Cryptographic Conference Lecture Notes in Computer Science"},{"key":"24","article-title":"Secure direct and iterative protocols for solving systems of linear equations","author":"pastoriza","year":"2009","journal-title":"Speedup"},{"journal-title":"How to Securely Perform Computations on Secure-shared Data","year":"2007","author":"bogdanov","key":"15"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.217"},{"key":"13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-88192-6_17","article-title":"A distributed privacy preserving assoication rules mining scheme using frequent-pattern tree","volume":"5139","author":"su","year":"2008","journal-title":"Advanced Data Mining and Applications Lecture Notes in Computer Science"},{"key":"14","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":"11","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150477"},{"key":"12","doi-asserted-by":"crossref","first-page":"4","DOI":"10.3233\/JCS-2005-13401","article-title":"Secure set intersection cardinality with application to association rule mining","volume":"13","author":"vaidya","year":"2005","journal-title":"Journal of Computer Security"},{"journal-title":"Numerical Analysis Mathematics of Scientific Computing","year":"2002","author":"kincaid","key":"21"},{"key":"3","article-title":"Secure two-party k-means clustering","author":"bunn","year":"2007","journal-title":"14th ACM Conference on Computer and Communication Security"},{"journal-title":"Computational Methods for Matrix Eigenproblems","year":"1973","author":"gourlay","key":"20"},{"key":"2","article-title":"Privacy preserving k-means clustering over vertically partitioned data sets","author":"jaideep","year":"2003","journal-title":"9th ACM SIGKDD"},{"journal-title":"A Tutorial on Spectral Clustering","year":"0","author":"von luxburg","key":"1"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2008.79"},{"key":"7","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-44598-6_3","article-title":"Privacy preserving data mining","author":"lindell","year":"2000","journal-title":"Proc Advances in Cryptology (CRYPTO '00)"},{"key":"6","article-title":"How to play any mental gamesa completeness theorem for protocols with honesty majority","author":"goldreich","year":"1987","journal-title":"19th ACM Symposium on the Theory of Computing"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"key":"4","article-title":"Communication-efficient privacy preserving clustering","volume":"3","author":"jagnnathan","year":"2010","journal-title":"Transaction on Data Privacy"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014145"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"}],"event":{"name":"2011 Eighth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2011)","start":{"date-parts":[[2011,7,26]]},"location":"Shanghai","end":{"date-parts":[[2011,7,28]]}},"container-title":["2011 Eighth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6012258\/6019624\/06019699.pdf?arnumber=6019699","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T02:24:26Z","timestamp":1560651866000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6019699\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/fskd.2011.6019699","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}