Watersheds on Hypergraphs for Data Clustering

International audienceWe 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