AI Paper Atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

Near-Neighbor Methods in Random Preference Completion

Ao Liu, Qiong Wu, Zhenming Liu, Lirong Xia

AAAI 2019 · Learning theory and algorithms › Matrix and tensor methods · approach: Structured low-rank learning · 11 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
use Anchor-kNN (L1 distance over KT-distances to anchor agents) instead of KT-kNNpreference completion with kNN · 1-dim synthetic datapairwise prediction errorImproved
use Anchor-kNN instead of KT-kNNneighbor retrieval · 1-dim synthetic dataaverage latent distance to returned neighborsImproved
use Anchor-kNN instead of KT-kNNpreference completion · synthetic data, latent dimension 1 to 10pairwise prediction errorImproved
use Anchor-kNN instead of KT-kNN and cosine-similarity collaborative filteringpreference completion · Netflixprediction accuracyImproved
increase latent dimensionneighbor-based algorithms including Anchor-kNN · synthetic data d=1 to 10pairwise prediction errorHurt

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