Research map / Graph learning / Graph algorithms and clustering
Graph Traversal with Tensor Functionals: A Meta-Algorithm for Scalable Learning
Elan Sopher Markowitz, Keshav Balasubramanian, Mehrnoosh Mirtaheri, Sami Abu-El-Haija, Bryan Perozzi, Greg Ver Steeg, Aram Galstyan
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Implement WYS using GTTF | WYS · PPI link prediction | ROC-AUC: 89.8 -> 90.5 | Improved |
| Implement WYS using GTTF | WYS · HepTh link prediction | ROC-AUC: 93.6 -> 93.5 | No clear effect |
| Implement WYS using GTTF | WYS · Reddit link prediction | ROC-AUC: OOM -> 98.6 | Improved |
| Implement DeepWalk using GTTF | DeepWalk · Reddit link prediction | ROC-AUC: 93.5 -> 95.5 | Improved |
| Implement WYS using GTTF | WYS · LiveJournal link prediction | Mean Rank: OOM -> 185.6 | Improved |
| Implement GCNII using GTTF | GCNII · Cora node classification | accuracy: 85.5 -> 85.3 | No clear effect |
| Implement GCNII using GTTF | GCNII · Citeseer node classification | accuracy: 73.4 -> 74.4 | Improved |
| Implement MixHop using GTTF | MixHop · Pubmed node classification | accuracy: 80.8 -> 80.9 | No clear effect |
| Implement GraphSAGE using GTTF | GraphSAGE · Reddit node classification | micro-F1: 95.0 -> 95.9 | Improved |
| Train SAGE using GTTF walk-forest sampling | SAGE · Products node classification | accuracy: 77.3 -> 77.0 | No clear effect |
| Use GTTF implementation | GraphSAGE · GraphSAGE training on Reddit | epoch time (s): 5.8 -> 1.8 | Improved |
| Use GTTF implementation | GraphSAGE · GraphSAGE training on Products | epoch time (s): 9.2 -> 1.4 | Improved |
Closest papers by meaning
- From Theory to Practice: Rethinking Green and Martin Kernels for Unleashing Graph Transformers (ICML 2025 · similarity 0.88)
- Learning Representations for Hierarchies with Minimal Support (NeurIPS 2024 · similarity 0.88)
- Exploitation of a Latent Mechanism in Graph Contrastive Learning: Representation Scattering (NeurIPS 2024 · similarity 0.88)
- Beyond Message Passing: Neural Graph Pattern Machine (ICML 2025 · similarity 0.87)
- Generative Graph Pattern Machine (NeurIPS 2025 · similarity 0.87)
- Equivariance Everywhere All At Once: A Recipe for Graph Foundation Models (NeurIPS 2025 · similarity 0.87)
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.
