Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ningkang Chang

dblp:400/6002 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Graph learning · 100%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning › graph neural network
graph transformer
0.912025
Hgformer: Hyperbolic Graph Transformer for Collaborative Filtering · ICML 2025
Machine learning › Graph learning › graph neural network › geometric graph neural network
hyperbolic graph neural network
0.912025
Hgformer: Hyperbolic Graph Transformer for Collaborative Filtering · ICML 2025
Recommender systems
collaborative filtering
0.912025
Hgformer: Hyperbolic Graph Transformer for Collaborative Filtering · ICML 2025
Recommender systems › collaborative filtering › graph collaborative filtering
graph neural network-based collaborative filtering
0.912025
Hgformer: Hyperbolic Graph Transformer for Collaborative Filtering · ICML 2025

Methods — techniques the papers use, named apart from their topics

hyperbolic graph convolution · 1.7cross-attention · 1.7
YearPublicationVenuePosition
2025 Hgformer: Hyperbolic Graph Transformer for Collaborative Filtering
abstract
Recommender systems are increasingly spreading to different areas like e-commerce or video streaming to alleviate information overload. One of the most fundamental methods for recommendation is Collaborative Filtering (CF), which leverages historical user-item interactions to infer user preferences. In recent years, Graph Neural Networks (GNNs) have been extensively studied to capture graph structures in CF tasks. Despite this remarkable progress, local structure modeling and embedding distortion still remain two notable limitations in the majority of GNN-based CF methods. Therefore, in this paper, we propose a novel Hyperbolic Graph Transformer architecture, to tackle the long-tail problems in CF tasks. Specifically, the proposed framework is comprised of two essential modules: 1) Local Hyperbolic Graph Convolutional Network (LHGCN), which performs graph convolution entirely in the hyperbolic manifold and captures the local structure of each node; 2) Hyperbolic Transformer, which is comprised of hyperbolic cross-attention mechanisms to capture global information. Furthermore, to enable its feasibility on large-scale data, we introduce an unbiased approximation of the cross-attention for linear computational complexity, with a theoretical guarantee in approximation errors. Empirical experiments demonstrate that our proposed model outperforms the leading collaborative filtering methods and significantly mitigates the long-tail issue in CF tasks. Our implementations are available in https://github.com/EnkiXin/Hgformer.
Xin Yang 0041, Xingrun Li, Heng Chang, Jinze Yang, Xihong Yang, Shengyu Tao, Maiko Shigeno, Ningkang Chang, Junfeng Wang 0009, Dawei Yin 0001, Erxue Min
ICML8