51 citations · 145 across the 10 of their papers we have counts for
6 papers · 1 filter
Fast Complex Network Clustering Algorithm Using Agents
Di Jin, Dayou Liu, Bo Yang +1
Recently, the sizes of networks are always very huge, and they take on distributed nature. Aiming at this kind of network clustering problem, in the sight of local view, this paper…
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…
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…
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…
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…
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…