3 papers
cs.DB2026
Common-Neighbor-Count-Based Representative Possible World Finding on Uncertain Graphs
Chengjie Gu, Xiaoliang Xu, Yuxiang Wang +5
A representative possible world (RPW) is a deterministic graph derived from an uncertain graph where a designated structural feature closely approximates its expected…
cs.CL2025
Prompting Disentangled Embeddings for Knowledge Graph Completion with Pre-trained Language Model
Yuxia Geng, Jiaoyan Chen, Yuhang Zeng +5
Both graph structures and textual information play a critical role in Knowledge Graph Completion (KGC). With the success of Pre-trained Language Models (PLMs) such as BERT, they ha…
cs.LG2024
Graph Similarity Computation via Interpretable Neural Node Alignment
Jingjing Wang, Hongjie Zhu, Haoran Xie +3
\Graph similarity computation is an essential task in many real-world graph-related applications such as retrieving the similar drugs given a query chemical compound or finding the…