English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Community structure is one of the most important topological properties in complex networks. The network clustering problem (NCP) refers to the detection of network community structures, and many practical problems can be modeled as NCPs. So far, lots of network clustering algorithms have been proposed. However, further improvements in the clustering accuracy, especially when discovering reasonable community structure without prior knowledge, still constitute an open problem. Building on Markov random walks, the paper addresses this problem with a novel ant colony optimization strategy, named as RWACO, which improves prior results on the NCPs and does not require knowledge of the number of communities present on a given network. The framework of ant colony optimization is taken as the basic framework in the RWACO algorithm. In each iteration, a Markov random walk model is taken as heuristic rule. All of the ants’ local solutions are aggregated to a global one through clustering ensemble, which then will be used to update a pheromone matrix. The strategy relies on the progressive strengthening of within-community links and the weakening of between-community links. Gradually, this converges to a solution where the underlying community structure of the complex network will become clearly visible. The performance of algorithm RWACO was tested against a set of benchmark computer-generated networks, and as well on real-world network data sets. Experimental results confirm the validity and improvements of this approach.

Ant Colony Optimization Based on Random Walk for Community Detection in Complex Networks