AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Semantic Proximity Search on Heterogeneous Graph by Proximity Embedding

AAAI 2017 · Graph learning › Graph algorithms and clustering · approach: Graph distance and retrieval · 74 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 direct proximity embedding instead of DeepWalk node embeddings (DWR)ProxEmbed · LinkedIn and FacebookNDCG/MAPHelped
use learned path features instead of engineered meta-graph/meta-path featuresProxEmbed vs MGP/MPP · LinkedIn and FacebookNDCG/MAP: e.g. +18.9% NDCG on LinkedIn-schoolmateHelped
use ProxEmbed instead of SRW with only 10 training tuplesProxEmbed · DBLP advisor/adviseeNDCG/MAPHurt
add path length discount (alpha 0 -> 0.1) (ablation)ProxEmbed · six proximity classes, 100 training tuplesNDCG/MAPHelped
increase path discount alpha to 10 (ablation)ProxEmbed · six proximity classes, 100 training tuplesNDCG/MAPHurt
embedding dimension d = 64 (ablation)ProxEmbed · six proximity classesNDCG/MAPHelped

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