most citedMarkov random walk under constraint for discovering overlapping communities in complex networks

51 citations · 158 across the 6 of their papers we have counts for

collaborators

6 papers

cs.SI201319 cited

Ant Colony Optimization with a New Random Walk Model for Community Detection in Complex Networks

Di Jin, Dayou Liu, Bo Yang +2

Detecting communities from complex networks has recently triggered great interest. Aiming at this problem, a new ant colony optimization strategy building on the Markov random walk…

cs.SI201329 cited

Genetic Algorithm with a Local Search Strategy for Discovering Communities in Complex Networks

Dayou Liu, Di Jin, Carlos Baquero +3

In order to further improve the performance of current genetic algorithms aiming at discovering communities, a local search based genetic algorithm GALS is here proposed. The core…

cs.SI201351 cited

Markov random walk under constraint for discovering overlapping communities in complex networks

Di Jin, Bo Yang, Carlos Baquero +3

Detection of overlapping communities in complex networks has motivated recent research in the relevant fields. Aiming this problem, we propose a Markov dynamics based algorithm, ca…

cs.SI201329 cited

Genetic Algorithm with Ensemble Learning for Detecting Community Structure in Complex Networks

Dongxiao He, Zhe Wang, Bin Yang +1

Community detection in complex networks is a topic of considerable recent interest within the scientific community. For dealing with the problem that genetic algorithm are hardly a…

cs.SI201313 cited

An Ant-Based Algorithm with Local Optimization for Community Detection in Large-Scale Networks

Dongxiao He, Jie Liu, Bo Yang +3

In this paper, we propose a multi-layer ant-based algorithm MABA, which detects communities from networks by means of locally optimizing modularity using individual ants. The basic…

cs.SI201317 cited

Discovering link communities in complex networks by exploiting link dynamics

Dongxiao He, Dayou Liu, Weixiongzhang +2

Discovery of communities in complex networks is a fundamental data analysis problem with applications in various domains. Most of the existing approaches have focused on discoverin…