首页> 中文期刊> 《人工智能杂志(英文)》 >Classification Algorithm Optimization Based on Triple-GAN

Classification Algorithm Optimization Based on Triple-GAN

         

摘要

Generating an Adversarial network(GAN)has shown great development prospects in image generation and semi-supervised learning and has evolved into Triple-GAN.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.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号