atlas

Research map / Graph learning / Graph algorithms and clustering

Semantic Community Identification in Large Attribute Networks

AAAI 2016 · Graph learning › Graph algorithms and clustering · approach: Graph distance and retrieval · 201 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
combine node attributes with topology (SCI) vs topology-only NMF (SNMF)NMF community detection · CornellAC: 0.3179 -> 0.4769Helped
SCI vs PCL-DCattributed community detection · Cora/CiteseerAC: 0.6525 -> 0.3442Hurt
SCI vs CESNAoverlapping community detection · WebKB, Cora, CiteseerF-score: 0.4393 -> 0.5063Helped
use attribute-derived membership U=SC instead of U directly (ablation)SCI · synthetic Newman networkAC/NMIMixed
add node attributes to topology (ablation)SNMF · synthetic Newman networkAC/NMIHelped
vary sparsity weight alpha (ablation)SCI · Cornell, TexasaccuracyMixed
vary topology weight beta (ablation)SCI · Cornell, TexasaccuracyNo 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