Topology-aware Tensor Decomposition for Meta-graph Learning
원문 초록
Heterogeneous graphs generally refers to graphs with different types of nodes and edges. A common approach for extracting useful information from heterogeneous graphs is to use meta-graphs, which can be seen as a special kind of directed acyclic graph (DAG) with same node and edge types as the heterogeneous graph. However, how to design proper meta-graphs is challenging. Recently, there have been many works on learning suitable meta-graphs from a heterogeneous graph. Existing methods generally introduce continuous weights for edges that are independent of each other, which ignores the topological stucture of meta-graphs and can be ineffective. To address this issue, we propose a new viewpoint from tensor on learning meta-graphs. Such a viewpoint not only helps interpret the limitation of existing works by CANDECOMP/PARAFAC (CP) decomposition, but also inspires us to propose a topology-aware tensor decomposition, called TENSUS, that reflects the structure of DAGs. The proposed topology-aware tensor decomposition is easy to use and simple to implement, and it can be taken as a plug-in part to upgrade many existing works, including node classification and recommendation on heterogeneous graphs. Experimental results on different tasks demonstrate that the proposed method can significantly improve the state-of-the-arts for all these tasks.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Delving into Instance-Dependent Label Noise in Graph Data: A Comprehensive Study and Benchmark
Scalable Graph Generative Modeling via Substructure Sequences
Graph Foundation Models: A Comprehensive Survey
Devil's Hand: Data Poisoning Attacks to Locally Private Graph Learning Protocols
Message-Passing State-Space Models: Improving Graph Learning with Modern Sequence Modeling
EC-LDA : Label Distribution Inference Attack against Federated Graph Learning with Embedding Compression
토론
이 논문과 연결된 포럼 글이 아직 없습니다.