Overlapping Community Detection by Local Decentralised Vertex-centred Process
arXiv:1702.03773
Abstract
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 environment and to limit propagation, two essential characteristics to be applied in mobile networks. It is based on the exploitation of the preferential attachment mechanism in networks. Experimental results show that LOCNeSs is stable and achieves good overlapping vertex identification.
arXiv commentIEEE Computer Society. 2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW'16), Dec 2016, Barcelone, Spain
References in corpus (8)
- Emergence of scaling in random networks
- Finding and evaluating community structure in networks
- Uncovering the overlapping community structure of complex networks in nature and society
- Near linear time algorithm to detect community structures in large-scale networks
- Benchmark graphs for testing community detection algorithms
- Resolution limit in community detection
- Finding local community structure in networks
- SLPA: Uncovering Overlapping Communities in Social Networks via A Speaker-listener Interaction Dynamic Process