Demo Data from VLDB 2026 / reviewers in the wild / expert
Jingxuan Cao
dblp:246/3063
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1
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 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Graph learning › graph neural network
graph convolution |
0.4 | 1 | 2019 | Dynamic Hypergraph Neural Networks · IJCAI 2019 |
Machine learning › Graph learning › hypergraph learning
hypergraph convolution |
0.4 | 1 | 2019 | Dynamic Hypergraph Neural Networks · IJCAI 2019 |
Machine learning › Graph learning › hypergraph learning
hypergraph neural network |
0.4 | 1 | 2019 | Dynamic Hypergraph Neural Networks · IJCAI 2019 |
Methods — techniques the papers use, named apart from their topics
hypergraph convolution · 0.4dynamic structure learning · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Dynamic Hypergraph Neural NetworksabstractIn recent years, graph/hypergraph-based deep learning methods have attracted much attention from researchers. These deep learning methods take graph/hypergraph structure as prior knowledge in the model. However, hidden and important relations are not directly represented in the inherent structure. To tackle this issue, we propose a dynamic hypergraph neural networks framework (DHGNN), which is composed of the stacked layers of two modules: dynamic hypergraph construction (DHG) and hypergrpah convolution (HGC). Considering initially constructed hypergraph is probably not a suitable representation for data, the DHG module dynamically updates hypergraph structure on each layer. Then hypergraph convolution is introduced to encode high-order data relations in a hypergraph structure. The HGC module includes two phases: vertex convolution and hyperedge convolution, which are designed to aggregate feature among vertices and hyperedges, respectively. We have evaluated our method on standard datasets, the Cora citation network and Microblog dataset. Our method outperforms state-of-the-art methods. More experiments are conducted to demonstrate the effectiveness and robustness of our method to diverse data distributions. Jianwen Jiang, Yuxuan Wei, Yifan Feng 0001, Jingxuan Cao, Yue Gao 0002 |
IJCAI | 4 |