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

Wencong Lin

dblp:358/0827 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0006-9813-9706ORCID · 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 · 87% Representation and self-supervised learning · 13%

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

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
graph neural network
1.012026
SGA: Self-boosting Attributed Graph Alignment via Neighborhood Consistency-based Edge Enhancement · KDD (1) 2026
Machine learning › Graph learning
network alignment
1.012026
SGA: Self-boosting Attributed Graph Alignment via Neighborhood Consistency-based Edge Enhancement · KDD (1) 2026
Machine learning › Representation and self-supervised learning
neighborhood consistency
0.312026
SGA: Self-boosting Attributed Graph Alignment via Neighborhood Consistency-based Edge Enhancement · KDD (1) 2026

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

node embedding · 1.0graph neural network · 1.0
YearPublicationVenuePosition
2026 SGA: Self-boosting Attributed Graph Alignment via Neighborhood Consistency-based Edge Enhancement
abstract
Graph alignment, the task of identifying corresponding nodes across different graphs, is crucial for applications ranging from social network analysis to bioinformatics. Although most existing methods leverage graph neural networks (GNNs) to learn node embeddings for attributed graphs and match them based on node similarity, they often rely on objectives designed for node classification or link prediction. These approaches preserve node proximity within individual graphs but fail to capture cross-graph correspondence knowledge, leading to suboptimal alignment performance.
Chenxu Wang 0001, Wencong Lin, Pinghui Wang, Tao Qin 0002, Wei Wang 0012, Xiaohong Guan
KDD (1)2