Demo Data from EDBT 2026 / reviewers in the wild / expert
Wenqi Wang 0002
dblp:90/10217-2
· DBLP profile ↗
5ranked-venue papers
2as first author
4since 2021 · last 2023
0000-0002-6623-0170ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1
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.
| Network and information security
2 papers |
Security and privacy of machine learning · 100% | |
| Artificial intelligence
2 papers |
Trustworthy machine learning · 57% Information extraction and text analysis · 43% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Security and privacy of machine learning
adversarial attack |
1.1 | 2 | 2023 | Towards a Robust Deep Neural Network Against Adversarial Texts: A Survey · IEEE Trans. Knowl. Data Eng. 2023 MGAAttack: Toward More Query-efficient Black-box Attack by Microbial Genetic Algorithm · ACM Multimedia 2020 |
Security and privacy of machine learning
adversarial defense |
0.7 | 1 | 2023 | Towards a Robust Deep Neural Network Against Adversarial Texts: A Survey · IEEE Trans. Knowl. Data Eng. 2023 |
Security and privacy of machine learning › adversarial attack
textual adversarial attack |
0.7 | 1 | 2023 | Towards a Robust Deep Neural Network Against Adversarial Texts: A Survey · IEEE Trans. Knowl. Data Eng. 2023 |
Security and privacy of machine learning › adversarial attack › query-efficient attack
query-efficient black-box attack |
0.4 | 1 | 2020 | MGAAttack: Toward More Query-efficient Black-box Attack by Microbial Genetic Algorithm · ACM Multimedia 2020 |
Natural language and speech › Information extraction and text analysis
text classification |
0.2 | 1 | 2023 | Towards a Robust Deep Neural Network Against Adversarial Texts: A Survey · IEEE Trans. Knowl. Data Eng. 2023 |
Machine learning › Trustworthy machine learning › robustness
adversarial examples |
0.1 | 1 | 2020 | MGAAttack: Toward More Query-efficient Black-box Attack by Microbial Genetic Algorithm · ACM Multimedia 2020 |
Machine learning › Trustworthy machine learning
robustness |
0.1 | 1 | 2020 | MGAAttack: Toward More Query-efficient Black-box Attack by Microbial Genetic Algorithm · ACM Multimedia 2020 |
Methods — techniques the papers use, named apart from their topics
defense methods · 1.3adversarial perturbation · 1.3transfer-based attack · 0.9score-based attack · 0.9microbial genetic algorithm · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Towards a Robust Deep Neural Network Against Adversarial Texts: A SurveyabstractDeep neural networks (DNNs) have achieved remarkable success in various tasks (e.g., image classification, speech recognition, and natural language processing (NLP)). However, researchers have demonstrated that DNN-based models are vulnerable to adversarial examples, which cause erroneous predictions by adding imperceptible perturbations into legitimate inputs. Recently, studies have revealed adversarial examples in the text domain, which could effectively evade various DNN-based text analyzers and further bring the threats of the proliferation of disinformation. In this paper, we give a comprehensive survey on the existing studies of adversarial techniques for generating adversarial texts written by both English and Chinese characters and the corresponding defense methods. More importantly, we hope that our work could inspire future studies to develop more robust DNN-based text analyzers against known and unknown adversarial techniques. We classify the existing adversarial techniques for crafting adversarial texts based on the perturbation units, helping to better understand the generation of adversarial texts and build robust models for defense. In presenting the taxonomy of adversarial attacks and defenses in the text domain, we introduce the adversarial techniques from the perspective of different NLP tasks. Finally, we discuss the existing challenges of ad-versarial attacks and defenses in texts and present the future research directions in this emerging and challenging field. Wenqi Wang 0002, Run Wang 0001, Lina Wang 0001, Zhibo Wang 0001, Aoshuang Ye |
IEEE Trans. Knowl. Data Eng. | 1 |
| 2022 | Better constraints of imperceptibility, better adversarial examples in the textabstractState-of-the-art adversarial attacks in the text domain have shown their power to induce machine learning models to produce abnormal outputs. The samples generated in these attacks have three important attributes: attack ability, transferability, and imperceptibility. However, compared with the other two attributes, the imperceptibility of adversarial examples has not been well investigated. Unlike the pixel-level perturbations in images, adversarial perturbations in the text are usually traceable, reflecting changes in characters, words, or sentences. The generation of imperceptible samples in texts is more difficult than in images. Therefore, how to constrain adversarial perturbations added in the text is a crucial step to construct more natural adversarial texts. Unfortunately, recent studies merely select measurements to constrain the added adversarial perturbations, but none of them explain where these measurements are suitable, which one is better, and how they perform in different kinds of adversarial attacks. In this paper, we fill this gap by comparing the performance of these metrics in various attacks. Furthermore, we propose a stricter constraint for word-level attacks to obtain more imperceptible samples. It is also helpful to enhance existing word-level attacks for adversarial training. Wenqi Wang 0002, Lina Wang 0001, Run Wang 0001, Aoshuang Ye, Jianpeng Ke |
Int. J. Intell. Syst. | 1 |
| 2021 | Annealing Attention Networks for User Feature-Based Rumor Early Detection on WeiboabstractRumor propagation is becoming easier and leads to severe consequences for society in several minutes or hours due to the rapid development of social networks. Thus, detecting rumors in early time is necessary and urgent for the community. In recent studies, machine learning approaches are widely applied in detecting rumors based on various features extracted from content, user characteristics, and propagation structure. Some studies have shown that features extracted from users are more valuable for rumor early detection. Whereas existing studies utterly utilize various user features, and all of them are deemed as equally, which ignore the inter-feature and temporal difference. Therefore, in this paper, we analyze the effectiveness of six frequently used user features with several representative deep learning models to learn more about such difference. And we propose a novel annealing attention model based on the analysis. The proposed model learns feature-attention and temporal-attention with multi-layer perceptron and parameterized annealing function to capture the difference and enhance the original user features in rumor early detection. Experimental results on the real-world dataset demonstrate that the proposed model detects rumors with an accuracy of 93.6% on Weibo in 15 minutes, which outperforms the state-of-art methods. Zhengwu Luo, Lina Wang 0001, Wenqi Wang 0002, Aoshuang Ye |
IJCNN | 3 |
| 2021 | RapidFuzz: Accelerating fuzzing via Generative Adversarial Networks
Aoshuang Ye, Lina Wang 0001, Lei Zhao 0012, Jianpeng Ke, Wenqi Wang 0002, Qinliang Liu |
Neurocomputing | 5 |
| 2020 | MGAAttack: Toward More Query-efficient Black-box Attack by Microbial Genetic AlgorithmabstractRecent studies have shown that deep neural networks (DNNs) are susceptible to adversarial attacks even in the black-box settings. However, previous studies on creating black-box based adversarial examples by merely solving the traditional continuous problem, which suffer query efficiency issues. To address the efficiency of querying in black-box attack, we propose a novel attack, called MGAAttack, which is a query-efficient and gradient-free black-box attack without obtaining any knowledge of the target model. In our approach, we leverage the advantages of both transfer-based and scored-based methods, two typical techniques in black-box attack, and solve a discretized problem by using a simple yet effective microbial genetic algorithm (MGA). Experimental results show that our approach dramatically reduces the number of queries on CIFAR-10 and ImageNet and significantly outperforms previous work. In the untargeted attack, we can attack a VGG19 classifier with only 16 queries and give an attack success rate more than 99.90% on ImageNet. Our code is available at https://github.com/kangyangWHU/MGAAttack. Lina Wang 0001, Wenqi Wang 0002, Run Wang 0001, Aoshuang Ye |
ACM Multimedia | 3 |