Watersheds on Hypergraphs for Data Clustering

  • Fabio Dias
  • Moussa R. Mansour
  • Paola Valdivia
  • Jean Cousty
  • Laurent Najman
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10225)


We present a novel extension of watershed cuts to hypergraphs, allowing the clustering of data represented as an hypergraph, in the context of data sciences. Contrarily to the methods in the literature, instances of data are not represented as nodes, but as edges of the hypergraph. The properties associated with each instance are used to define nodes and feature vectors associated to the edges. This rich representation is unexplored and leads to a data clustering algorithm that considers the induced topology and data similarity concomitantly. We illustrate the capabilities of our method considering a dataset of movies, demonstrating that knowledge from mathematical morphology can be used beyond image processing, for the visual analytics of network data. More results, the data, and the source code used in this work are available at


Data clustering Hypergraphs Watershed algorithm 



Grants 2016/04391-2, 2014/12815-1, 2015/14426-5, 2013/21779-6, 2013/14089-3, 2011/22749-8 São Paulo Research Foundation (FAPESP). The views expressed are those of the authors and do not reflect the official policy or position of the São Paulo Research Foundation.


  1. 1.
    Aggarwal, C.C., Reddy, C.K.: Data Clustering: Algorithms and Applications. Chapman and Hall/CRC, Boca Raton (2013). ISBN 9781466558212zbMATHGoogle Scholar
  2. 2.
    Bertrand, G.: On topological watersheds. J. Math. Imaging Vis. 22(2–3), 217–230 (2005)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Bretto, A., Gillibert, L.: Hypergraph-Based Image Representation, pp. 1–11. Springer, Heidelberg (2005)zbMATHGoogle Scholar
  4. 4.
    Bulò, S.R., Pelillo, M.: A game-theoretic approach to hypergraph clustering. In: Bengio, Y., Schuurmans, D., Lafferty, J.D., Williams, C.K.I., Culotta, A. (eds.) Advances in Neural Information Processing Systems 22, pp. 1571–1579. Curran Associates Inc., Red Hook (2009)Google Scholar
  5. 5.
    Couprie, C., Grady, L.J., Najman, L., Talbot, H.: Power watershed: a unifying graph-based optimization framework. IEEE Trans. Pattern Anal. Mach. Intell. 33, 1384–1399 (2011)CrossRefGoogle Scholar
  6. 6.
    Couprie, M., Najman, L., Bertrand, G.: Quasi-linear algorithms for the topological watershed. J. Math. Imaging Vis. 22, 231–249 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Cousty, J., Bertrand, G., Couprie, M., Najman, L.: Collapses and watersheds in pseudomanifolds of arbitrary dimension. J. Math. Imaging Vis. 50(3), 261–285 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Cousty, J., Bertrand, G., Najman, L., Couprie, M.: Watershed cuts: minimum spanning forests and the drop of water principle. IEEE Trans. Pattern Anal. Mach. Intell. 31(8), 1362–1374 (2009)CrossRefGoogle Scholar
  9. 9.
    Ducournau, A., Bretto, A.: Random walks in directed hypergraphs and application to semi-supervised image segmentation. Comput. Vis. Image Underst. 120, 91–102 (2014)CrossRefGoogle Scholar
  10. 10.
    Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3), 75–174 (2010)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw. Pract. Exp. 21(11), 1129–1164 (1991)CrossRefGoogle Scholar
  12. 12.
    Jain, A.K.: Data clustering: 50 years beyond k-means. Pattern Recogn. Lett. 31(8), 651–666 (2010)CrossRefGoogle Scholar
  13. 13.
    Leordeanu, M., Sminchisescu, C.: Efficient hypergraph clustering. In: AISTATS (2012)Google Scholar
  14. 14.
    Lotfifar, F., Johnson, M.: A serial multilevel hypergraph partitioning algorithm. arXiv preprint arXiv:1601.01336 (2016)
  15. 15.
    Maaten, L.V.D., Hinton, G.: Visualizing data using t-SNE. J. Mach. Learn. Res. 9, 2579–2605 (2008)zbMATHGoogle Scholar
  16. 16.
    Meyer, F.: Watersheds on weighted graphs. Pattern Recogn. Lett. 47, 72–79 (2014)CrossRefGoogle Scholar
  17. 17.
    Meyer, F., Beucher, S.: Morphological segmentation. J. Vis. Commun. Image Represent. 1(1), 21–46 (1990)CrossRefGoogle Scholar
  18. 18.
    Najman, L., Talbot, H. (eds.): Mathematical Morphology. Wiley-Blackwell, Hoboken (2013)zbMATHGoogle Scholar
  19. 19.
    Passat, N., Ronse, C., Baruthio, J., Armspach, J.-P., Foucher, J.: Watershed and multimodal data for brain vessel segmentation: application to the superior sagittal sinus. Image Vis. Comput. 25(4), 512–521 (2007)CrossRefGoogle Scholar
  20. 20.
    Roerdink, J.B.T.M., Meijster, A.: The watershed transform: definitions, algorithms and parallelization strategies. Fundam. Inform. 41, 187–228 (2000)MathSciNetzbMATHGoogle Scholar
  21. 21.
    Schaeffer, S.E.: Graph clustering. Comput. Sci. Rev. 1(1), 27–64 (2007)CrossRefzbMATHGoogle Scholar
  22. 22.
    Villarreal, S.E.G., Schaeffer, S.E.: Local bilateral clustering for identifying research topics and groups from bibliographical data. Knowl. Inf. Syst. 48(1), 179–199 (2016)CrossRefGoogle Scholar
  23. 23.
    Vincent, L., Soille, P.: Watersheds in digital spaces: an efficient algorithm based on immersion simulations. IEEE Trans. Pattern Anal. Mach. Intell. 13, 583–598 (1991)CrossRefGoogle Scholar
  24. 24.
    Zhou, D., Huang, J., Schölkopf, B.: Learning with hypergraphs: clustering, classification, and embedding. In: NIPS (2006)Google Scholar
  25. 25.
    Zhou, Y., Cheng, H., Yu, J.X.: Graph clustering based on structural/attribute similarities. PVLDB 2, 718–729 (2009)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Fabio Dias
    • 1
  • Moussa R. Mansour
    • 2
    • 3
  • Paola Valdivia
    • 2
    • 4
  • Jean Cousty
    • 5
  • Laurent Najman
    • 5
  1. 1.Tandon School of EngineeringNew York UniversityNew YorkUSA
  2. 2.Instituto de Ciências Matemáticas e de ComputaçãoUniversidade de São PauloSão CarlosBrazil
  3. 3.Jack’s VenturesPerthAustralia
  4. 4.InriaSaclayFrance
  5. 5.Université Paris-Est, LIGM, Equipe A3SI, EsieeChamps-sur-MarneFrance

Personalised recommendations