atlas

Research map / Graph learning / Graph self-supervised learning

Link Prediction via Subgraph Embedding-Based Convex Matrix Completion

AAAI 2018 · Graph learning › Graph self-supervised learning · approach: Semi-supervised node representation learning · 35 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
learned subgraph embeddings with convex matrix completion instead of strongest baselineSEMAC · F200AUC (%): 90.9 -> 92.4Helped
SEMAC vs best baseline (node2vec/GraRep)SEMAC · PPIAUC (%): 88.9 -> 91.3Helped
SEMAC vs best baselineSEMAC · F1600AUC (%): 96.8 -> 97.6Helped
increase learning rate from 0.1 toward 0.2-0.3 (ablation)SEMAC · F400AUCHelped
increase learning rate to 0.4 or higher (ablation)SEMAC · F400AUCHurt
regularization ratio lambda >= 0.1 (ablation)SEMAC · F400AUCHurt
reduce regularization ratio to small values (ablation)SEMAC · F400AUCNo clear effect
increase maximum depth D (ablation)SEMAC · datasetsAUCHelped

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