Compact Walks: Taming Knowledge-Graph Embeddings With Domain- and Task-Specific Pathways
Summary: CompactWalks uses domain- and task-specific regular-expression pathways to define semantic subgraphs for KG neighborhoods. Mitigates promiscuity and runtime bottlenecks in large biomedical KGs; case studies on drug–disease links and scalable embeddings. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Pei-Yu Hou (North Carolina State University)
- 2. Daniel R. Korn (University of North Carolina)
- 3. Cleber C. Melo-Filho (University of North Carolina)
- 4. David R. Wright (North Carolina State University)
- 5. Alexander Tropsha (University of North Carolina)
- 6. Rada Chirkova (North Carolina State University)
BibTeX Citation
@inproceedings{hou_sigmod22,
title = {{Compact Walks: Taming Knowledge-Graph Embeddings With Domain- and Task-Specific Pathways}},
author = {Hou, Pei-Yu and Korn, Daniel R. and Melo-Filho, Cleber C. and Wright, David R. and Tropsha, Alexander and Chirkova, Rada},
series = {{SIGMOD} '22},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3514221.3517903},
url = {https://dl.acm.org/doi/10.1145/3514221.3517903},
year = {2022}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,826 | Accelerating Sampling and Aggregation Operations in GNN Frameworks with GPU Initiated Direct Storage Accesses | 2024 | VLDB | 6.391978e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,795 | Realistic Re-evaluation of Knowledge Graph Completion Methods: An Experimental Study | 2020 | SIGMOD | 8.0014963e-05 |
| 4,995 | Medical Entity Disambiguation Using Graph Neural Networks | 2021 | SIGMOD | 6.3229469e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,564 | FlowWalker: A Memory-efficient and High-performance GPU-based Dynamic Graph Random Walk Framework | 2024 | VLDB |
| 2 | 10,835 | Sankofa: Online Query-adaptive Dynamic Graph Summaries | 2026 | VLDB |
| 3 | 2,795 | Realistic Re-evaluation of Knowledge Graph Completion Methods: An Experimental Study | 2020 | SIGMOD |
| 4 | 10,708 | A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs | 2026 | VLDB |
| 5 | 11,609 | Complex-Path: Effective and Efficient Node Ranking with Paths in Billion-Scale Heterogeneous Graphs | 2024 | VLDB |
| 6 | 7,305 | RWalks: Random Walks as Attribute Diffusers for Filtered Vector Search | 2025 | SIGMOD |
| 7 | 8,064 | Distributed Graph Embedding with Information-Oriented Random Walks | 2023 | VLDB |
| 8 | 6,232 | Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding | 2024 | VLDB |
| 9 | 4,148 | A Benchmarking Study of Embedding-based Entity Alignment for Knowledge Graphs | 2020 | VLDB |
| 10 | 4,649 | On the Embeddability of Random Walk Distances | 2013 | VLDB |