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

Ci Nie

dblp:376/1914 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2025
—ORCID · none

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

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

Artificial intelligence
3 papers
Graph learning · 81% Trustworthy machine learning · 12% Efficient and distributed learning · 7%

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

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
graph representation learning
1.622025
Multiplex Graph Representation Learning with Homophily and Consistency · AAAI 2025
Multiplex Graph Representation Learning via Bi-level Optimization · IJCAI 2024
Machine learning › Graph learning › graph representation learning › multi-view graph representation learning
multiplex graph representation learning
1.622025
Multiplex Graph Representation Learning with Homophily and Consistency · AAAI 2025
Multiplex Graph Representation Learning via Bi-level Optimization · IJCAI 2024
Machine learning › Graph learning
graph neural network
0.912025
Noisy Node Classification by Bi-level Optimization Based Multi-Teacher Distillation · AAAI 2025
Machine learning › Trustworthy machine learning › robustness
learning with noisy labels
0.912025
Noisy Node Classification by Bi-level Optimization Based Multi-Teacher Distillation · AAAI 2025
Machine learning › Graph learning › graph neural network
node classification
0.912025
Noisy Node Classification by Bi-level Optimization Based Multi-Teacher Distillation · AAAI 2025
Machine learning › Graph learning › graph representation learning
unsupervised graph representation learning
0.912025
Multiplex Graph Representation Learning with Homophily and Consistency · AAAI 2025
Machine learning › Efficient and distributed learning › model compression
knowledge distillation
0.312025
Noisy Node Classification by Bi-level Optimization Based Multi-Teacher Distillation · AAAI 2025
Machine learning › Efficient and distributed learning › model compression › knowledge distillation
multi-teacher distillation
0.312025
Noisy Node Classification by Bi-level Optimization Based Multi-Teacher Distillation · AAAI 2025

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

bi-level optimization · 1.6self-supervised learning · 0.9self-expression matrix · 0.9knowledge distillation · 0.9contrastive learning · 0.9
YearPublicationVenuePosition
2025 Multiplex Graph Representation Learning with Homophily and Consistency
abstract
Although unsupervised multiplex graph representation learning (UMGRL) has been a hot research topic, existing UMGRL methods still has limitations to be addressed. For example, previous works either preserve structural information by ignoring the impact of heterophily in the graph structure or only focus on node-level consistency by ignoring class-level consistency. To address these issues, in this paper, we propose a new UMGRL method to explore both homophily and consistency in the multiplex graph. Specifically, we propose to restructure the multi-order relationships of every graph between every node and its multi-order neighbors to improve the homophily and reduce the impact of the heterophily in the graph structure. We also design a contrastive loss based on a self-expression matrix of the node representation to achieve node-level and class-level consistency. Furthermore, we theoretically prove our method to achieve class-level consistency. Extensive experimental results on real datasets verify the effectiveness of the proposed method with respect to node classification tasks, compared to SOTA methods.
Yudi Huang, Ci Nie, Hongqing He, Yujie Mo, Yonghua Zhu, Guoqiu Wen, Xiaofeng Zhu 0001
AAAI2
2025 Noisy Node Classification by Bi-level Optimization Based Multi-Teacher Distillation
abstract
Previous graph neural networks (GNNs) usually assume that the graph data is with clean labels for representation learning, but it is not true in real applications. In this paper, we propose a new multi-teacher distillation method based on bi-level optimization (namely BO-NNC), to conduct noisy node classification on the graph data. Specifically, we first employ multiple self-supervised learning methods to train diverse teacher models, and then aggregate their predictions through a teacher weight matrix. Furthermore, we design a new bi-level optimization strategy to dynamically adjust the teacher weight matrix based on the training progress of the student model. Finally, we design a label improvement module to improve the label quality. Extensive experimental results on real datasets show that our method achieves the best results compared to state-of-the-art methods.
Zongqian Wu, Zhengyu Lu, Ci Nie, Guoqiu Wen, Yonghua Zhu, Xiaofeng Zhu 0001
AAAI4
2024 Graph Fusion Based Autoencoder for Node Clustering
Ci Nie, Guoqiu Wen
ADMA (3)1
2024 Multiplex Graph Representation Learning via Bi-level Optimization
Yudi Huang, Yujie Mo, Ci Nie, Guoqiu Wen, Xiaofeng Zhu 0001
IJCAI4