A privacy-sensitive approach to distributed clustering
- 31 March 2005
- journal article
- research article
- Published by Elsevier in Pattern Recognition Letters
- Vol. 26 (4) , 399-410
- https://doi.org/10.1016/j.patrec.2004.08.003
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Clustering with Bregman DivergencesPublished by Society for Industrial & Applied Mathematics (SIAM) ,2004
- Generative model-based clustering of directional dataPublished by Association for Computing Machinery (ACM) ,2003
- Data clustering using evidence accumulationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The inference problemACM SIGKDD Explorations Newsletter, 2002
- A Data-Clustering Algorithm on Distributed Memory MultiprocessorsPublished by Springer Nature ,2002
- On the design and quantification of privacy preserving data mining algorithmsPublished by Association for Computing Machinery (ACM) ,2001
- Relative Loss Bounds for On-Line Density Estimation with the Exponential Family of DistributionsMachine Learning, 2001
- A general probabilistic framework for clustering individuals and objectsPublished by Association for Computing Machinery (ACM) ,2000
- Collective, Hierarchical Clustering from Distributed, Heterogeneous DataPublished by Springer Nature ,2000
- Maximum Likelihood from Incomplete Data Via the EM AlgorithmJournal of the Royal Statistical Society Series B: Statistical Methodology, 1977