Unsupervised extremely randomized trees - Archive ouverte HAL Access content directly
Conference Papers Year :

Unsupervised extremely randomized trees

(1) , (1) , (2)


In this paper we present a method to compute dissimilarities on unlabeled data, based on extremely randomized trees. This method, Unsupervised Extremely Randomized Trees, is used jointly with a novel randomized labeling scheme we describe here, and that we call AddCl3. Unlike existing methods such as AddCl1 and AddCl2, no synthetic instances are generated, thus avoiding an increase in the size of the dataset. The empirical study of this method shows that Unsupervised Extremely Randomized Trees with AddCl3 provides competitive results regarding the quality of resulting clusterings, while clearly outperforming previous similar methods in terms of running time.
Fichier principal
Vignette du fichier
unsupervised-extremely-randomized_Dalleau_Couceiro_Smail-Tabbone.pdf (432.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01667317 , version 1 (19-12-2017)
hal-01667317 , version 2 (16-10-2018)


  • HAL Id : hal-01667317 , version 2


Kevin Dalleau, Miguel Couceiro, Malika Smaïl-Tabbone. Unsupervised extremely randomized trees. PAKDD 2018 - The 22nd Pacific-Asia Conference on Knowledge Discovery and Data Mining, May 2018, Melbourne, Australia. ⟨hal-01667317v2⟩
327 View
669 Download


Gmail Facebook Twitter LinkedIn More