Wei Hong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Wei Hong has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Hua Wang
Victoria University
11 shared publications - Jiao Yin
Victoria University
10 shared publications - Jinli Cao
La Trobe University, Melbourne, Australia
7 shared publications - Yanchun Zhang
Zhejiang Normal University
5 shared publications - Enamul Kabir
School of Mathematics, Physics and Computing, University of Southern Queensland, Toowoomba, Australia
3 shared publications - Yong-Feng Ge
Victoria University
3 shared publications
Latest Publications
- 7 November 2026
- Published by Springer Nature
- p. 81-93
DP-TrustBFL: A Differentially Private Blockchain Federated Learning Framework with Trust Management for Healthcare Data Mining
- 7 November 2026
- Published by Springer Nature
- p. 81-93
DP-TrustBFL: A Differentially Private Blockchain Federated Learning Framework with Trust Management for Healthcare Data Mining
- Open Access
- 7 October 2026
- Published by Springer Nature in World Wide Web
- Vol. 29 (6) , 49
Trading off privacy, utility, and stability in privacy-preserving K-means clustering using an adaptive multi-objective memetic algorithm
Protecting sensitive information while maintaining data utility is a fundamental challenge in privacy-preserving data mining. Differential Privacy (DP)-based K -means clustering provides a principled solution by injecting noise through a privacy budget; however, determining an optimal budget allocation remains a complex task due to the inherent trade-offs among privacy protection, clustering utility, and model stability. Motivated by the effectiveness of Evolutionary Algorithms (EAs) in solving complex optimization problems, this paper proposes an enhanced Adaptive Multi-Objective Memetic Algorithm for Differentially Private K -means (AMOMA-DPK) clustering. Unlike many existing approaches that primarily focus on one or two objectives, the proposed method simultaneously optimizes three conflicting objectives: maximizing privacy by minimizing the total privacy budget, maximizing clustering utility by minimizing the Normalized Intra-Cluster Variance (NICV), and maximizing clustering stability by minimizing clustering instability. These objectives are formulated within a Multi-Objective Optimization (MOO) framework, enabling the generation of a diverse set of Pareto-optimal solutions that support flexible decision-making based on application-specific privacy requirements. To effectively explore the search space, AMOMA-DPK incorporates an adaptive parameter memory mechanism that dynamically adjusts crossover and mutation rates based on historically successful configurations. This is complemented by a gene-wise adaptive crossover strategy, probabilistic mutation with budget-aware perturbation, and an imbalanced local search refinement that enhances exploitation by redistributing privacy budgets across iterations. Together, these components form a robust memetic framework capable of balancing exploration and exploitation while maintaining feasibility through repair operators. Experiments on three real-world datasets show that the proposed method generally produces more competitive Pareto fronts and higher hypervolume (HV) values than representative baselines, with the highest mean HV across all tested budget and cluster-count settings on Online Shoppers. Additional comparisons with fixed allocation strategies support its effectiveness, while ablation results show that individual component effects are dataset- and budget-dependent. These findings highlight the effectiveness of AMOMA-DPK for optimizing privacy budget allocation under the evaluated settings. The source code used in this study is publicly available at https://github.com/Wayne-on-the-road/AMOMA-DPK .
- 7 October 2026
- Published by Springer Nature in World Wide Web
- Vol. 29 (6) , 49
Open AccessTrading off privacy, utility, and stability in privacy-preserving K-means clustering using an adaptive multi-objective memetic algorithm
Protecting sensitive information while maintaining data utility is a fundamental challenge in privacy-preserving data mining. Differential Privacy (DP)-based K -means clustering provides a principled solution by injecting noise through a privacy budget; however, determining an optimal budget allocation remains a complex task due to the inherent trade-offs among privacy protection, clustering utility, and model stability. Motivated by the effectiveness of Evolutionary Algorithms (EAs) in solving complex optimization problems, this paper proposes an enhanced Adaptive Multi-Objective Memetic Algorithm for Differentially Private K -means (AMOMA-DPK) clustering. Unlike many existing approaches that primarily focus on one or two objectives, the proposed method simultaneously optimizes three conflicting objectives: maximizing privacy by minimizing the total privacy budget, maximizing clustering utility by minimizing the Normalized Intra-Cluster Variance (NICV), and maximizing clustering stability by minimizing clustering instability. These objectives are formulated within a Multi-Objective Optimization (MOO) framework, enabling the generation of a diverse set of Pareto-optimal solutions that support flexible decision-making based on application-specific privacy requirements. To effectively explore the search space, AMOMA-DPK incorporates an adaptive parameter memory mechanism that dynamically adjusts crossover and mutation rates based on historically successful configurations. This is complemented by a gene-wise adaptive crossover strategy, probabilistic mutation with budget-aware perturbation, and an imbalanced local search refinement that enhances exploitation by redistributing privacy budgets across iterations. Together, these components form a robust memetic framework capable of balancing exploration and exploitation while maintaining feasibility through repair operators. Experiments on three real-world datasets show that the proposed method generally produces more competitive Pareto fronts and higher hypervolume (HV) values than representative baselines, with the highest mean HV across all tested budget and cluster-count settings on Online Shoppers. Additional comparisons with fixed allocation strategies support its effectiveness, while ablation results show that individual component effects are dataset- and budget-dependent. These findings highlight the effectiveness of AMOMA-DPK for optimizing privacy budget allocation under the evaluated settings. The source code used in this study is publicly available at https://github.com/Wayne-on-the-road/AMOMA-DPK .
- 1 April 2026
- Published by Springer Nature
- p. 107-118
Optimal Privacy Budget Allocation Framework for Medical Data Publishing
- 1 April 2026
- Published by Springer Nature
- p. 107-118
Optimal Privacy Budget Allocation Framework for Medical Data Publishing
- Open Access
- 21 November 2024
- Published by Springer Nature in Data Science and Engineering
- Vol. 9 (4) , 393-408
Optimising Insider Threat Prediction: Exploring BiLSTM Networks and Sequential Features
Insider threats pose a critical risk to organisations, impacting their data, processes, resources, and overall security. Such significant risks arise from individuals with authorised access and familiarity with internal systems, emphasising the potential for insider threats to compromise the integrity of organisations. Previous research has addressed the challenge by pinpointing malicious actions that have already occurred but provided limited assistance in preventing those risks. In this research, we introduce a novel approach based on bidirectional long short-term memory (BiLSTM) networks that effectively captures and analyses the patterns of individual actions and their sequential dependencies. The focus is on predicting whether an individual would be a malicious insider in a future day based on their daily behavioural records over the previous several days. We analyse the performance of the four supervised learning algorithms on manual features, sequential features, and the ground truth of the day with different combinations. In addition, we investigate the performance of different RNN models, such as RNN, LSTM, and BiLSTM, in incorporating these features. Moreover, we explore the performance of different predictive lengths on the ground truth of the day and different embedded lengths for the sequential features. All the experiments are conducted on the CERT r4.2 dataset. Experiment results show that BiLSTM has the highest performance in combining these features.
- 21 November 2024
- Published by Springer Nature in Data Science and Engineering
- Vol. 9 (4) , 393-408
Open AccessOptimising Insider Threat Prediction: Exploring BiLSTM Networks and Sequential Features
Insider threats pose a critical risk to organisations, impacting their data, processes, resources, and overall security. Such significant risks arise from individuals with authorised access and familiarity with internal systems, emphasising the potential for insider threats to compromise the integrity of organisations. Previous research has addressed the challenge by pinpointing malicious actions that have already occurred but provided limited assistance in preventing those risks. In this research, we introduce a novel approach based on bidirectional long short-term memory (BiLSTM) networks that effectively captures and analyses the patterns of individual actions and their sequential dependencies. The focus is on predicting whether an individual would be a malicious insider in a future day based on their daily behavioural records over the previous several days. We analyse the performance of the four supervised learning algorithms on manual features, sequential features, and the ground truth of the day with different combinations. In addition, we investigate the performance of different RNN models, such as RNN, LSTM, and BiLSTM, in incorporating these features. Moreover, we explore the performance of different predictive lengths on the ground truth of the day and different embedded lengths for the sequential features. All the experiments are conducted on the CERT r4.2 dataset. Experiment results show that BiLSTM has the highest performance in combining these features.
- Open Access
- 31 July 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 18 (8) , 1-17
A Compact Vulnerability Knowledge Graph for Risk Assessment
Software vulnerabilities, also known as flaws, bugs or weaknesses, are common in modern information systems, putting critical data of organizations and individuals at cyber risk. Due to the scarcity of resources, initial risk assessment is becoming a necessary step to prioritize vulnerabilities and make better decisions on remediation, mitigation, and patching. Datasets containing historical vulnerability information are crucial digital assets to enable AI-based risk assessments. However, existing datasets focus on collecting information on individual vulnerabilities while simply storing them in relational databases, disregarding their structural connections. This article constructs a compact vulnerability knowledge graph, VulKG, containing over 276 K nodes and 1 M relationships to represent the connections between vulnerabilities, exploits, affected products, vendors, referred domain names, and more. We provide a detailed analysis of VulKG modeling and construction, demonstrating VulKG-based query and reasoning, and providing a use case of applying VulKG to a vulnerability risk assessment task, i.e., co-exploitation behavior discovery. Experimental results demonstrate the value of graph connections in vulnerability risk assessment tasks. VulKG offers exciting opportunities for more novel and significant research in areas related to vulnerability risk assessment. The data and codes of this article are available at https://github.com/happyResearcher/VulKG.git .
- 31 July 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 18 (8) , 1-17
Open AccessA Compact Vulnerability Knowledge Graph for Risk Assessment
Software vulnerabilities, also known as flaws, bugs or weaknesses, are common in modern information systems, putting critical data of organizations and individuals at cyber risk. Due to the scarcity of resources, initial risk assessment is becoming a necessary step to prioritize vulnerabilities and make better decisions on remediation, mitigation, and patching. Datasets containing historical vulnerability information are crucial digital assets to enable AI-based risk assessments. However, existing datasets focus on collecting information on individual vulnerabilities while simply storing them in relational databases, disregarding their structural connections. This article constructs a compact vulnerability knowledge graph, VulKG, containing over 276 K nodes and 1 M relationships to represent the connections between vulnerabilities, exploits, affected products, vendors, referred domain names, and more. We provide a detailed analysis of VulKG modeling and construction, demonstrating VulKG-based query and reasoning, and providing a use case of applying VulKG to a vulnerability risk assessment task, i.e., co-exploitation behavior discovery. Experimental results demonstrate the value of graph connections in vulnerability risk assessment tasks. VulKG offers exciting opportunities for more novel and significant research in areas related to vulnerability risk assessment. The data and codes of this article are available at https://github.com/happyResearcher/VulKG.git .
- Open Access
- 24 May 2024
- Published by Springer Nature in World Wide Web
- Vol. 27 (4) , 1-24
A heterogeneous graph-based semi-supervised learning framework for access control decision-making
For modern information systems, robust access control mechanisms are vital in safeguarding data integrity and ensuring the entire system’s security. This paper proposes a novel semi-supervised learning framework that leverages heterogeneous graph neural network-based embedding to encapsulate both the intricate relationships within the organizational structure and interactions between users and resources. Unlike existing methods focusing solely on individual user and resource attributes, our approach embeds organizational and operational interrelationships into the hidden layer node embeddings. These embeddings are learned from a self-supervised link prediction task based on a constructed access control heterogeneous graph via a heterogeneous graph neural network. Subsequently, the learned node embeddings, along with the original node features, serve as inputs for a supervised access control decision-making task, facilitating the construction of a machine-learning access control model. Experimental results on the open-sourced Amazon access control dataset demonstrate that our proposed framework outperforms models using original or manually extracted graph-based features from previous works. The prepossessed data and codes are available on GitHub,facilitating reproducibility and further research endeavors.
- 24 May 2024
- Published by Springer Nature in World Wide Web
- Vol. 27 (4) , 1-24
Open AccessA heterogeneous graph-based semi-supervised learning framework for access control decision-making
For modern information systems, robust access control mechanisms are vital in safeguarding data integrity and ensuring the entire system’s security. This paper proposes a novel semi-supervised learning framework that leverages heterogeneous graph neural network-based embedding to encapsulate both the intricate relationships within the organizational structure and interactions between users and resources. Unlike existing methods focusing solely on individual user and resource attributes, our approach embeds organizational and operational interrelationships into the hidden layer node embeddings. These embeddings are learned from a self-supervised link prediction task based on a constructed access control heterogeneous graph via a heterogeneous graph neural network. Subsequently, the learned node embeddings, along with the original node features, serve as inputs for a supervised access control decision-making task, facilitating the construction of a machine-learning access control model. Experimental results on the open-sourced Amazon access control dataset demonstrate that our proposed framework outperforms models using original or manually extracted graph-based features from previous works. The prepossessed data and codes are available on GitHub,facilitating reproducibility and further research endeavors.
- 28 April 2024
- Published by Springer Nature
- p. 464-476
A Study on Historical Behaviour Enabled Insider Threat Prediction
- 28 April 2024
- Published by Springer Nature
- p. 464-476
A Study on Historical Behaviour Enabled Insider Threat Prediction
- 21 October 2023
- Published by Springer Nature
- p. 179-188
Bilateral Insider Threat Detection: Harnessing Standalone and Sequential Activities with Recurrent Neural Networks
- 21 October 2023
- Published by Springer Nature
- p. 179-188
Bilateral Insider Threat Detection: Harnessing Standalone and Sequential Activities with Recurrent Neural Networks
- 21 October 2023
- Published by Springer Nature
- p. 289-299
Empowering Vulnerability Prioritization: A Heterogeneous Graph-Driven Framework for Exploitability Prediction
- 21 October 2023
- Published by Springer Nature
- p. 289-299
Empowering Vulnerability Prioritization: A Heterogeneous Graph-Driven Framework for Exploitability Prediction