Zhouguo Chen
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
Zhouguo Chen has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- Jianwei J. Ding
Department of Library and Information Science, 30th Research Institute of China Electronics Technology Group Corporation, China
2 shared publications - Ling Tian
University of Electronic Science and Technology of China, Chengdu, China
2 shared publications Quanjiang Guo
School of Computer Science and Engineering, University of Electronic Science and Technology of China,Chengdu,China
2 shared publications- Tao Qin
School of Computer Science and Technology, Xian Jiaotong University, Xian, China
2 shared publications - Zhao Kang
University of Electronic Science and Technology of China
2 shared publications - Baojiang Cui
School of Cyberspace Security, Beijing University of Posts and Telecommunications, Beijing, China
1 shared publication
Latest Publications
- Open Access
- 28 May 2025
- Published by MDPI AG in Electronics
- Vol. 14 (11) , 2190
Malicious Cloud Service Traffic Detection Based on Multi-Feature Fusion
With the rapid growth of cloud computing, malicious attacks targeting cloud services have become increasingly sophisticated and prevalent. To address the limitations of traditional detection methods—such as reliance on single-dimensional features and poor generalization—we propose a novel malicious request detection model based on multi-feature fusion. The model adopts a dual-branch architecture that independently extracts and learns from statistical attributes (e.g., field lengths, entropy) and field attributes (e.g., semantic content of the requested fields). To enhance feature representation, an attention-based fusion mechanism is introduced to dynamically weight and integrate field-level features, while a Gini coefficient-guided random forest algorithm is used to select the most informative statistical features. This design enables the model to capture both structural and semantic characteristics of cloud service traffic. Extensive experiments on the benchmark CSIC 2010 dataset and a real-world labeled cloud service dataset demonstrated that the proposed model significantly outperforms existing approaches in terms of accuracy, precision, recall, and F1 score. These results validate the effectiveness and robustness of our multi-feature fusion approach for detecting malicious requests in cloud environments.
- 28 May 2025
- Published by MDPI AG in Electronics
- Vol. 14 (11) , 2190
Open AccessMalicious Cloud Service Traffic Detection Based on Multi-Feature Fusion
With the rapid growth of cloud computing, malicious attacks targeting cloud services have become increasingly sophisticated and prevalent. To address the limitations of traditional detection methods—such as reliance on single-dimensional features and poor generalization—we propose a novel malicious request detection model based on multi-feature fusion. The model adopts a dual-branch architecture that independently extracts and learns from statistical attributes (e.g., field lengths, entropy) and field attributes (e.g., semantic content of the requested fields). To enhance feature representation, an attention-based fusion mechanism is introduced to dynamically weight and integrate field-level features, while a Gini coefficient-guided random forest algorithm is used to select the most informative statistical features. This design enables the model to capture both structural and semantic characteristics of cloud service traffic. Extensive experiments on the benchmark CSIC 2010 dataset and a real-world labeled cloud service dataset demonstrated that the proposed model significantly outperforms existing approaches in terms of accuracy, precision, recall, and F1 score. These results validate the effectiveness and robustness of our multi-feature fusion approach for detecting malicious requests in cloud environments.
- Open Access
- 27 September 2024
- Published by Association for Computing Machinery (ACM)
- p. 354-361
FedVC: Virtual Clients for Federated Learning with Imbalanced Label Distribution
- 27 September 2024
- Published by Association for Computing Machinery (ACM)
- p. 354-361
Open AccessFedVC: Virtual Clients for Federated Learning with Imbalanced Label Distribution
- Open Access
- 23 January 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-6
How to Find New Onion Hidden Service based on Blind Secret Key?
-With the development of Internet technology and privacy protection, anonymous network technology is widely used to browse, publish and deliver private or sensitive information on the Internet, such as The Onion Router (Tor). Tor is the most widely used service to protect the user's privacy, because of its bidirectional anonymous mechanism, which makes it so difficult to correlate and find the real Tor web service provider. Actually, Tor is the most influential dark web that contains a lot of illegally sensitive information, which becomes a big challenge to find the new Onion service quickly. Since Tor's specific communication mode makes the instant detection for new Onion service becomes more and more impossible. Before Tor V3 protocol was released, the researcher is able to use reverse calculation to get the real time Tor web service address by deploying the Tor honey pot. Although, with Tor V3 protocol is all updating, which introduces blind key secret to encrypt the Tor onion service's hash code, intended to make it impossible to get the real time Tor web service address by reverse calculation. Hence, this paper analyzes the Tor's blind key secret mechanism, and propose an estimation method of Tor hidden service's scale based on the binding relationship with the blinding key secret and the Tor hidden service's address, by deploying the Tor hidden service honey pot. According to the binding relationship in the 24 hours, we are able to calculate the Tor hidden service's scale, which help us to have a good command of Tor's overall operation situation. We also present empirical results of our ongoing experimentation and the Tor's real statistics with it, which verify the feasibility of our proposed method.
- 23 January 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Open AccessHow to Find New Onion Hidden Service based on Blind Secret Key?
-With the development of Internet technology and privacy protection, anonymous network technology is widely used to browse, publish and deliver private or sensitive information on the Internet, such as The Onion Router (Tor). Tor is the most widely used service to protect the user's privacy, because of its bidirectional anonymous mechanism, which makes it so difficult to correlate and find the real Tor web service provider. Actually, Tor is the most influential dark web that contains a lot of illegally sensitive information, which becomes a big challenge to find the new Onion service quickly. Since Tor's specific communication mode makes the instant detection for new Onion service becomes more and more impossible. Before Tor V3 protocol was released, the researcher is able to use reverse calculation to get the real time Tor web service address by deploying the Tor honey pot. Although, with Tor V3 protocol is all updating, which introduces blind key secret to encrypt the Tor onion service's hash code, intended to make it impossible to get the real time Tor web service address by reverse calculation. Hence, this paper analyzes the Tor's blind key secret mechanism, and propose an estimation method of Tor hidden service's scale based on the binding relationship with the blinding key secret and the Tor hidden service's address, by deploying the Tor hidden service honey pot. According to the binding relationship in the 24 hours, we are able to calculate the Tor hidden service's scale, which help us to have a good command of Tor's overall operation situation. We also present empirical results of our ongoing experimentation and the Tor's real statistics with it, which verify the feasibility of our proposed method.
- 5 November 2023
- Published by Springer Nature
- p. 325-339
Graph Contrastive Learning with Hybrid Noise Augmentation for Recommendation
- 5 November 2023
- Published by Springer Nature
- p. 325-339
Graph Contrastive Learning with Hybrid Noise Augmentation for Recommendation
- Open Access
- 18 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
TieFake: Title-Text Similarity and Emotion-Aware Fake News Detection
Fake news detection aims to detect fake news widely spreading on social media platforms, which can negatively influence the public and the government. Many approaches have been developed to exploit relevant information from news images, text, or videos. However, these methods may suffer from the following limitations: (1) ignore the inherent emotional information of the news, which could be beneficial since it contains the subjective intentions of the authors; (2) pay little attention to the relation (similarity) between the title and textual information in news articles, which often use irrelevant title to attract reader' attention. To this end, we propose a novel Title-Text similarity and emotion-aware Fake news detection (TieFake) method by jointly modeling the multi-modal context information and the author sentiment in a unified framework. Specifically, we respectively employ BERT and ResNeSt to learn the representations for text and images, and utilize publisher emotion extractor to capture the author's subjective emotion in the news content. We also propose a scale-dot product attention mechanism to capture the similarity between title features and textual features. Experiments are conducted on two publicly available multi-modal datasets, and the results demonstrate that our proposed method can significantly improve the performance of fake news detection. Our code is available at https://github.com/UESTC-GQJ/TieFake.
- 18 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Open AccessTieFake: Title-Text Similarity and Emotion-Aware Fake News Detection
Fake news detection aims to detect fake news widely spreading on social media platforms, which can negatively influence the public and the government. Many approaches have been developed to exploit relevant information from news images, text, or videos. However, these methods may suffer from the following limitations: (1) ignore the inherent emotional information of the news, which could be beneficial since it contains the subjective intentions of the authors; (2) pay little attention to the relation (similarity) between the title and textual information in news articles, which often use irrelevant title to attract reader' attention. To this end, we propose a novel Title-Text similarity and emotion-aware Fake news detection (TieFake) method by jointly modeling the multi-modal context information and the author sentiment in a unified framework. Specifically, we respectively employ BERT and ResNeSt to learn the representations for text and images, and utilize publisher emotion extractor to capture the author's subjective emotion in the news content. We also propose a scale-dot product attention mechanism to capture the similarity between title features and textual features. Experiments are conducted on two publicly available multi-modal datasets, and the results demonstrate that our proposed method can significantly improve the performance of fake news detection. Our code is available at https://github.com/UESTC-GQJ/TieFake.
- Open Access
TieFake: Title-Text Similarity and Emotion-Aware Fake News Detection
Fake news detection aims to detect fake news widely spreading on social media platforms, which can negatively influence the public and the government. Many approaches have been developed to exploit relevant information from news images, text, or videos. However, these methods may suffer from the following limitations: (1) ignore the inherent emotional information of the news, which could be beneficial since it contains the subjective intentions of the authors; (2) pay little attention to the relation (similarity) between the title and textual information in news articles, which often use irrelevant title to attract reader' attention. To this end, we propose a novel Title-Text similarity and emotion-aware Fake news detection (TieFake) method by jointly modeling the multi-modal context information and the author sentiment in a unified framework. Specifically, we respectively employ BERT and ResNeSt to learn the representations for text and images, and utilize publisher emotion extractor to capture the author's subjective emotion in the news content. We also propose a scale-dot product attention mechanism to capture the similarity between title features and textual features. Experiments are conducted on two publicly available multi-modal datasets, and the results demonstrate that our proposed method can significantly improve the performance of fake news detection. Our code is available at https://github.com/UESTC-GQJ/TieFake.
Open AccessTieFake: Title-Text Similarity and Emotion-Aware Fake News Detection
Fake news detection aims to detect fake news widely spreading on social media platforms, which can negatively influence the public and the government. Many approaches have been developed to exploit relevant information from news images, text, or videos. However, these methods may suffer from the following limitations: (1) ignore the inherent emotional information of the news, which could be beneficial since it contains the subjective intentions of the authors; (2) pay little attention to the relation (similarity) between the title and textual information in news articles, which often use irrelevant title to attract reader' attention. To this end, we propose a novel Title-Text similarity and emotion-aware Fake news detection (TieFake) method by jointly modeling the multi-modal context information and the author sentiment in a unified framework. Specifically, we respectively employ BERT and ResNeSt to learn the representations for text and images, and utilize publisher emotion extractor to capture the author's subjective emotion in the news content. We also propose a scale-dot product attention mechanism to capture the similarity between title features and textual features. Experiments are conducted on two publicly available multi-modal datasets, and the results demonstrate that our proposed method can significantly improve the performance of fake news detection. Our code is available at https://github.com/UESTC-GQJ/TieFake.
- Open Access
- 31 January 2023
- Published by Association for Computing Machinery (ACM)
- p. 12-18
How to Find Social Robots exactly?
- 31 January 2023
- Published by Association for Computing Machinery (ACM)
- p. 12-18
Open AccessHow to Find Social Robots exactly?
- 31 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 9 (6) , 1703-1714
SIRQU: Dynamic Quarantine Defense Model for Online Rumor Propagation Control
Rumors can spread very rapidly through online social networks (OSNs), leading to huge negative impact on human society. Hence, there is an urgent need to develop models that can minimize the spread of rumors. In this article, we propose a novel framework to improve the cost and efficiency of rumor propagation control. First, to reduce the impact of rumor controlling mechanism on users' normal activities, we introduce a soft dynamic quarantine strategy into rumor propagation control and develop a new propagation model named susceptible-infected-removed-quarantined ignorants-quarantined spreaders (SIRQU) to model and block the rumor propagation in the network. Second, to further improve the control efficiency, we propose an influential node selection algorithm based on discrete particle swarm optimization with an evolutionary search strategy, and the controlling mechanism is only applied on the most influential nodes. Finally, we conduct a series of simulations and experiments on several public datasets and the dataset collected from Sina Weibo to validate the proposed method, and the results show that the proposed method outperfoms the related baseline algorithms.
- 31 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 9 (6) , 1703-1714
SIRQU: Dynamic Quarantine Defense Model for Online Rumor Propagation Control
Rumors can spread very rapidly through online social networks (OSNs), leading to huge negative impact on human society. Hence, there is an urgent need to develop models that can minimize the spread of rumors. In this article, we propose a novel framework to improve the cost and efficiency of rumor propagation control. First, to reduce the impact of rumor controlling mechanism on users' normal activities, we introduce a soft dynamic quarantine strategy into rumor propagation control and develop a new propagation model named susceptible-infected-removed-quarantined ignorants-quarantined spreaders (SIRQU) to model and block the rumor propagation in the network. Second, to further improve the control efficiency, we propose an influential node selection algorithm based on discrete particle swarm optimization with an evolutionary search strategy, and the controlling mechanism is only applied on the most influential nodes. Finally, we conduct a series of simulations and experiments on several public datasets and the dataset collected from Sina Weibo to validate the proposed method, and the results show that the proposed method outperfoms the related baseline algorithms.
- Open Access
- 25 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 170213-170225
Collective Intelligence: A Taxonomy and Survey
Collective intelligence (CI) refers to the intelligence that emerges at the macro-level of a collection and transcends that of the individuals. CI is a continuously popular research topic that is studied by researchers in different areas, such as sociology, economics, biology, and artificial intelligence. In this survey, we summarize the works of CI in various fields. First, according to the existence of interactions between individuals and the feedback mechanism in the aggregation process, we establish CI taxonomy that includes three paradigms: isolation, collaboration and feedback. We then conduct statistical literature analysis to explain the differences among three paradigms and their development in recent years. Second, we elaborate the types of CI under each paradigm and discuss the generation mechanism or theoretical basis of the different types of CI. Third, we describe certain CI-related applications in 2019, which can be appropriately categorized by our proposed taxonomy. Finally, we summarize the future research directions of CI under each paradigm. We hope that this survey helps researchers understand the current conditions of CI and clears the directions of future research.
- 25 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 170213-170225
Open AccessCollective Intelligence: A Taxonomy and Survey
Collective intelligence (CI) refers to the intelligence that emerges at the macro-level of a collection and transcends that of the individuals. CI is a continuously popular research topic that is studied by researchers in different areas, such as sociology, economics, biology, and artificial intelligence. In this survey, we summarize the works of CI in various fields. First, according to the existence of interactions between individuals and the feedback mechanism in the aggregation process, we establish CI taxonomy that includes three paradigms: isolation, collaboration and feedback. We then conduct statistical literature analysis to explain the differences among three paradigms and their development in recent years. Second, we elaborate the types of CI under each paradigm and discuss the generation mechanism or theoretical basis of the different types of CI. Third, we describe certain CI-related applications in 2019, which can be appropriately categorized by our proposed taxonomy. Finally, we summarize the future research directions of CI under each paradigm. We hope that this survey helps researchers understand the current conditions of CI and clears the directions of future research.
- 28 February 2019
- Published by Korean Society for Internet Information (KSII) in KSII Transactions on Internet and Information Systems
- Vol. 13 (2) , 582-596
A Relay-assisted Secure Handover Mechanism for High-speed Trains
- 28 February 2019
- Published by Korean Society for Internet Information (KSII) in KSII Transactions on Internet and Information Systems
- Vol. 13 (2) , 582-596
A Relay-assisted Secure Handover Mechanism for High-speed Trains