Privacy-preserving clustering with high accuracy and low time complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5463, Issue , 2009, Pages 456-470

  Cui, Yingjie ^a   Wong, W K ^a   Cheung, David W ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING RESULTS; DATA PERTURBATION; LINEAR TIME COMPLEXITY; PERFORMANCE STUDY; PRIVACY PRESERVING; PROBLEM OF PRIVACY; REAL DATA SETS; SECURE MULTI-PARTY COMPUTATION; TIME COMPLEXITY; UCI MACHINE LEARNING REPOSITORY;

CLUSTERING ALGORITHMS; CRYPTOGRAPHY;

DATABASE SYSTEMS;

EID: 67650151258     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00887-0_40     Document Type: Conference Paper

References (19)

1. Agrawal, R., Asonov, D., Kantarcioglu, M., Li, Y.: Sovereign Joins. In: IEEE ICDE (2006)
2. Artin, A.: Algebra. Prentice Hall, New Jersey (1991)
3. Bingham, E., Mannila, H.: Random Projection in Dimensionality Reduction: Applications to Image and Text Data. In: ACM SIGKDD (2001)
4. Drineas, P., Frieze, A., Kannan, R., Vempala, S., Vinay, V.: Clustering Large Graphs via the Singular Value Decomposition. Machine Learning 56, 9-33 (2004)
5. Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kauffmann, San Francisco (2001)
6. Huang, Z., Du,W., Chen, B.: Deriving Private Information from Randomized Data. In: ACM SIGMOD (2005)
7. ISO/IEC 14882: 2003(E), p. 562 (2003)
8. Jagannathan, G., Wright, R.: Privacy-Preserving Distributed k-Means Clustering over Arbitrarily Partitioned Data. In: ACM KDD (2005)
9. Johnson,W., Lindenstrauss, J.: Extensions of Lipshitz Mapping Into Hilbert Space. In: Proc.of the Conference in Modern Analysis and Probability. Contemporary Mathematics, vol. 26, pp. 189-206 (1984)
10. Liu, K., Giannella, C.M., Kargupta, H.: An attacker's view of distance preserving maps for privacy preserving data mining. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS, vol. 4213, pp. 297-308. Springer, Heidelberg (2006) (Pubitemid 44617732)
11. Liu, K., Kargupta, H.: Random Projection-Based Multiplicative Data Perturbation for Privacy Preserving Distributed Data Mining. IEEE TKDE 18(1) (2006)
12. Liu, K., Giannella, C., Kargupta, H.: A survey of Attack Techniques on Privacy-Preserving Data Perturbation Methods. In: Privacy-Preserving Data Mining:Models and Algorithms (2007)
13. Lloyd, S.: Least Squares Quantization in Pcm. IEEE Transactions on Information Theory IT-28(2), 129-136 (1982)
14. Meila, M.: Comparing Clusterings - An Axiomatic View. In: ICML (2005)
15. Oliveira, S., Zaiane, O.: Privacy Preserving Clustering By Data Transformation. In: Proceedings of the 18th Brazilian Symposium on Databases, pp. 304-318 (2003)
16. Ward Jr., J.: Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association 58(301) (1963)
17. UCI Machine Learning Repository, http://archive.ics.uci.edu/ml/
18. Vaidya, J., Clifton, C.: Privacy Preserving K-Means Clustering over Vertically Partitioned Data. In: ACM SIGKDD (2003)
19. Yao, A.: How to Generate and Exchange Secrets. In: Proceedings of the 27th IEEE FOCS, pp. 162-167 (1986)