• Aucun résultat trouvé

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

N/A
N/A
Protected

Academic year: 2021

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

Copied!
14
0
0

Texte intégral

Loading

Figure

Fig. 1. Example of partitioning of 8 instances in non-overlapping non-empty regions using a random tree structure
Table 1. Datasets used for the evaluation of clustering on simple graphs using graph-trees
Table 2. Mean difference between intercluster and intracluster similarities in different settings.
Fig. 2. Projection of the vertices obtained using GT on (left) a random graph, (mid- (mid-dle) an SBM generated graph (mid(mid-dle) and (right) the football graph
+3

Références

Documents relatifs

We give an alternative proof of the fact that the vertex reinforced jump process on Galton- Watson tree has a phase transition between recurrence and transience as a function of c,

- Les interaction médicamenteuses qui peuvent avoir lieu en cas de polythérapie aussi peuvent être à l’origine de changement de concentrations de ces médicaments , pour

We compute the number of circuits and of loops with multiple crossings in random regular graphs.. We discuss the importance of this issue for the validity of the

In fact, recalling Lyons-Pemantle’s criterion for recur- rence/transience of a random walk in random environment (RWRE) on a Galton-Watson tree (see Theorem 3 of [10]), Theorem

Fog computing platforms must carefully control the number and placement of application replicas to ensure guaranteed proximity between the users and the replicas serving their

Ainsi, après avoir présenté le protocole et les principaux résultats issus des mesures, dans les chapitres précédents, nous avons cherché comment utiliser ces résultats pour

To address the points mentioned above we combined Aerial Laser Scan over the experimental station of Paracou in French Guiana, with synchronous ground inventory data and linked

We also present an approximation algorithm of a tree by a self-nested one that can be used in fast prediction of edit distance between two trees..