AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Significance-based community detection in weighted networks

John Palowitch, Shankar Bhamidi, Andrew B. Nobel

JMLR 2018 · Graph learning › Graph algorithms and clustering · approach: Graph distance and retrieval · 19 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 CCME instead of competing methods on varying edge/weight signalCCME · Simulated WSBM networks (n=5000)oNMIImproved
CCME instead of OSLOM on sensitivity under varying signalCCME · Simulated WSBM networks% community nodes in backgroundImproved
CCME versus others on networks with overlapping nodesCCME · Simulated overlapping WSBM networksoNMIImproved
CCME versus OSLOM with overlap and 1,000 background nodes, fewer community nodesCCME · Simulated overlap plus background networksoNMIMixed
CCME versus OSLOM as network grows with background nodesCCME · Simulated overlap plus background networks% background nodes in communitiesImproved
use CCME rather than OSLOM or SLPAw on year-aggregated airport networkCCME · US airport network 2015community structure (qualitative)Improved
use CCME rather than OSLOM or SLPAw on ENRON email networkCCME · ENRON networkproportion of enron.com addresses in communities: 0.423 -> 0.784 (SLPAw vs CCME); 0.529 (OSLOM)Improved

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