Skip to main content

Privacy Preserving Expectation Maximization (EM) Clustering Construction

  • Conference paper
  • First Online:
Distributed Computing and Artificial Intelligence, 15th International Conference (DCAI 2018)

Abstract

This paper presents a framework for secure Expectation Maximization (EM) clustering construction over partitioned data. It is assumed that data is distributed among several (more than two) parties either horizontally or vertically, such that for mutual benefits all the parties are willing to identify clusters on their data as a whole, but for privacy restrictions, they avoid to share their datasets. To this end, in this study general algorithms based on secure sum is proposed to securely compute the desired criteria in constructing clusters’ scheme.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Berkhin, P.: A survey of clustering data mining techniques. In: Kogan, J., Nicholas, C., Teboulle, M. (eds.) Grouping Multidimensional Data, pp. 25–71. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  2. Hamidi, M., Sheikhalishahi, M., Martinelli, F.: A secure distributed framework for agglomerative hierarchical clustering construction. In: Proceedings of 26th PDP 2018 Parallel, Distributed, and Network-Based Processing (2018)

    Google Scholar 

  3. Hamidi, M., Sheikhalishahi, M., Martinelli, F.: Secure two-party agglomerative hierarchical clustering construction. In: Proceedings of 4th ICISSP 2018 International Conference on Information Systems Security and Privacy (2018)

    Google Scholar 

  4. Jagannathan, G., Pillaipakkamnatt, K., Wright, R.N.: A new privacy-preserving distributed k-clustering algorithm. In: SDM, pp. 494–498. SIAM (2006)

    Chapter  Google Scholar 

  5. Jagannathan, G., Wright, R.N.: Privacy-preserving distributed k-means clustering over arbitrarily partitioned data. In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining KDD 2005, pp. 593–599. ACM, New York (2005)

    Google Scholar 

  6. Benaloh, J.C.: Secret sharing homomorphisms: keeping shares of a secret. In: Proceedings of the 14th ACM Conference on Computer and Communications Security CCS 2007 (1987)

    Google Scholar 

  7. Jha, S., Kruger, L., McDaniel, P.: Privacy Preserving Clustering, pp. 397–417. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Lin, X., Clifton, C., Zhu, M.Y.: Privacy-preserving clustering with distributed EM mixture modeling. Knowl. Inf. Syst. 8(1), 68–81 (2005)

    Article  Google Scholar 

  9. Martinelli, F., Saracino, A., Sheikhalishahi, M.: Modeling privacy aware information sharing systems: a formal and general approach. In: Proceedings of 2016 IEEE Trustcom/BigDataSE/ISPA, Tianjin, China, pp. 767–774, 23–26 August 2016

    Google Scholar 

  10. Sheikh, R., Kumar, B., Mishra, D.K.: A distributed k-secure sum protocol for secure multi-party computations. CoRR abs/1003.4071 (2010)

    Google Scholar 

  11. Sheikhalishahi, M., Martinelli, F.: Privacy preserving clustering over horizontal and vertical partitioned data. In: Proceedings of 2017 IEEE Symposium on Computers and Communications, ISCC 2017, Heraklion, Greece, pp. 1237–1244, 3–6 July 2017

    Google Scholar 

  12. Sheikhalishahi, M., Martinelli, F.: Privacy preserving hierarchical clustering over multi-party data distribution. In: Proceedings of 10th International Conference on Security, Privacy, and Anonymity in Computation, Communication, and Storage SpaCCS 2017, pp. 530–544 (2017)

    Chapter  Google Scholar 

  13. Sheikhalishahi, M., Martinelli, F.: Privacy-utility feature selection as a privacy mechanism in collaborative data classification. In: Proceedings of 26th IEEE International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises, WETICE 2017, pp. 244–249 (2017)

    Google Scholar 

  14. Vaidya, J., Clifton, C.: Privacy-preserving k-means clustering over vertically partitioned data. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining KDD 2003, pp. 206–215. ACM, New York (2003)

    Google Scholar 

Download references

Acknowledgment

This work was supported by the H2020 EU funded project C3ISP [GA #700294].

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mina Sheikhalishahi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Hamidi, M., Sheikhalishahi, M., Martinelli, F. (2019). Privacy Preserving Expectation Maximization (EM) Clustering Construction. In: De La Prieta, F., Omatu, S., Fernández-Caballero, A. (eds) Distributed Computing and Artificial Intelligence, 15th International Conference. DCAI 2018. Advances in Intelligent Systems and Computing, vol 800. Springer, Cham. https://doi.org/10.1007/978-3-319-94649-8_31

Download citation

Publish with us

Policies and ethics