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

Chaolv Zeng

dblp:372/1481 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
0009-0005-3534-5281ORCID · reported

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

Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 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%

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

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning › graph neural network › efficient graph neural network
graph condensation
0.812024
Graph Data Condensation via Self-expressive Graph Structure Reconstruction · KDD 2024
Machine learning › Graph learning › graph neural network training › graph distillation
graph dataset distillation
0.812024
Graph Data Condensation via Self-expressive Graph Structure Reconstruction · KDD 2024
Machine learning › Graph learning
graph neural network
0.812024
Graph Data Condensation via Self-expressive Graph Structure Reconstruction · KDD 2024
Machine learning › Graph learning
graph structure learning
0.212024
Graph Data Condensation via Self-expressive Graph Structure Reconstruction · KDD 2024

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

self-expressive reconstruction · 0.8
YearPublicationVenuePosition
2024 Graph Data Condensation via Self-expressive Graph Structure Reconstruction
abstract
With the increasing demands of training graph neural networks (GNNs) on large-scale graphs, graph data condensation has emerged as a critical technique to relieve the storage and time costs during the training phase. It aims to condense the original large-scale graph to a much smaller synthetic graph while preserving the essential information necessary for efficiently training a downstream GNN. However, existing methods concentrate either on optimizing node features exclusively or endeavor to independently learn node features and the graph structure generator. They could not explicitly leverage the information of the original graph structure and failed to construct an interpretable graph structure for the synthetic dataset. To address these issues, we introduce a novel framework named Graph Data Condensation via Self-expressive Graph Structure Reconstruction (GCSR). Our method stands out by (1) explicitly incorporating the original graph structure into the condensing process and (2) capturing the nuanced interdependencies between the condensed nodes by reconstructing an interpretable self-expressive graph structure. Extensive experiments and comprehensive analysis validate the efficacy of the proposed method across diverse GNN models and datasets. Our code is available at https://github.com/zclzcl0223/GCSR.
Zhanyu Liu, Chaolv Zeng, Guanjie Zheng
KDD2