Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Differentially Private Clustering Algorithm for Well-Clustered Graphs

Published 21 Mar 2024 in cs.DS, cs.CR, and cs.LG | (2403.14332v1)

Abstract: We study differentially private (DP) algorithms for recovering clusters in well-clustered graphs, which are graphs whose vertex set can be partitioned into a small number of sets, each inducing a subgraph of high inner conductance and small outer conductance. Such graphs have widespread application as a benchmark in the theoretical analysis of spectral clustering. We provide an efficient ($\epsilon$,$\delta$)-DP algorithm tailored specifically for such graphs. Our algorithm draws inspiration from the recent work of Chen et al., who developed DP algorithms for recovery of stochastic block models in cases where the graph comprises exactly two nearly-balanced clusters. Our algorithm works for well-clustered graphs with $k$ nearly-balanced clusters, and the misclassification ratio almost matches the one of the best-known non-private algorithms. We conduct experimental evaluations on datasets with known ground truth clusters to substantiate the prowess of our algorithm. We also show that any (pure) $\epsilon$-DP algorithm would result in substantial error.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (48)
  1. Better guarantees for k-means and euclidean k-median by primal-dual algorithms. SIAM Journal on Computing, 49(4):FOCS17–97, 2019.
  2. Spectral partitioning: The more eigenvectors, the better. In Proceedings of the 32nd annual ACM/IEEE design automation conference, pp.  195–200, 1995.
  3. Local graph partitioning using pagerank vectors. In 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS’06), pp.  475–486. IEEE, 2006.
  4. On differentially private graph sparsification and applications. Advances in neural information processing systems, 32, 2019.
  5. Laplacian eigenmaps and spectral techniques for embedding and clustering. Advances in neural information processing systems, 14, 2001.
  6. Differentially private correlation clustering. In International Conference on Machine Learning, pp. 1136–1146. PMLR, 2021.
  7. Private estimation algorithms for stochastic block models and mixture models. Advances in Neural Information Processing Systems, 36, 2023.
  8. Testing graph clusterability: Algorithms and lower bounds. In 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp.  497–508. IEEE, 2018.
  9. Near-optimal correlation clustering with privacy. 35:33702–33715, 2022.
  10. Simple and scalable constrained clustering: a generalized spectral method. In Artificial Intelligence and Statistics, pp.  445–454. PMLR, 2016.
  11. A spectral clustering algorithm based on differential privacy preservation. In International Conference on Algorithms and Architectures for Parallel Processing, pp.  397–410. Springer, 2021.
  12. Testing cluster structure of graphs. In Proceedings of the forty-seventh annual ACM symposium on Theory of Computing, pp.  723–732, 2015.
  13. The rotation of eigenvectors by a perturbation. iii. SIAM Journal on Numerical Analysis, 7(1):1–46, 1970.
  14. Spectral concentration and greedy k-clustering. Computational Geometry, 76:19–32, 2019.
  15. Calibrating noise to sensitivity in private data analysis. In Theory of Cryptography: Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006. Proceedings 3, pp.  265–284. Springer, 2006.
  16. Approximating the expansion profile and almost optimal local graph clustering. In 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pp.  187–196. IEEE, 2012.
  17. Partitioning into expanders. In Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, pp.  1256–1266. SIAM, 2014.
  18. Differentially private clustering: Tight approximation ratios. Advances in Neural Information Processing Systems, 33:4040–4054, 2020.
  19. Spectral clustering oracles in sublinear time. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.  1598–1617. SIAM, 2021.
  20. Community detection in sparse networks via grothendieck’s inequality. Probability Theory and Related Fields, 165(3-4):1025–1049, 2016.
  21. Consistent spectral clustering of network block models under local differential privacy. Journal of Privacy and Confidentiality, 12(2), 2022.
  22. Optimal differentially private algorithms for k-means clustering. In Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pp.  395–408, 2018.
  23. On clusterings: Good, bad and spectral. Journal of the ACM (JACM), 51(3):497–515, 2004.
  24. A local search approximation algorithm for k-means clustering. In Proceedings of the eighteenth annual symposium on Computational geometry, pp.  10–18, 2002.
  25. A note on spectral clustering. In 24th Annual European Symposium on Algorithms (ESA’16), volume 57, pp.  1–14, 2016.
  26. Multiway spectral partitioning and higher-order cheeger inequalities. Journal of the ACM (JACM), 61(6):1–30, 2014.
  27. Daogao Liu. Better private algorithms for correlation clustering. In Conference on Learning Theory, pp.  5391–5412. PMLR, 2022.
  28. Segmentation of 3d meshes through spectral clustering. In 12th Pacific Conference on Computer Graphics and Applications, 2004. PG 2004. Proceedings., pp.  298–305. IEEE, 2004.
  29. Contour and texture analysis for image segmentation. International journal of computer vision, 43:7–27, 2001.
  30. Tomohiko Mizutani. Improved analysis of spectral algorithm for clustering. Optimization Letters, 15:1303–1325, 2021.
  31. Differentially private community detection for stochastic block models. In Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvari, Gang Niu, and Sivan Sabato (eds.), Proceedings of the 39th International Conference on Machine Learning, volume 162 of Proceedings of Machine Learning Research, pp.  15858–15894. PMLR, 17–23 Jul 2022.
  32. On spectral clustering: Analysis and an algorithm. Advances in neural information processing systems, 14, 2001.
  33. Smooth sensitivity and sampling in private data analysis. In Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pp.  75–84, 2007.
  34. Pan Peng. Robust clustering oracle and local reconstructor of cluster structure of graphs. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.  2953–2972. SIAM, 2020.
  35. Partitioning well-clustered graphs: Spectral clustering works! In Conference on learning theory, pp.  1423–1455. PMLR, 2015.
  36. Differentially private community detection over stochastic block models with graph sketching. In 2023 57th Annual Conference on Information Sciences and Systems (CISS), pp.  1–6. IEEE, 2023.
  37. Private k-means clustering with stability assumptions. In International Conference on Artificial Intelligence and Statistics, pp.  2518–2528. PMLR, 2020.
  38. Normalized cuts and image segmentation. IEEE Transactions on pattern analysis and machine intelligence, 22(8):888–905, 2000.
  39. Spectral partitioning works: Planar graphs and finite element meshes. In Proceedings of 37th conference on foundations of computer science, pp.  96–105. IEEE, 1996.
  40. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In László Babai (ed.), Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp.  81–90. ACM, 2004.
  41. Kadim Taşdemir. Vector quantization based approximate spectral clustering of large datasets. Pattern Recognition, 45(8):3034–3044, 2012.
  42. Ulrike Von Luxburg. A tutorial on spectral clustering. Statistics and computing, 17:395–416, 2007.
  43. Multi-level low-rank approximation-based spectral clustering for image segmentation. Pattern Recognition Letters, 33(16):2206–2215, 2012.
  44. Differentially private subspace clustering. Advances in Neural Information Processing Systems, 28, 2015.
  45. Differential privacy preserving spectral graph analysis. In Advances in Knowledge Discovery and Data Mining: 17th Pacific-Asia Conference, PAKDD 2013, Gold Coast, Australia, April 14-17, 2013, Proceedings, Part II 17, pp.  329–340. Springer, 2013.
  46. A spectral clustering approach to finding communities in graphs. In Proceedings of the 2005 SIAM international conference on data mining, pp.  274–285. SIAM, 2005.
  47. Self-tuning spectral clustering. Advances in neural information processing systems, 17, 2004.
  48. A local algorithm for finding well-connected clusters. In International Conference on Machine Learning, pp. 396–404. PMLR, 2013.

Summary

No one has generated a summary of this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Summarize

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up for Free