atlas

Research map / Label-efficient and robust learning / Recognition and long-tail

Unsupervised Nonlinear Feature Selection from High-Dimensional Signed Networks

AAAI 2020 · Label-efficient and robust learning › Recognition and long-tail · approach: Contrastive representation theory · 34 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 block HSIC estimator with nonlinear kernel Lasso instead of matrix-factorization linear methodsSignedLasso vs SignedFS · Epinionsrun time (s): 7428 -> 1837Helped
use block HSIC estimator instead of matrix-factorization methodsSignedLasso vs SignedFS · Wiki-RfArun time (s): 16860 -> 636Helped
use block HSIC estimator instead of matrix-factorization methodsSignedLasso vs SignedFS · Epinionspeak memory (MiB): 3249 -> 6487Hurt
use nonlinear feature selection with signed-network embedding instead of linear SignedFSfeature selection · Epinions, Wiki-RfAACC/NMI/F1Helped
add negative links (signed) rather than positive onlynetwork feature selection · Epinions, Wiki-RfAACC/NMI/F1Helped
vary block size B (20-50) and embedding dimension c (10-40) (ablation)SignedLasso · Epinions, Wiki-RfAACC, NMINo 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