AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Binary Rating Estimation with Graph Side Information

Kwangjun Ahn, Kangwook Lee, Hyunseung Cha, Changho Suh

NeurIPS 2018 · Graph learning › Graph algorithms and clustering · approach: Graph comparison and random features · 21 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
Add social graph side information when users outnumber items enough (n=2m, Is = c log(2n)/n)optimal sample complexity for binary rating recovery · two-cluster binary rating modelsample complexity: reduced by a multiplicative factor of c/2Improved
Add social graph side information when n = m^2optimal sample complexity · two-cluster binary rating modelsample complexity: order-wise reduction to n^(2-c) log nImproved
Add social graph side information when users are few relative to items (2n log n <= 4 gamma m log m)optimal sample complexity · two-cluster binary rating modelsample complexityNo clear effect
Increase graph quality Is beyond saturation thresholdoptimal sample complexity · two-cluster binary rating modelsample complexityNo clear effect
Use graph-aware algorithm instead of 7 recommendation baselines (user/item average, kNN, SoReg, biased MF, TrustSVD)proposed algorithm · Poliblog and Facebook graphs with synthetic ratingsMAEImproved

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