Research map / Graph learning / Graph algorithms and clustering
Cross-Graph Learning of Multi-Relational Associations
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Use TOP with Exponential κ instead of the compared methods | Cross-graph relational learning · Enzyme and DBLP | MAP, AUC, Hits@5 | Helped |
| Use Exponential κ rather than the other tested spectral graph products (ablation) | TOP · Enzyme and DBLP | MAP, AUC, Hits@5 | Helped |
| Reduce model size by using a subset of the graph spectrum (ablation) | TOP · Enzyme | performance | No clear effect |
Closest papers by meaning
- Continuous Partitioning for Graph-Based Semi-Supervised Learning (NeurIPS 2024 · similarity 0.84)
- Multiplex Graph Representation Learning with Homophily and Consistency (AAAI 2025 · similarity 0.84)
- Position: Relational Deep Learning - Graph Representation Learning on Relational Databases (ICML 2024 · similarity 0.83)
- Cross-View Graph Consistency Learning for Invariant Graph Representations (AAAI 2025 · similarity 0.83)
- RelGNN: Composite Message Passing for Relational Deep Learning (ICML 2025 · similarity 0.83)
- S3GCL: Spectral, Swift, Spatial Graph Contrastive Learning (ICML 2024 · similarity 0.83)
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.