Generative Adversarial Classification Network with Application to Network Traffic Classification
Not on the map. Why?
Abstract (arXiv)
Large datasets in machine learning often contain missing data, which necessitates the imputation of missing data values. In this work, we are motivated by network traffic classification, where traditional data imputation methods do not perform well. We recognize that no existing method directly accounts for classification accuracy during data imputation. Therefore, we propose a joint data imputation and data classification method, termed generative adversarial classification network (GACN), whose architecture contains a generator network, a discriminator network, and a classification network, which are iteratively optimized toward the ultimate objective of classification accuracy. For the scenario where some data samples are unlabeled, we further propose an extension termed semi-supervised GACN (SSGACN), which is able to use the partially labeled data to improve classification accuracy. We conduct experiments with real-world network traffic data traces, which demonstrate that GACN and SS-GACN can more accurately impute data features that are more important for classification, and they outperform existing methods in terms of classification accuracy.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 6 of its 23 references that are in the map. First posted on arXiv 19 Mar 2023.
Builds on
6 of 23 references.
References · 6
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2018GAIN: Missing Data Imputation using Generative Adversarial Netscited by 352
- 2018Handling Incomplete Heterogeneous Data using VAEscited by 149
- 2020not-MIWAE: Deep Generative Modelling with Missing not at Random Datacited by 62
- 2019HexaGAN: Generative Adversarial Nets for Real World Classificationcited by 10
- 2018Autoencoders and Probabilistic Inference with Missing Data: An Exact Solution for The Factor Analysis Casecited by 6
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.