Canlin Yang — accepted AI-conference papers

2025

Hypergraph Learning for Unsupervised Graph Alignment via Optimal Transport

Yuguang Yan, Canlin Yang, Yuanlin Chen, Ruichu Cai, Michael Ng

AAAI 2025technical

Unsupervised graph alignment aims to find corresponding nodes across different graphs without supervision. Existing methods usually leverage the graph structure to aggregate features of nodes to find relations between nodes. However, the graph structure is inherently limited in pairwise relations be…

Cited by 0 Source ↗PDF ↗Scholar ↗

2024

An Optimal Transport View for Subspace Clustering and Spectral Clustering

Yuguang Yan, Zhihao Xu, Canlin Yang, Jie Zhang, Ruichu Cai, Michael Kwok-Po Ng

AAAI 2024technical

Clustering is one of the most fundamental problems in machine learning and data mining, and many algorithms have been proposed in the past decades. Among them, subspace clustering and spectral clustering are the most famous approaches. In this paper, we provide an explanation for subspace clustering…

Cited by 4 Source ↗PDF ↗Scholar ↗