N this thesis, I first present a new way of characterising communities from a network of timestamped messages. I show that its structure is linked with communities : communication structures are over-represented inside communities while diffusion structures appear mainly on the boundaries.Then, I propose to evaluate communities with a new quality function, compacity, that measures the propagation speed of communications in communities. I also present the Lex-Clustering, a new community detection algorithm based on the LexDFS graph traversal that features some characteristics of information diffusion.Finally, I present a methodology that I used to link quality functions and ground-truths. I introduce the concept of contexts, sets of ground-t...
Community detection is a technique used to separate graphs into several densely connected groups of ...
Community detection is a technique used to separate graphs into several densely connected groups of ...
Community detection is a technique used to separate graphs into several densely connected groups of ...
N this thesis, I first present a new way of characterising communities from a network of timestamped...
N this thesis, I first present a new way of characterising communities from a network of timestamped...
Dans cette thèse, je commence par présenter une nouvelle caractérisation des communautés à partir d'...
International audienceCommunity structure is of paramount importance for the understanding of comple...
L'étude de structures de communautés dans les réseaux devient de plus en plus une question important...
International audienceCommunity structure is of paramount importance for the understanding of comple...
L'étude de structures de communautés dans les réseaux devient de plus en plus une question important...
International audienceCommunity detection emerged as an important exploratory task in complex networ...
International audienceCommunity detection emerged as an important exploratory task in complex networ...
International audienceCommunity detection emerged as an important exploratory task in complex networ...
This thesis deals with community detection in the context of social networks. A social network can b...
Community detection is a technique used to separate graphs into several densely connected groups of ...
Community detection is a technique used to separate graphs into several densely connected groups of ...
Community detection is a technique used to separate graphs into several densely connected groups of ...
Community detection is a technique used to separate graphs into several densely connected groups of ...
N this thesis, I first present a new way of characterising communities from a network of timestamped...
N this thesis, I first present a new way of characterising communities from a network of timestamped...
Dans cette thèse, je commence par présenter une nouvelle caractérisation des communautés à partir d'...
International audienceCommunity structure is of paramount importance for the understanding of comple...
L'étude de structures de communautés dans les réseaux devient de plus en plus une question important...
International audienceCommunity structure is of paramount importance for the understanding of comple...
L'étude de structures de communautés dans les réseaux devient de plus en plus une question important...
International audienceCommunity detection emerged as an important exploratory task in complex networ...
International audienceCommunity detection emerged as an important exploratory task in complex networ...
International audienceCommunity detection emerged as an important exploratory task in complex networ...
This thesis deals with community detection in the context of social networks. A social network can b...
Community detection is a technique used to separate graphs into several densely connected groups of ...
Community detection is a technique used to separate graphs into several densely connected groups of ...
Community detection is a technique used to separate graphs into several densely connected groups of ...
Community detection is a technique used to separate graphs into several densely connected groups of ...