Watersheds on Hypergraphs for Data Clustering

Abstract : We present a novel extension of watershed cuts to hyper-graphs, 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.
Liste complète des métadonnées

Cited literature [23 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01592155
Contributor : Laurent Najman <>
Submitted on : Friday, September 22, 2017 - 5:01:08 PM
Last modification on : Monday, July 16, 2018 - 4:20:30 PM
Document(s) archivé(s) le : Saturday, December 23, 2017 - 2:15:16 PM

File

main-3.pdf
Files produced by the author(s)

Identifiers

Citation

Fabio Dias, Moussa Mansour, Paola Valdivia, Jean Cousty, Laurent Najman. Watersheds on Hypergraphs for Data Clustering. ISMM 2017 - 13th International Symposium on Mathematical Morphology and Its Applications to Signal and Image Processing, May 2017, Fontainebleau, France. pp.211-221, ⟨10.1007/978-3-319-57240-6_17⟩. ⟨hal-01592155⟩

Share

Metrics

Record views

608

Files downloads

275