Mengting Zhou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Mengting Zhou has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Zhiguo Gong
University of Macau
3 shared publications - Binbin Song
Faculty of Computing Harbin Institute of Technology Harbin China
1 shared publication - Jialong Wang
State Key Laboratory of Internet of Things for Smart City, University of Macau, Taipa, Macao
1 shared publication - Jiandian Zeng
Institute of Artificial Intelligence and Future Networks, Beijing Normal University, Zhuhai, China
1 shared publication - Junjie Liao
Faculty of Arts and Sciences, Beijing Normal University, Zhuhai, China
1 shared publication - Shilong Zhang
State Key Laboratory of Internet of Things for Smart City, University of Macau, Taipa, Macao
1 shared publication
Latest Publications
- 1 March 2026
- Published by Elsevier in Pattern Recognition
- Vol. 178
Unlocking explainable and effective multimodal affective reasoning via large language models
- 1 March 2026
- Published by Elsevier in Pattern Recognition
- Vol. 178
Unlocking explainable and effective multimodal affective reasoning via large language models
- 21 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (12) , 8901-8913
Neighbor Distribution Learning for Minority Class Augmentation
Graph Neural Networks (GNNs) have achieved remarkable success in graph-based tasks. However, learning unbiased node representations under class-imbalanced training data remains challenging. Existing solutions may face overfitting due to extensive reuse of those limited labeled data in minority classes. Furthermore, many works address the class-imbalanced issue based on the embeddings generated from the biased GNNs, which make models intrinsically biased towards majority classes. In this paper, we propose a novel data augmentation strategy GraphGLS for semi-supervised class-imbalanced node classification, which aims to select informative unlabeled nodes to augment minority classes with consideration of both global and local information. Specifically, we first design a Global Selection module to learn global information (pseudo-labels) for unlabeled nodes and then select potential ones from them for minority classes. The Local Selection module further conducts filtering over those potential nodes by comparing their neighbor distributions with minority classes. To achieve this, we further design a neighbor distribution auto-encoder to learn a robust node-level neighbor distribution for each node. Then, we define class-level neighbor distribution to capture the overall neighbor characteristics of nodes within the same class. We conduct extensive experiments on multiple datasets, and the results demonstrate the superiority of GraphGLS over state-of-the-art baselines.
- 21 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (12) , 8901-8913
Neighbor Distribution Learning for Minority Class Augmentation
Graph Neural Networks (GNNs) have achieved remarkable success in graph-based tasks. However, learning unbiased node representations under class-imbalanced training data remains challenging. Existing solutions may face overfitting due to extensive reuse of those limited labeled data in minority classes. Furthermore, many works address the class-imbalanced issue based on the embeddings generated from the biased GNNs, which make models intrinsically biased towards majority classes. In this paper, we propose a novel data augmentation strategy GraphGLS for semi-supervised class-imbalanced node classification, which aims to select informative unlabeled nodes to augment minority classes with consideration of both global and local information. Specifically, we first design a Global Selection module to learn global information (pseudo-labels) for unlabeled nodes and then select potential ones from them for minority classes. The Local Selection module further conducts filtering over those potential nodes by comparing their neighbor distributions with minority classes. To achieve this, we further design a neighbor distribution auto-encoder to learn a robust node-level neighbor distribution for each node. Then, we define class-level neighbor distribution to capture the overall neighbor characteristics of nodes within the same class. We conduct extensive experiments on multiple datasets, and the results demonstrate the superiority of GraphGLS over state-of-the-art baselines.
- 18 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 12 (4) , 1805-1815
Generalized Few-Shot Node Classification With Graph Knowledge Distillation
Generalized few-shot node classification (GFS-NC) is a very important challenge for graph-based algorithms, as it requires to identify novel classes and base classes simultaneously. Although there are several methods that try to combine metalearning or metric learning with graph neural networks to solve few-shot problem, most of them assume that test samples only come from the novel classes, which is impractical in reality. Besides, they overlook the relationship among classes, which can provide additional information for the novel classes classification. In this article, we propose a graph-based knowledge distillation network (GraphKD) to extract the class relationship and learn better nodes representations for nodes from novel classes in GFS-NC task. GraphKD consists of two modules: balanced pretraining module and class-relation transferring module. Balanced pretraining can optimize network parameters to a suitable manifold for subsequent initialization. The class-relation transferring module leverages a knowledge distillation model, where a teacher model generates soft labels containing interclass relationships and then transfer them to the student model. The student model is optimized to fit both the soft labels and hard labels concurrently. This relationship information can help the student model better understand the similarities and differences between classes, thereby improving its classification performance. In addition, we employee information entropy to distinguish the samples locate at the boundary of a base class and novel class and then assign them larger weights in the student model to enhance its expressive capacity for novel nodes. Our experiments show that the proposed method outperforms state-of-the-art baselines on various few-shot node classification datasets.
- 18 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 12 (4) , 1805-1815
Generalized Few-Shot Node Classification With Graph Knowledge Distillation
Generalized few-shot node classification (GFS-NC) is a very important challenge for graph-based algorithms, as it requires to identify novel classes and base classes simultaneously. Although there are several methods that try to combine metalearning or metric learning with graph neural networks to solve few-shot problem, most of them assume that test samples only come from the novel classes, which is impractical in reality. Besides, they overlook the relationship among classes, which can provide additional information for the novel classes classification. In this article, we propose a graph-based knowledge distillation network (GraphKD) to extract the class relationship and learn better nodes representations for nodes from novel classes in GFS-NC task. GraphKD consists of two modules: balanced pretraining module and class-relation transferring module. Balanced pretraining can optimize network parameters to a suitable manifold for subsequent initialization. The class-relation transferring module leverages a knowledge distillation model, where a teacher model generates soft labels containing interclass relationships and then transfer them to the student model. The student model is optimized to fit both the soft labels and hard labels concurrently. This relationship information can help the student model better understand the similarities and differences between classes, thereby improving its classification performance. In addition, we employee information entropy to distinguish the samples locate at the boundary of a base class and novel class and then assign them larger weights in the student model to enhance its expressive capacity for novel nodes. Our experiments show that the proposed method outperforms state-of-the-art baselines on various few-shot node classification datasets.
- 29 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 12 (4) , 1794-1804
Informative Nodes Mining for Class-Imbalanced Representation Learning
Online social networks often enforce a restricted web interface to allow third part users to access their data objects in one-by-one manner along links. The heavy cost of collecting data from them makes it very difficult to train a graph neural networks (GNNs) algorithm by using valuable data resources from those social network services. In this article, we endeavor to harness the potential of collected data in order to cultivate robust node representations, all while taking into account the prevalent class-imbalanced scenario. To this end, we propose a framework based on the reinforcement learning technique that can implement training while sampling. We employee deep Q-learning network (DQN) as the basic reinforcement learning framework which maintains an experience replay buffer to store experiences in order to improve efficiency and generalization ability of the algorithm. The proposed framework can guide the training process according to the label distribution of the currently collected training data. To maximize the utility of the collected data, we introduce two ways to guide the agent to learn more robust node representations under the natural class-imbalanced scenario. Specifically, effective-number GNNs (ENG) try to employ a reward function with the technique of effective number and resampling GNNs (RSG) attempts to modify the state transition function motivated by resampling technique. Extensive experiments are conducted on several real-world imbalanced datasets and the proposed methods significantly outperform the state-of-the-art methods in node classification task, accomplishing higher performance while utilizing a reduced volume of data.
- 29 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 12 (4) , 1794-1804
Informative Nodes Mining for Class-Imbalanced Representation Learning
Online social networks often enforce a restricted web interface to allow third part users to access their data objects in one-by-one manner along links. The heavy cost of collecting data from them makes it very difficult to train a graph neural networks (GNNs) algorithm by using valuable data resources from those social network services. In this article, we endeavor to harness the potential of collected data in order to cultivate robust node representations, all while taking into account the prevalent class-imbalanced scenario. To this end, we propose a framework based on the reinforcement learning technique that can implement training while sampling. We employee deep Q-learning network (DQN) as the basic reinforcement learning framework which maintains an experience replay buffer to store experiences in order to improve efficiency and generalization ability of the algorithm. The proposed framework can guide the training process according to the label distribution of the currently collected training data. To maximize the utility of the collected data, we introduce two ways to guide the agent to learn more robust node representations under the natural class-imbalanced scenario. Specifically, effective-number GNNs (ENG) try to employ a reward function with the technique of effective number and resampling GNNs (RSG) attempts to modify the state transition function motivated by resampling technique. Extensive experiments are conducted on several real-world imbalanced datasets and the proposed methods significantly outperform the state-of-the-art methods in node classification task, accomplishing higher performance while utilizing a reduced volume of data.