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.

Yangkai Xue

dblp:371/6266 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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%

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 convolutional network
0.812024
Residual Hyperbolic Graph Convolution Networks · AAAI 2024
Machine learning › Graph learning
graph neural network
0.812024
Residual Hyperbolic Graph Convolution Networks · AAAI 2024
Machine learning › Graph learning › graph neural network › graph convolutional network
hyperbolic graph convolutional network
0.812024
Residual Hyperbolic Graph Convolution Networks · AAAI 2024
Machine learning › Graph learning › graph neural network › deep graph neural network
over-smoothing
0.812024
Residual Hyperbolic Graph Convolution Networks · AAAI 2024

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

residual connections · 0.8product manifold · 0.8hyperdrop · 0.8
YearPublicationVenuePosition
2024 Residual Hyperbolic Graph Convolution Networks
abstract
Hyperbolic graph convolutional networks (HGCNs) have demonstrated representational capabilities of modeling hierarchical-structured graphs. However, as in general GCNs, over-smoothing may occur as the number of model layers increases, limiting the representation capabilities of most current HGCN models. In this paper, we propose residual hyperbolic graph convolutional networks (R-HGCNs) to address the over-smoothing problem. We introduce a hyperbolic residual connection function to overcome the over-smoothing problem, and also theoretically prove the effectiveness of the hyperbolic residual function. Moreover, we use product manifolds and HyperDrop to facilitate the R-HGCNs. The distinctive features of the R-HGCNs are as follows: (1) The hyperbolic residual connection preserves the initial node information in each layer and adds a hyperbolic identity mapping to prevent node features from being indistinguishable. (2) Product manifolds in R-HGCNs have been set up with different origin points in different components to facilitate the extraction of feature information from a wider range of perspectives, which enhances the representing capability of R-HGCNs. (3) HyperDrop adds multiplicative Gaussian noise into hyperbolic representations, such that perturbations can be added to alleviate the over-fitting problem without deconstructing the hyperbolic geometry. Experiment results demonstrate the effectiveness of R-HGCNs under various graph convolution layers and different structures of product manifolds.
Yangkai Xue, Jindou Dai, Zhipeng Lu 0003, Yuwei Wu 0001, Yunde Jia
AAAI1