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

Jingkai Peng

dblp:368/0565 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2023
—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 2021Databases, data management, data science and information retrieval · 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.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Data mining › structured data mining › graph mining › network alignment
attributed network alignment
0.712023
Robust Network Alignment with the Combination of Structure and Attribute Embeddings · ICDM 2023
Data mining › structured data mining
graph mining
0.712023
Robust Network Alignment with the Combination of Structure and Attribute Embeddings · ICDM 2023
Data mining › structured data mining › graph mining
network alignment
0.712023
Robust Network Alignment with the Combination of Structure and Attribute Embeddings · ICDM 2023
Data mining › structured data mining › graph mining
network embedding
0.712023
Robust Network Alignment with the Combination of Structure and Attribute Embeddings · ICDM 2023

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

graph augmentation · 0.7graph attention network · 0.7embedding · 0.7
YearPublicationVenuePosition
2023 Robust Network Alignment with the Combination of Structure and Attribute Embeddings
abstract
The task of network alignment is to obtain the node pairs which belong to the same entity from different networks. Existing embedding-based network alignment methods either use node structural or attribute information as inputs for node embeddings. These pieces of information are not always available in real-world datasets, and current methods that consider single information embedding may fail when there is excessive network noise. To address the aforementioned issue, we utilize a multi-layer Graph Attention Networks(GATs) to design an unsupervised node embedding model, which trains two GATs for structural and attribute information in a single graph and embeds the source nodes and target nodes into the same embedding space. By applying graph augmentation techniques, the model learns structural embeddings and attribute embeddings for every node in the networks based on structural and attribute consistency. Moreover, we apply a topological alignment refinement process to get aligned node pairs, which further enhances the accuracy of network alignment by leveraging the similarity of the structure between networks. Through extensive experiments, we have demonstrated that our model outperforms the state-of-the-art models in terms of alignment accuracy and its ability to handle attribute and structural noise. Additionally, our model exhibits relatively low complexity.
Jingkai Peng, Shirui Pan, Liang Wang 0017
ICDM1