AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

Unsupervised Large Graph Embedding

AAAI 2017 · Learning theory and algorithms › Clustering · approach: Spectral clustering algorithms · 152 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
ULGE (anchor graph, low-rank doubly stochastic similarity) vs SRspectral dimensionality reduction · SensITrunning time: 1505.1 -> 91.5Helped
ULGE-K vs LEspectral dimensionality reduction · MNISTACC: 68.4 -> 60.7Hurt
ULGE-K vs best competitorspectral dimensionality reduction · USPS, ProteinACC: 68.9 -> 69.3 (USPS)Helped
use k-means anchors instead of random anchors (ablation)ULGE · USPS, MNIST, Connect-4, SensITACC: 54.9 -> 60.7 (MNIST)Helped
use k-means anchors instead of random anchors (ablation)ULGE · MNISTrunning time: 8.8 -> 14.7Hurt
increase number of anchors (ablation)ULGE · MNISTACCHelped
increase number of anchors from 1000 to 2500 (ablation)ULGE-K · MNISTrunning time: 14.7 -> 34.3Hurt
increase down-sampling decimation factor (2 -> 10) (ablation)ULGE-K anchor generation · MNISTrunning time: 72.3 -> 14.7Helped
increase down-sampling decimation factor (ablation)ULGE-K anchor generation · MNISTACCHurt

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