3260 papers • 126 benchmarks • 313 datasets
This task has no description! Would you like to contribute one?
(Image credit: Papersgraph)
These leaderboards are used to track progress in local-community-detection-7
No benchmarks available.
Use these libraries to find local-community-detection-7 models and implementations
No datasets available.
No subtasks available.
Inspired by the unique feature representation learning capability of deep autoencoder, a novel model, named Deep Autoencoding-like NMF (DANMF), is proposed, named DANMF, for community detection, which can achieve better performance than the state-of-the-art NMF-based community detection approaches.
This paper starts from a generative model for networks with a community structure, and finds that by assuming that the network is uniform, it can approximate the structure of the unobserved parts of the network to obtain a method for local community detection.
Comprehensive experiments conducted on both synthetic and real-world datasets demonstrate the effectiveness and efficiency of the proposed random walk on multiple networks using inline-formula in link prediction, network embedding, and local community detection.
Adding a benchmark result helps the community track progress.