atlas

Research map / Graph learning / Graph self-supervised learning

Large-Scale Graph-Based Semi-Supervised Learning via Tree Laplacian Solver

AAAI 2016 · Graph learning › Graph self-supervised learning · approach: Semi-supervised node representation learning · 11 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 TbTL tree solver instead of LLGC-PCGgraph-based SSL · Extended MNIST l=10000accuracy (%): 96.92 -> 96.77Hurt
use TbTL instead of LLGC-PCGgraph-based SSL · Extended MNIST l=10000labeling time (s): 265.2 -> 2.2Helped
use TbTL tree solver instead of GRFgraph-based SSL · MNIST 8NN graphrunning time (s): 73.65 -> 0.15Helped
use TbTL instead of GPAtree-based SSL · Extended MNIST l=100accuracy (%): 89.63 -> 89.97No clear effect
use TbTL instead of full graph GRF/LLGC (graph sparsification)graph-based SSL · small datasetsaccuracyHurt
use tree-based sparse approximation instead of low-rank (AGR, Eigen)scalable SSL · Extended MNIST l=100accuracy (%): 82.27 -> 89.97Helped

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