AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Non-Uniform Subset Selection for Active Learning in Structured Data

CVPR 2017 · Graph learning › Graph algorithms and clustering · approach: Graph embedding and spectral sparsification · 23 citations (OpenAlex)

Check 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 graph relationships and joint-entropy subset selection for active learningSVM recognition on SUN scene classification · SUNmanual labeling required to reach ALL: 41%Helped
Use graph relationships and joint-entropy subset selection for active learningSVM recognition on SUN object classification · SUNmanual labeling required to reach ALL: 62%Helped
Use graph relationships and joint-entropy subset selection for active learningSVM document classification · CORAmanual labeling required to reach ALL: 42%Helped
Use graph relationships and joint-entropy subset selection for active learningSVM activity classification · VIRATmanual labeling required to reach ALL accuracy: 18%Helped
Use alpha=0.5 rather than alpha=1.1 (ablation)Proposed active learning method · CORAmanual labeling required for similar final performanceHurt
Use alpha=1.1 rather than alpha=0.5 (ablation)Proposed active learning method · CORAfinal accuracyNo clear effect

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