Dirichlet Graph Densifiers

  • Francisco EscolanoEmail author
  • Manuel Curado
  • Miguel A. Lozano
  • Edwin R. Hancook
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10029)


In this paper, we propose a graph densification method based on minimizing the combinatorial Dirichlet integral for the line graph. This method allows to estimate meaningful commute distances for mid-size graphs. It is fully bottom up and unsupervised, whereas anchor graphs, the most popular alternative, are top-down. Compared with anchor graphs, our method is very competitive (it is only outperformed for some choices of the parameters, namely the number of anchors). In addition, although it is not a spectral technique our method is spectrally well conditioned (spectral gap tends to be minimized). Finally, it does not rely on any pre-computation of cluster representatives.


Graph densification Dirichlet problems Random walkers 


  1. 1.
    Alamgir, M., von Luxburg, U.: Shortest path distance in random k-nearest neighbor graphs. In: Proceedings of the 29th International Conference on Machine Learning, ICML 2012, Edinburgh, Scotland, UK, 26 June–1 July 2012 (2012)Google Scholar
  2. 2.
    Cai, D., Chen, X.: Large scale spectral clustering via landmark-based sparse representation. IEEE Trans. Cybern. 45(8), 1669–1680 (2015)CrossRefGoogle Scholar
  3. 3.
    Grady, L.: Random walks for image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 28(11), 1768–1783 (2006)CrossRefGoogle Scholar
  4. 4.
    Hardt, M., Srivastava, N., Tulsiani, M.: Graph densification. In: Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA, 8–10 January 2012, pp. 380–392 (2012)Google Scholar
  5. 5.
    Khoa, N.L.D., Chawla, S.: Large scale spectral clustering using approximate commute time embedding. CoRR abs/1111.4541 (2011)Google Scholar
  6. 6.
    Khoa, N.L.D., Chawla, S.: Large scale spectral clustering using resistance distance and spielman-teng solvers. In: Ganascia, J.-G., Lenca, P., Petit, J.-M. (eds.) DS 2012. LNCS (LNAI), vol. 7569, pp. 7–21. Springer, Heidelberg (2012). doi: 10.1007/978-3-642-33492-4_4 CrossRefGoogle Scholar
  7. 7.
    Liu, W., He, J., Chang, S.: Large graph construction for scalable semi-supervised learning. In: Proceedings of the 27th International Conference on Machine Learning (ICML 2010), 21–24 June 2010, Haifa, Israel, pp. 679–686 (2010)Google Scholar
  8. 8.
    Liu, W., Wang, J., Chang, S.: Robust and scalable graph-based semisupervised learning. Proc. IEEE 100(9), 2624–2638 (2012)CrossRefGoogle Scholar
  9. 9.
    Liu, W., Wang, J., Kumar, S., Chang, S.: Hashing with graphs. In: Proceedings of the 28th International Conference on Machine Learning, ICML 2011, Bellevue, Washington, USA, 28 June–2 July 2011, pp. 1–8 (2011)Google Scholar
  10. 10.
    Luo, Z.Q., Ma, W.K., So, A.M.C., Ye, Y., Zhang, S.: Semidefinite relaxation of quadratic optimization problems. IEEE Sig. Process. Mag. 27(3), 20–34 (2010)CrossRefGoogle Scholar
  11. 11.
    Qiu, H., Hancock, E.R.: Clustering and embedding using commute times. IEEE Trans. Pattern Anal. Mach. Intell. 29(11), 1873–1890 (2007)CrossRefGoogle Scholar
  12. 12.
    Spielman, D.A., Srivastava, N.: Graph sparsification by effective resistances. SIAM J. Comput. 40(6), 1913–1926 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    von Luxburg, U., Radl, A., Hein, M.: Hitting and commute times in large random neighborhood graphs. J. Mach. Learn. Res. 15(1), 1751–1798 (2014)MathSciNetzbMATHGoogle Scholar
  14. 14.
    Weiss, Y., Torralba, A., Fergus, R.: Spectral hashing. In: Advances in Neural Information Processing Systems 21, Proceedings of the Twenty-Second Annual Conference on Neural Information Processing Systems, Vancouver, British Columbia, Canada, 8–11 December 2008, pp. 1753–1760 (2008)Google Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  • Francisco Escolano
    • 1
    Email author
  • Manuel Curado
    • 1
  • Miguel A. Lozano
    • 1
  • Edwin R. Hancook
    • 2
  1. 1.Department of Computer Science and AIUniversity of AlicanteAlicanteSpain
  2. 2.Department of Computer ScienceUniversity of YorkYorkUK

Personalised recommendations