Computing Vertex-Vertex Dissimilarities Using Random Trees: Application to Clustering in Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2019

Computing Vertex-Vertex Dissimilarities Using Random Trees: Application to Clustering in Graphs

Abstract

A current challenge in graph clustering is to tackle the issue of complex networks, i.e, graphs with attributed vertices and/or edges. In this paper, we present GraphTrees, a novel method that relies on random decision trees to compute pairwise dissimilarities between vertices in a graph. We show that using different types of trees, it is possible to extend this framework to graphs where the vertices have attributes. While many existing methods that tackle the problem of clustering vertices in an attributed graph are limited to categorical attributes, GraphTrees can handle heterogeneous types of vertex attributes. Moreover, unlike other approaches, the attributes do not need to be preprocessed. We also show that our approach is competitive with well-known methods in the case of non-attributed graphs in terms of quality of clustering, and provides promising results in the case of vertex-attributed graphs. By extending the use of an already well established approach-the random trees-to graphs, our proposed approach opens new research directions, by lever-aging decades of research on this topic.
Fichier principal
Vignette du fichier
GraphTrees-Overleaf.pdf (1.96 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02427563 , version 1 (03-01-2020)

Identifiers

  • HAL Id : hal-02427563 , version 1

Cite

Kevin Dalleau, Miguel Couceiro, Malika Smail-Tabbone. Computing Vertex-Vertex Dissimilarities Using Random Trees: Application to Clustering in Graphs. 2019. ⟨hal-02427563⟩
41 View
91 Download

Share

Gmail Facebook X LinkedIn More