Citation Context

...n the labels information. Graph visualization is a standard data mining tool to help the user understand the network. Standard approach are force directed placement algorithms as those introduced in [=-=Fruchterman and Reingold, 1991-=-] • attractive forces : along the edges (similar to springs) • repulsive forces : between all pairs of vertices (similar to electric forces) iterative algorithm until stabilization of the nodes positi...

Citation Context

...seen as a clustering⇒ use visualization approach that allows the nodes with the same labels to be displayed close to each others. • Modified force directed placement algorithms [Bourqui et al., 2007, =-=Eades and Feng, 1996-=-, Eades and Huang, 2000, Truong et al., 2007]: integrate additional constraints into forces or constrain vertices to be displayed in a given zone, according to their clusters; • Use of latent variable...

Citation Context

...use visualization approach that allows the nodes with the same labels to be displayed close to each others. • Modified force directed placement algorithms [Bourqui et al., 2007, Eades and Feng, 1996, =-=Eades and Huang, 2000-=-, Truong et al., 2007]: integrate additional constraints into forces or constrain vertices to be displayed in a given zone, according to their clusters; • Use of latent variables All these approaches:...

Citation Context

...the nodes with the same labels to be displayed close to each others. • Modified force directed placement algorithms The graph can be displayed in a simplified way (one “meta-node” per cluster) as in [=-=Rossi and Villa-Vialaneix, 2011-=-]. • Use of latent variables All these approaches: • only consider the node’s label and do not use the neighbors’ labels; • do not deal with multiple labels. Labeled graphs data analysis (JdS 2012) Na...

Citation Context

...ach that allows the nodes with the same labels to be displayed close to each others. • Modified force directed placement algorithms [Bourqui et al., 2007, Eades and Feng, 1996, Eades and Huang, 2000, =-=Truong et al., 2007-=-]: integrate additional constraints into forces or constrain vertices to be displayed in a given zone, according to their clusters; • Use of latent variables All these approaches: • only consider the ...

Citation Context

...n idea: Labels can be seen as a clustering⇒ use visualization approach that allows the nodes with the same labels to be displayed close to each others. • Modified force directed placement algorithms [=-=Bourqui et al., 2007-=-, Eades and Feng, 1996, Eades and Huang, 2000, Truong et al., 2007]: integrate additional constraints into forces or constrain vertices to be displayed in a given zone, according to their clusters; • ...

Citation Context

...dom distribution over the network. Labeled graphs data analysis (JdS 2012) Nathalie Villa-Vialaneix & Thibault Laurent Bruxelles, 05/23/2012 6 / 18 Framework First approach: Use of “spatial” indexes [=-=Laurent and Villa-Vialaneix, 2011-=-], by identifying • the spatial matrix (in spatial data) • the adjacency matrix (in network) calculate JC = 1 2 ∑ i,j Wijξiξj and a MC permutation test helps measuring the strength of the link between...

Citation Context

... as a clustering⇒ use visualization approach that allows the nodes with the same labels to be displayed close to each others. • Modified force directed placement algorithms • Use of latent variables [=-=Bouveyron et al., 2009-=-] All these approaches: • only consider the node’s label and do not use the neighbors’ labels; • do not deal with multiple labels. Labeled graphs data analysis (JdS 2012) Nathalie Villa-Vialaneix & Th...