Table of Content

Open Access iconOpen Access



Classification Algorithm Optimization Based on Triple-GAN

Kun Fang1, 2, Jianquan Ouyang1, *

1 Key Laboratory of Intelligent Computing & Information Processing, Ministry of Education, Xiangtan University, Xiangtan, China.
2 Hunan Meteorological Information Center, Hunan Meteorological Bureau, Changsha, China.

* Corresponding Author: Jianquan Ouyang. Email: email.

Journal on Artificial Intelligence 2020, 2(1), 1-15.


Generating an Adversarial network (GAN) has shown great development prospects in image generation and semi-supervised learning and has evolved into TripleGAN. However, there are still two problems that need to be solved in Triple-GAN: based on the KL divergence distribution structure, gradients are easy to disappear and training instability occurs. Since Triple-GAN tags the samples manually, the manual marking workload is too large. Marked uneven and so on. This article builds on this improved Triple-GAN model (Improved Triple-GAN), which uses Random Forests to classify real samples, automate tagging of leaf nodes, and use Least Squares Generative Adversarial Networks (LSGAN) ideological structure loss function to avoid gradients disappear. Experiments were performed on the Improved Triple-GAN model and the Triple-GAN model using the MINIST, cifar10 and cifar100 datasets respectively, experiments show that the error rate of generated samples is greatly reduced. At the same time, the classification effect of the data set and the sharpness of the samples are greatly improved. And it has greatly improved the stability of model training and automation of labels.


Cite This Article

K. Fang and J. Ouyang, "Classification algorithm optimization based on triple-gan," Journal on Artificial Intelligence, vol. 2, no.1, pp. 1–15, 2020.

cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 2084


  • 1266


  • 0


Related articles

Share Link