AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Regularization of Mixture Models for Robust Principal Graph Learning

Aurélien Decelle, Tony Bonnaire, N. Aghanim

TPAMI 2021 · Graph learning › Graph algorithms and clustering · approach: Graph embedding and spectral sparsification · 12 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
add an explicit uniform background component and learned local variances to graph-regularized mixture modelprincipal graph learning · Synthetic three-branch dataset with 25% background noisequalitative graph recovery: estimated background level 25%Improved
increase lambda_sigma toward a large value (ablation)GRMM · Synthetic three-branch datasetvariance adaptivityHurt
vary lambda_pi from 0 to 10 (ablation)GRMM · Synthetic three-branch datasetgraph structure: 0 to 10No clear effect
add high-probability edges from averaged sub-sampled MSTs to the MST (ablation)MST graph prior · Synthetic Voronoi datasetcycles recovered: 27 new edgesImproved
use average MST graph instead of persistent homology skeletoncycle graph construction · Voronoi dataset with outliersspurious loops and small cyclesImproved
add average graph prior to MST on galaxy slice (ablation)GRMM · IllustrisTNG 2D galaxy slice (N=31500)cycles represented: 132 edges addedImproved

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