atlas

Research map / Graph learning / Graph algorithms and clustering

Strongly local p-norm-cut algorithms for semi-supervised learning and local graph clustering

NeurIPS 2020 · Graph learning › Graph algorithms and clustering · approach: Neural and local graph clustering · 5 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 the q-norm local cut objective and strongly local solver rather than ACLSLQ vs. ACL · Facebook class year 2009 across seven school networksF1: UCLA 0.9 vs 0.9; MIT 0.9 vs 0.8; Duke 1.0 vs 0.9Mixed
Use q-Huber loss instead of the power loss (ablation)SLQ · Facebook class-year clustersF1: 2009 UCLA 0.9 -> 0.9; 2009 MIT 0.9 -> 0.8; 2008 MIT 0.5 -> 0.5Mixed
Use the q-norm cut solver instead of CRD-3SLQ · Facebook class year 2009, UCLAF1: 0.3 -> 0.9Helped
Use the q-norm cut solver instead of CRD-5SLQ · Facebook school networks, class year 2009running time (seconds): 123 vs 9378Helped
Increase seed-set sizeSLQ and ACL · MIT Facebook class year 2008F1Helped
Use q>2 rather than PageRank (q=2)SLQ · DBLP and LiveJournal recall experimentrecallHelped

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