Skip to Main content Skip to Navigation
Conference papers

End-to-End Similarity Learning and Hierarchical Clustering for unfixed size datasets

Abstract : Hierarchical clustering (HC) is a powerful tool in data analysis since it allows discovering patterns in the observed data at different scales. Similarity-based HC methods take as input a fixed number of points and the matrix of pairwise similarities and output the dendrogram representing the nested partition. However, in some cases, the entire dataset cannot be known in advance and thus neither the relations between the points. In this paper, we consider the case in which we have a collection of realizations of a random distribution, and we want to extract a hierarchical clustering for each sample. The number of elements varies at each draw. Based on a continuous relaxation of Dasgupta's cost function, we propose to integrate a triplet loss function to Chami's formulation in order to learn an optimal similarity function between the points to use to compute the optimal hierarchy. Two architectures are tested on four datasets as approximators of the similarity function. The results obtained are promising and the proposed method showed in many cases good robustness to noise and higher adaptability to different datasets compared with the classical approaches.
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03228070
Contributor : Santiago Velasco-Forero <>
Submitted on : Monday, May 17, 2021 - 6:06:58 PM
Last modification on : Sunday, May 23, 2021 - 3:10:49 AM
Long-term archiving on: : Wednesday, August 18, 2021 - 7:03:40 PM

File

GSI2021_Gigli.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-03228070, version 1

Citation

Leonardo Gigli, Beatriz Marcotegui, Santiago Velasco-Forero. End-to-End Similarity Learning and Hierarchical Clustering for unfixed size datasets. 5th conference on Geometric Science of Information, Jul 2021, Paris, France. ⟨hal-03228070⟩

Share

Metrics

Record views

988

Files downloads

80