Resumen
Generative adversarial networks (GANs) have shown their potential for data generation. However, this type of generative model often suffers from oscillating training processes and mode collapse, among other issues. To mitigate these, this work proposes a generalization of both MSE GAN and WGAN-GP, referred to as VGAN. Within the framework of conditional Wasserstein GAN with gradient penalty, VGAN resorts to the Vapnik V-matrix based criterion that generalizes MSE. Also, a novel early stopping like strategy is proposed that keeps track during training of the most suitable model. A comprehensive set of experiments on a fault diagnosis task for an industrial robot where the generative model is used as a data augmentation tool for dealing with imbalance data sets is presented. The statistical analysis of the results shows that the proposed model outperforms nine other models including vanilla GAN, conditional WGAN with and without conventional regularization, and SMOTE, a classic data augmentation technique.
| Idioma original | Inglés |
|---|---|
| Páginas (desde-hasta) | 65-75 |
| Número de páginas | 11 |
| Publicación | IEEE Intelligent Systems |
| Volumen | 37 |
| N.º | 3 |
| DOI | |
| Estado | Publicada - 2022 |
Nota bibliográfica
Publisher Copyright:IEEE
Areas de Conocimiento del CACES
- 116A Computación
Huella
Profundice en los temas de investigación de 'VGAN: Generalizing MSE GAN and WGAN-GP for robot fault diagnosis'. En conjunto forman una huella única.Citar esto
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver