Abstract
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 https://github.com/015988/hypershed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aggarwal, C.C., Reddy, C.K.: Data Clustering: Algorithms and Applications. Chapman and Hall/CRC, Boca Raton (2013). ISBN 9781466558212
Bertrand, G.: On topological watersheds. J. Math. Imaging Vis. 22(2–3), 217–230 (2005)
Bretto, A., Gillibert, L.: Hypergraph-Based Image Representation, pp. 1–11. Springer, Heidelberg (2005)
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)
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)
Couprie, M., Najman, L., Bertrand, G.: Quasi-linear algorithms for the topological watershed. J. Math. Imaging Vis. 22, 231–249 (2005)
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)
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)
Ducournau, A., Bretto, A.: Random walks in directed hypergraphs and application to semi-supervised image segmentation. Comput. Vis. Image Underst. 120, 91–102 (2014)
Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3), 75–174 (2010)
Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw. Pract. Exp. 21(11), 1129–1164 (1991)
Jain, A.K.: Data clustering: 50 years beyond k-means. Pattern Recogn. Lett. 31(8), 651–666 (2010)
Leordeanu, M., Sminchisescu, C.: Efficient hypergraph clustering. In: AISTATS (2012)
Lotfifar, F., Johnson, M.: A serial multilevel hypergraph partitioning algorithm. arXiv preprint arXiv:1601.01336 (2016)
Maaten, L.V.D., Hinton, G.: Visualizing data using t-SNE. J. Mach. Learn. Res. 9, 2579–2605 (2008)
Meyer, F.: Watersheds on weighted graphs. Pattern Recogn. Lett. 47, 72–79 (2014)
Meyer, F., Beucher, S.: Morphological segmentation. J. Vis. Commun. Image Represent. 1(1), 21–46 (1990)
Najman, L., Talbot, H. (eds.): Mathematical Morphology. Wiley-Blackwell, Hoboken (2013)
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)
Roerdink, J.B.T.M., Meijster, A.: The watershed transform: definitions, algorithms and parallelization strategies. Fundam. Inform. 41, 187–228 (2000)
Schaeffer, S.E.: Graph clustering. Comput. Sci. Rev. 1(1), 27–64 (2007)
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)
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)
Zhou, D., Huang, J., Schölkopf, B.: Learning with hypergraphs: clustering, classification, and embedding. In: NIPS (2006)
Zhou, Y., Cheng, H., Yu, J.X.: Graph clustering based on structural/attribute similarities. PVLDB 2, 718–729 (2009)
Acknowledgments
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.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Dias, F., Mansour, M.R., Valdivia, P., Cousty, J., Najman, L. (2017). Watersheds on Hypergraphs for Data Clustering. In: Angulo, J., Velasco-Forero, S., Meyer, F. (eds) Mathematical Morphology and Its Applications to Signal and Image Processing. ISMM 2017. Lecture Notes in Computer Science(), vol 10225. Springer, Cham. https://doi.org/10.1007/978-3-319-57240-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-57240-6_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-57239-0
Online ISBN: 978-3-319-57240-6
eBook Packages: Computer ScienceComputer Science (R0)