AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Tree-based Node Aggregation in Sparse Graphical Models

Ines Wilms, Jacob Bien

JMLR 2022 · Graph learning › Graph algorithms and clustering · approach: Graph comparison and random features · 3 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 tree-based node aggregation (tag-lasso realistic) to graphical lassoglasso · Simulation chain designARI: 0.00 -> 0.88Improved
add node aggregation (tag-lasso ideal) to graphical lassoglasso · Simulation chain designFPR: 0.80 -> 0.22Improved
add node aggregation with realistic treeglasso · Simulation unbalanced designFPR: 0.82 -> 0.44Improved
add node aggregation to glasso in designs with aggregationglasso · Simulation designs with aggregation (p=15)KL distanceImproved
use realistic tree instead of ideal tree (ablation)tag-lasso · Simulation chain designARI: 1.00 -> 0.88Hurt
use tag-lasso instead of glasso when no aggregation existsglasso · Simulation unstructured designKL distanceHurt
add node aggregation as number of variables p grows to 120glasso · Simulation chain design, p=120KL distanceImproved
increase number of blocks K from 3 to 10 (ablation)tag-lasso vs glasso · Simulation chain design, p=30KL distanceMixed

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