atlas

Research map / Graph learning / Graph algorithms and clustering

Detect Overlapping Communities via Ranking Node Popularities

AAAI 2016 · Graph learning › Graph algorithms and clustering · approach: Graph comparison and random features · 25 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use stochastic-model node-popularity ranking with Bayesian community shrinkage vs best baselineSLPA/Oslom (second best) · FriendsterNMI (%): 29.07 -> 44.19Helped
Same method vs best baselineSLPA (second best) · YoutubeNMI (%): 18.31 -> 31.21Helped
Same method vs best baselineSLPA (second best) · OrkutNMI (%): 25.71 -> 29.75Helped
Same method vs best baselineBigClam (second best) · DBLPNMI (%): 14.96 -> 18.78Helped
Same method vs Oslom on LFR synthetic benchmarksOslom · LFR four benchmark setsNMIHelped
Hierarchical Bayesian model selection vs spectral method for number of communitiesspectral method · LFR benchmarksnumber of communitiesMixed
Vary parameter epsilon from 1e-3 to 20e-3Ours · six real networksNMINo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy