Topology‐aware tensor decomposition for meta‐graph learning

Abstract Heterogeneous graphs generally refer 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 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 structures of meta‐graphs and can be ineffective. To address this issue, the authors 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.

Authors

Institutions

Publication Details

Journal
CAAI Transactions on Intelligence Technology
Published
2025-01-29
DOI
https://doi.org/10.1049/cit2.12404
Primary Topic
Tensor decomposition and applications
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Topology‐aware tensor decomposition for meta‐graph learning

Hansi Yang, Quanming Yao
CAAI Transactions on Intelligence Technology
Tensor decomposition and applications
article

Topology‐aware tensor decomposition for meta‐graph learning

Hansi Yang, Quanming Yao
article en

Abstract

Abstract Heterogeneous graphs generally refer 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 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 structures of meta‐graphs and can be ineffective. To address this issue, the authors 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.

CAAI Transactions on Intelligence TechnologyVol. 10(3)
Hong Kong University of Science and Technology (HK), Tsinghua University (CN)
National Key Research and Development Program of China
Openalex Percentile: Top 97%
Tensor decomposition and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.