Privacy-preserving distributed clustering using generative models

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2003, Pages 211-218

  Merugu, Srujana ^a   Ghosh, Joydeep ^a  

^a The University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 78149334786     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. D. Agrawal and C. C. Aggarwal. On the design and quantification of privacy preserving data mining algorithms. In Symposium on Principles of Database Systems, 2001.
2. R Agrawal and R. Srikant. Privacy-preserving data mining. In ACM SIGMOD, pages 439-450, 2000.
3. K. S. Azoury and M. K. Warmuth. Relative loss bounds for on-line density estimation with the exponential family of distributions. Machine Learning, 43(3):211-246, 2001.
4. L. Breiman. Bagging predictors. Machine Learning, 24(2):123-140, 1996.
5. T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley, 1991.
6. A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. J. Royal Statistical Society. Series B (Methodological), 39(1):1-38, 1977.
7. I. S. Dhillon and D. S. Modha. A data-clustering algorithm on distributed memory multiprocessors. In ACM SIGKDD, 1999.
8. A. Evfimievski, R. Srikant, R. Agrawal, and J. Gehrke. Privacy preserving mining of association rules. In KDD, 2002.
9. U. M. Fayyad, C. Reina, and P. S. Bradley. Initialization of iterative refinement clustering algorithms. In ICML, pages 194-198, 1998.
10. A. L. N. Fred and A. K. Jain. Data clustering using evidence accumulation. In ICPR, pages IV:276-280, 2002.
11. J. Ghosh. Scalable clustering methods for data mining. In N. Ye, editor, Handbook of Data Mining, pages 247-277. Lawrence Erlbaum, 2003.
12. E. Johnson and H. Kargupta. Collective, hierarchical clustering from distributed, heterogeneous data. In M. Zaki and C. Ho, editors, Large-Scale Parallel KDD Systems, volume 1759 of LNCS, pages 221-244. Springer-Verlag, 1999.
13. Y. Lindell and B. Pinkas. Privacy preserving data mining. LNCS, 1880:36-77, 2000.
14. R. M. Neal. Probabilistic inference using Markov Chain Monte Carlo methods. Technical Report CRG-TR-93-1, Dept. of Computer Science, University of Toronto, 1993.
15. K. Nigam, A. K. Mccallum, S. Thrun, and T. Mitchell. Text classification from labeled and unlabeled documents using EM. Machine Learning, 39(2/3):103-134, 2000. (Pubitemid 30594822)
16. A. Papoulis. Probability, Random Variables, and Stochastic Processes. McGraw-Hill, New York, 1984.
17. P. Smyth and D. Wolpert. An evaluation of linearly combining density estimators via stacking. Machine Learning, 36(1/2):53-89, July 1999.
18. A. Strehl and J. Ghosh. Cluster ensembles - a knowledge reuse framework for combining partitionings. JMLR, pages 3:583-617, 2002.
19. K. Yamanishi. Distributed cooperative Bayesian learning strategies. Information and Computation, 150:22-56, 1998.