AI helps you reading Science

AI generates interpretation videos

AI extracts and analyses the key points of the paper to generate videos automatically


pub
Go Generating

AI Traceability

AI parses the academic lineage of this thesis


Master Reading Tree
Generate MRT

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

JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, no. 5 (2011): null-null

Cited by: 68|Views25
WOS SCOPUS EI

Abstract

The detection of overlapping communities in complex networks has motivated recent research in relevant fields. Aiming to address this problem, we propose a Markov-dynamics-based algorithm, called UEOC, which means 'unfold and extract overlapping communities'. In UEOC, when identifying each natural community that overlaps, a Markov random ...More

Code:

Data:

Your rating :
0

 

Tags
Comments
小科