atlas

Research map / Graph learning / Graph algorithms and clustering

Capacity Releasing Diffusion for Speed and Locality

ICML 2017 · Graph learning › Graph algorithms and clustering · approach: Neural and local graph clustering · 27 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 capacity-releasing diffusion instead of ACLLocal clustering · Rice year 2009precision: 0.25 -> 0.92Helped
Use capacity-releasing diffusion instead of ACLLocal clustering · Colgate year 2008precision: 0.61 -> 0.94Helped
Use capacity-releasing diffusion instead of ACLLocal clustering · Rice dorm 203precision: 0.32 -> 0.43Helped
Use capacity-releasing diffusion instead of ACLLocal clustering · Rice dorm 203recall: 0.9 -> 0.8Hurt
Use capacity-releasing diffusion instead of ACLLocal clustering · Colgate year 2007precision: 0.47 -> 0.52Helped
Use capacity-releasing diffusion instead of ACLLocal clustering · Simmons year 2007recall: 0.75 -> 0.5Hurt
Use capacity-releasing diffusion rather than classical spectral diffusionSynthetic grid clustering · 60×60 grid with random connectionsconductanceMixed

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