Alex Munyole Luvembe
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Alex Munyole Luvembe has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Weimin Li
School of Computer Engineering and Science, Shanghai University, Shanghai, P. R. China
7 shared publications - Shaohua Li
College of Computer Science and Technology, Zhejiang University, Hangzhou, Zhejiang, China
4 shared publications - Weiqin Tong
School of Computer Engineering and Science, Shanghai University, Shanghai, China
3 shared publications - Quan-Ke Pan
School of Mechatronic Engineering and Automation, Shanghai University, Shanghai, P. R. China
2 shared publications - Qun Jin
Waseda University, Tokyo, Japan
2 shared publications - Chunlei Chai
College of Computer Science and Technology, Zhejiang University, Hangzhou, China
1 shared publication
Latest Publications
- Top Cited Papers
- 22 March 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 320
Ontology-enhanced subgraph reasoning with prompt learning for inductive knowledge graph completion
- 22 March 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 320
Top Cited PapersOntology-enhanced subgraph reasoning with prompt learning for inductive knowledge graph completion
- 27 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26 (12) , 22497-22511
Position-Invariant Graph Convolutional Recurrent Network for Traffic Forecasting
Traffic forecasting leverages multivariate time series analysis to predict traffic patterns. Real-world traffic data comprises two distinct types of latent time-series signals: diffuse signals, which refer to time-varying information propagated across the traffic network, and intrinsic signals, which capture unique, location-specific patterns. However, existing approaches often treat traffic signals solely as diffusion outcomes, overlooking the intrinsic characteristics that can significantly influence model performance. To address this issue, we propose the Position-invariant Graph Convolutional Recurrent Network (PGCRN), which decouples diffuse and intrinsic signals for improved traffic forecasting. Instead of relying on a predefined graph, PGCRN learns graph structures from spatio-temporal data through a learnable position-invariant node representation that forms an adaptive adjacency matrix. This is integrated into a Graph Convolutional Recurrent Network (GCRN) encoder–decoder to jointly capture spatial and temporal dependencies. Furthermore, we introduce a contrastive learning framework in which a node’s time-varying and position-invariant representations form positive pairs, while position-invariant representations from different nodes form negative pairs. The model is trained with a triplet loss. Experiments on four benchmark datasets show that PGCRN consistently outperforms strong baselines. Owing to its computational efficiency, PGCRN is also well suited for deployment on resource-constrained edge devices.
- 27 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26 (12) , 22497-22511
Position-Invariant Graph Convolutional Recurrent Network for Traffic Forecasting
Traffic forecasting leverages multivariate time series analysis to predict traffic patterns. Real-world traffic data comprises two distinct types of latent time-series signals: diffuse signals, which refer to time-varying information propagated across the traffic network, and intrinsic signals, which capture unique, location-specific patterns. However, existing approaches often treat traffic signals solely as diffusion outcomes, overlooking the intrinsic characteristics that can significantly influence model performance. To address this issue, we propose the Position-invariant Graph Convolutional Recurrent Network (PGCRN), which decouples diffuse and intrinsic signals for improved traffic forecasting. Instead of relying on a predefined graph, PGCRN learns graph structures from spatio-temporal data through a learnable position-invariant node representation that forms an adaptive adjacency matrix. This is integrated into a Graph Convolutional Recurrent Network (GCRN) encoder–decoder to jointly capture spatial and temporal dependencies. Furthermore, we introduce a contrastive learning framework in which a node’s time-varying and position-invariant representations form positive pairs, while position-invariant representations from different nodes form negative pairs. The model is trained with a triplet loss. Experiments on four benchmark datasets show that PGCRN consistently outperforms strong baselines. Owing to its computational efficiency, PGCRN is also well suited for deployment on resource-constrained edge devices.
- 12 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 13 (2) , 1241-1255
Rumor Detection Based on Supervised Multiprototype Contrastive Learning
Graph neural networks (GNNs) have shown great promise in rumor detection by leveraging user interactions and propagation structures. However, existing GNN-based methods primarily aggregate low-frequency signals, leading to oversmoothing and the loss of distinctive features in user feedback. Additionally, the data imbalance and sparsity in social media platforms hinder the training of robust detection models. To address these challenges, this article proposes the signed graph transformer network (SGTN) and supervised multiprototype contrastive learning (SMPCL) framework. SGTN adaptsively captures low-frequency similarities and high-frequency differences in user comments, effectively enhancing the representation of relationships in rumor propagation. SMPCL introduces learnable prototypes for each class, mitigating the effects of data imbalance and enabling more effective contrastive learning in small batches. Extensive experiments on real-world datasets, including Twitter15, Twitter16, and PHEME, demonstrate the superior performance of the proposed framework. SGTN and SMPCL achieve significant improvements, with the highest accuracy of 89.7% on Twitter15, 91.3% on Twitter16, and 84.3% on PHEME. Compared with state-of-the-art models, SMPCL achieves up to 3.5% F1-score gains in rumor classification tasks, showcasing its robustness and effectiveness in addressing oversmoothing and data imbalance challenges.
- 12 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 13 (2) , 1241-1255
Rumor Detection Based on Supervised Multiprototype Contrastive Learning
Graph neural networks (GNNs) have shown great promise in rumor detection by leveraging user interactions and propagation structures. However, existing GNN-based methods primarily aggregate low-frequency signals, leading to oversmoothing and the loss of distinctive features in user feedback. Additionally, the data imbalance and sparsity in social media platforms hinder the training of robust detection models. To address these challenges, this article proposes the signed graph transformer network (SGTN) and supervised multiprototype contrastive learning (SMPCL) framework. SGTN adaptsively captures low-frequency similarities and high-frequency differences in user comments, effectively enhancing the representation of relationships in rumor propagation. SMPCL introduces learnable prototypes for each class, mitigating the effects of data imbalance and enabling more effective contrastive learning in small batches. Extensive experiments on real-world datasets, including Twitter15, Twitter16, and PHEME, demonstrate the superior performance of the proposed framework. SGTN and SMPCL achieve significant improvements, with the highest accuracy of 89.7% on Twitter15, 91.3% on Twitter16, and 84.3% on PHEME. Compared with state-of-the-art models, SMPCL achieves up to 3.5% F1-score gains in rumor classification tasks, showcasing its robustness and effectiveness in addressing oversmoothing and data imbalance challenges.
- 30 November 2023
- Published by Springer Nature
- p. 256-267
Graph Contrastive ATtention Network for Rumor Detection
- 30 November 2023
- Published by Springer Nature
- p. 256-267
Graph Contrastive ATtention Network for Rumor Detection
- 26 November 2023
- Published by Springer Nature
- p. 165-176
Rumor Detection with Supervised Graph Contrastive Regularization
- 26 November 2023
- Published by Springer Nature
- p. 165-176
Rumor Detection with Supervised Graph Contrastive Regularization
- 4 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 11 (4) , 5158-5167
Graph Contrastive Learning With Feature Augmentation for Rumor Detection
While online social media brings convenience to people’s communication, it has also caused the widespread spread of rumors and brought great harm. Recent deep-learning approaches attempt to identify rumors by engaging in interactive user feedback. However, the performance of these models suffers from insufficient and noisy labeled data. In this article, we propose a novel rumor detection model called graph contrastive learning with feature augmentation (FAGCL), which injects noise into the feature space and learns contrastively by constructing asymmetric structures. FAGCL takes user preference and news embedding as the initial features of the rumor propagation tree and then adopts a graph attention network to update node representations. To obtain the graph-level representation for rumor classification, FAGCL fuses multiple pooling techniques. Moreover, FAGCL adopts graph contrastive learning as an auxiliary task to constrain the representation consistency. Contrastive learning on noisy data mines the supervision information of the rumor propagation tree itself, making the model more robust and effective. Results on two real-world datasets demonstrate that our proposed FAGCL model achieves significant improvements over the baseline models.
- 4 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 11 (4) , 5158-5167
Graph Contrastive Learning With Feature Augmentation for Rumor Detection
While online social media brings convenience to people’s communication, it has also caused the widespread spread of rumors and brought great harm. Recent deep-learning approaches attempt to identify rumors by engaging in interactive user feedback. However, the performance of these models suffers from insufficient and noisy labeled data. In this article, we propose a novel rumor detection model called graph contrastive learning with feature augmentation (FAGCL), which injects noise into the feature space and learns contrastively by constructing asymmetric structures. FAGCL takes user preference and news embedding as the initial features of the rumor propagation tree and then adopts a graph attention network to update node representations. To obtain the graph-level representation for rumor classification, FAGCL fuses multiple pooling techniques. Moreover, FAGCL adopts graph contrastive learning as an auxiliary task to constrain the representation consistency. Contrastive learning on noisy data mines the supervision information of the rumor propagation tree itself, making the model more robust and effective. Results on two real-world datasets demonstrate that our proposed FAGCL model achieves significant improvements over the baseline models.