arXiv:2606. 30291v1 Announce Type: new Abstract: Text-Attributed Graphs (TAGs) combine textual semantics with graph structure and are central to many graph learning tasks.
By Zhifei Hu, Alexandra I. Cristea
GOMA (Graph-Optimized Multimodal Alignment) introduces a dual-embedding approach for multimodal retrieval, separating content embeddings supervised for paired identity from semantic embeddings trained with cross-modal pairs and observed relationships. The method fuses these embeddings, applies semantic agreement to weight graph edges, and uses restart graph propagation to reinforce the initial signal, enabling both single-modality and dual-attribute retrieval. Across six datasets and four tasks, GOMA outperforms 14 external methods on 14 primary metrics, with controlled experiments highlighting the impact of separate supervision, graph regularization, and semantic-guided propagation.
By Xu Wang, Xunkai Li, Yinlin Zhu, Rong-Hua Li, Guoren Wang
Text-Attributed Graphs (TAGs) combine textual semantics with graph structure and are central to many graph learning tasks. However, existing fusion methods often treat text and structure as separate inputs in a shallow, one-way pipeline, which limits deep interaction between modalities and weakens performance under sparse connectivity or cross-graph generalisation.
arXiv:2512. 12477v2 Announce Type: replace Abstract: Estimating node importance in heterogeneous knowledge graphs is a fundamental problem underlying recommendation, search, and knowledge decision systems.
By Jiawen Chen, Yanyan He, Qi Shao, Mengli Wei, Duxin Chen, Wenwu Yu, Yanlong Zhao
arXiv:2606. 06225v1 Announce Type: cross Abstract: Collaborative filtering and graph-based recommendation models are highly effective because they leverage observed user interactions, but this dependence creates a fundamental cold-start challenge when newly added content has no interaction history.
By Anh Truong, John Trenkle, Yuanbo Chen, Honghong Zhao, Abdullah Alchihabi, Effy Fang, Michael Tamir
PEARL is a new framework for inductive knowledge graph completion that treats relational paths as context-conditioned reasoning signals. It builds a query‑specific contextual subgraph from the query entities’ neighborhoods and uses a large language model‑guided retriever to select semantically relevant paths. By constructing a bipartite interaction graph over paths, contextual entities, and a global subgraph representation, and applying a dual‑view contrastive objective, PEARL adapts path embeddings to local and global structural evidence, achieving the best average Hits@10 on WN18RR, FB15k‑237, and NELL‑995.
By Yunchi Yang, Longlong Li, Cunquan Qu