Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Canu, Mael"'
This paper focuses on the identification of overlapping communities, allowing nodes to simultaneously belong to several communities, in a decentralised way. To that aim it proposes LOCNeSs, an algorithm specially designed to run in a decentralised en
Externí odkaz:
http://arxiv.org/abs/1702.03773
Publikováno v:
Fifth International Workshop on Complex Networks and their Applications, Nov 2016, Milan, Italy. Proceedings of the Fifth International Workshop on Complex Networks and their Applications, Proceedings of the Fifth International Workshop on Complex Networks and their Applications
Finding communities in evolving networks is a difficult task and raises issues different from the classic static detection case. We introduce an approach based on the recent vertex-centred paradigm. The proposed algorithm, named DynLOCNeSs, detects c
Externí odkaz:
http://arxiv.org/abs/1611.08484
This paper addresses the task of community detection and proposes a local approach based on a distributed list building, where each vertex broadcasts basic information that only depends on its degree and that of its neighbours. A decentralised extern
Externí odkaz:
http://arxiv.org/abs/1509.03500
Autor:
Canu, Maël
Les travaux présentés dans la thèse s'inscrivent dans le cadre de l'analyse des graphes de terrain (complex networks) et plus précisément de la tâche de détection de communautés, c'est-à-dire la reconnaissance algorithmique de sous-graphes p
Externí odkaz:
http://www.theses.fr/2017PA066378/document