Skip to main navigation Skip to search Skip to main content

Graph-based clustering under differential privacy

  • Rafael Pinot
  • , Anne Morvan
  • , Florian Yger
  • , Cédric Gouy-Pailler
  • , Jamal Atif
  • Université Paris Dauphine
  • LIST-DTSI-SLA CEA

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Citations (Scopus)

Abstract

In this paper, we present the first differentially private clustering method for arbitrary-shaped node clusters in a graph. This algorithm takes as input only an approximate Minimum Spanning Tree (MST) T released under weight differential privacy constraints from the graph. Then, the underlying nonconvex clustering partition is successfully recovered from cutting optimal cuts on T. As opposed to existing methods, our algorithm is theoretically well-motivated. Experiments support our theoretical findings.

Original languageEnglish
Title of host publicationUncertainty in Artificial Intelligence - Proceedings of the 34th Conference, UAI 2018
EditorsAmir Globerson, Amir Globerson, Ricardo Silva
PublisherAssociation For Uncertainty in Artificial Intelligence (AUAI)
Pages329-338
Number of pages10
ISBN (Electronic)9781510871601
Publication statusPublished - 1 Jan 2018
Externally publishedYes
Event34th Conference on Uncertainty in Artificial Intelligence, UAI 2018 - Monterey, United States
Duration: 6 Aug 201810 Aug 2018

Publication series

Name34th Conference on Uncertainty in Artificial Intelligence 2018, UAI 2018
Volume1

Conference

Conference34th Conference on Uncertainty in Artificial Intelligence, UAI 2018
Country/TerritoryUnited States
CityMonterey
Period6/08/1810/08/18

Fingerprint

Dive into the research topics of 'Graph-based clustering under differential privacy'. Together they form a unique fingerprint.

Cite this