Spectrum-Centric Differential Privacy for Hypergraph Spectral Clustering

  • Xiaochun Wang
  • Yidong LiEmail author
  • Yi Jin
  • Wei Wang
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 931)


In real world, most of complex networks can be represented by hypergraphs. Hypergraph spectral clustering has drawn wide attention in recent years due to it is more suitable to describe high-order information between objects. In this paper, we focus on the spectrum of hypergraph-based complex networks, propose a spectrum-centric differential privacy scheme by using stochastic matrix perturbation. The main idea is to project the hypergraph Laplacian matrix into a low dimensional space and perturb the eigenvector with random noise. We present a differential privacy mechanism for hypergraph clustering based on the exponential mechanism. We evaluated the computational efficiency and data utility of the existing methods on both synthetic datasets and real datasets, and the experimental results reveal that our proposed mechanism achieves a better performance in both data utility and efficiency.


Differential privacy Information security Hypergraph Spectral clustering 



This work is supported by National Science Foundation of China Grant #61672088, Fundamental Research Funds for the Central Universities #2016JBM022 and #2015ZBJ007.


  1. 1.
    Narayanan, A., Shmatikov, V.: De-anonymizing social networks. In: 2009 30th IEEE Symposium on Security and Privacy, pp. 173–187. IEEE (2009)Google Scholar
  2. 2.
    Dwork, C.: Differential privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006, Part II. LNCS, vol. 4052, pp. 1–12. Springer, Heidelberg (2006). Scholar
  3. 3.
    Pihur, V., Korolova, A.: RAPPOR: randomized aggregatable privacy-preserving ordinal response. In: ACM SIGSAC Conference on Computer and Communications Security, pp. 1054–1067. ACM (2014)Google Scholar
  4. 4.
    Li, Y., Wu, X., Lu, A.: Analysis of spectral space properties of directed graphs using matrix perturbation theory with application in graph partition, pp. 847–852 (2015)Google Scholar
  5. 5.
    Kasiviswanathan, S.P., Nissim, K., Raskhodnikova, S.: Analyzing graphs with node differential privacy 7785, 457–476 (2013)Google Scholar
  6. 6.
    Day, W.-Y., Li, N., Lyu, M.: Publishing graph degree distribution with node differential privacy. In: Proceedings of the 2016 International Conference on Management of Data, SIGMOD 2016, pp. 123–138. ACM, New York (2016)Google Scholar
  7. 7.
    Wang, Y., Xintao, W.: Preserving differential privacy in degree correlation based graph generation. Trans. Data Privacy 6(2), 127 (2013)MathSciNetGoogle Scholar
  8. 8.
    Michoel, T., Nachtergaele, B.: Alignment and integration of complex networks by hypergraph-based spectral clustering. Phys. Rev. E 86(5), 056111 (2012)CrossRefGoogle Scholar
  9. 9.
    Seary, A.J., Richards, W.D.: Spectral methods for analyzing and visualizing networks: an introduction. na (2003)Google Scholar
  10. 10.
    Chen, R., Fung, B.C., Yu, P.S., Desai, B.C.: Correlated network data publication via differential privacy. VLDB J. 23(4), 653–676 (2014)CrossRefGoogle Scholar
  11. 11.
    Dwork, C., Mcsherry, F., Nissim, K.: Calibrating noise to sensitivity in private data analysis. Proc. VLDB Endowment 7(8), 637–648 (2006)zbMATHGoogle Scholar
  12. 12.
    Chaudhuri, K., Sarwate, A., Sinha, K.: Near-optimal differentially private principal components. In: Advances in Neural Information Processing Systems, pp. 989–997 (2012)Google Scholar
  13. 13.
    Kapralov, M., Talwar, K.: On differentially private low rank approximation. In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1395–1414. SIAM (2013)Google Scholar
  14. 14.
    Ahmed, F., Jin, R., Liu, A.X.: A random matrix approach to differential privacy and structure preserved social network graph publishing. arXiv preprint arXiv:1307.0475 (2013)
  15. 15.
    Wang, T., Blocki, J., Li, N., et al.: Locally differentially private protocols for frequency estimation. In: Proceedings of the 26th USENIX Security Symposium, pp. 729–745 (2017)Google Scholar
  16. 16.
    Mcsherry, F., Talwar, K.: Mechanism design via differential privacy. In: 2007 IEEE Symposium on Foundations of Computer Science, FOCS 2007, pp. 94–103 (2007)Google Scholar
  17. 17.
    Mcsherry, F.D.: Privacy integrated queries: an extensible platform for privacy-preserving data analysis. Commun. ACM 53(9), 89–97 (2010)CrossRefGoogle Scholar
  18. 18.
    Hoffman, A.J., Wielandt, H.W.: The variation of the spectrum of a normal matrix. In: Selected Papers of Alan J Hoffman: With Commentary, pp. 118–120. World Scientific (2003)Google Scholar
  19. 19.
    Stewart, G.W.: Stochastic perturbation theory. SIAM Rev. 32(4), 579–610 (1990)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.School of Computer and Information TechnologyBeijing Jiaotong UniversityBeijingChina

Personalised recommendations