Clustering graphs using random trees

Kevin Dalleau 1, 2 Miguel Couceiro 3 Malika Smaïl-Tabbone 3
2 CAPSID - Computational Algorithms for Protein Structures and Interactions
Inria Nancy - Grand Est, LORIA - AIS - Department of Complex Systems, Artificial Intelligence & Robotics
3 ORPAILLEUR - Knowledge representation, reasonning
Inria Nancy - Grand Est, LORIA - NLPKD - Department of Natural Language Processing & Knowledge Discovery
Abstract : In this work-in-progress paper, we present GraphTrees, a novel method that relies on random decision trees to compute pairwise distances between vertices in a graph. We show that our approach is competitive with the state of the art methods in the case of non-attributed graphs in terms of quality of clustering. By extending the use of an already ubiquitous approach-the random trees-to graphs, our proposed approach opens new research directions, by leveraging decades of research on this topic.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/hal-02282207
Contributor : Kevin Dalleau <>
Submitted on : Monday, September 9, 2019 - 6:38:20 PM
Last modification on : Wednesday, September 11, 2019 - 1:18:37 AM

File

GraphClusteringGEM_paper.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02282207, version 1

Citation

Kevin Dalleau, Miguel Couceiro, Malika Smaïl-Tabbone. Clustering graphs using random trees. 2019. ⟨hal-02282207⟩

Share

Metrics

Record views

16

Files downloads

104