Generalized Correntropy based deep learning in presence of non-Gaussian noises

被引:27
|
作者
Chen, Liangjun [1 ]
Qu, Hua [1 ]
Zhao, Jihong [1 ,2 ]
机构
[1] Xi An Jiao Tong Univ, Sch Elect & Informat Engn, Xian 710049, Shaanxi, Peoples R China
[2] Xian Univ Posts & Telecommun, Sch Telecommun & Informat Engn, Xian 710061, Shaanxi, Peoples R China
基金
中国国家自然科学基金;
关键词
Deep learning; Generalized Correntropy; Stacked autoencoders; Non-Gaussian noise; Network traffic classification; MAXIMUM; ALGORITHM;
D O I
10.1016/j.neucom.2017.06.080
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Deep learning algorithms are the hottest topics in machine learning area lately. Although deep learning has made great progress in many domains, the robustness of learning systems with deep architectures is still rarely studied and needs further investigation. For instance, the impulsive noises (or outliers) are pervasive in real world data and can badly influence the mean square error (MSE) cost function based deep learning algorithms. Correntropy based loss function, which uses Gaussian kernel, is widely utilized to reject the above noises, however, the effect is not satisfactory. Therefore, generalized Correntropy (GC) is put forward to further improve the robustness, which uses generalized Gaussian density (GGD) function as kernel. GC can achieve extra flexibility through the GC parameters, which control the behavior of the induced metric, and shows a markedly better robustness than Correntropy. Motivated by the enhanced robustness of GC, we propose a new robust algorithm named generalized Correntropy based stacked autoencoder (GC-SAE), which is developed by combining the GC and stacked autoencoder (SAE). The new algorithms can extract useful features from the data corrupted by impulsive noises (or outliers) in a more effective way. The good robustness of the proposed method is confirmed by the experimental results on MNIST benchmark dataset. Furthermore, we show how our model can be applied for robust network classification, based on Moore network data of 377,526 samples with 12 classes. (C) 2017 Elsevier B. V. All rights reserved.
引用
收藏
页码:41 / 50
页数:10
相关论文
共 50 条
  • [21] Cumulant based harmonic retrieval in mixed colored Gaussian and non-Gaussian ARMA noises
    Li, S., 2001, Chinese Institute of Electronics (10):
  • [22] Cumulant based harmonic retrieval in mixed colored Gaussian and non-Gaussian ARMA noises
    Li, SH
    Zhu, HW
    CHINESE JOURNAL OF ELECTRONICS, 2001, 10 (02): : 161 - 165
  • [23] Speech enhancement based unscented particle filter with non-gaussian noises
    Yin, Wei
    Yi, Ben-Shun
    Shen, Xiao-Feng
    Dianbo Kexue Xuebao/Chinese Journal of Radio Science, 2009, 24 (03): : 476 - 481
  • [24] High-order Unscented Transformation Based on the Bayesian Learning for Nonlinear Systems with Non-Gaussian noises
    Hou, Jiaxin
    Zhou, Weidong
    Zhang, Wen-An
    Zhang, Cong
    Chen, Chen
    Shan, Chenghao
    2019 15TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS 2019), 2019, : 26 - 30
  • [25] Maximum weighted correntropy filters for nonlinear non-Gaussian systems
    Liu, Jingang
    Zhang, Wenbo
    Song, Shenmin
    ASIAN JOURNAL OF CONTROL, 2024,
  • [26] PROBABILITY DENSITY OF ANGULAR AND RANGE NOISES AT THE NON-GAUSSIAN DISTRIBUTION OF SIGNALS BACKGROUNDED BY NON-GAUSSIAN INTERFERENCE
    AGAYEV, SK
    RUSINOV, VR
    IZVESTIYA VYSSHIKH UCHEBNYKH ZAVEDENII RADIOELEKTRONIKA, 1991, 34 (07): : 83 - 85
  • [28] Stochastic Resonance in a Bistable System Subject to Non-Gaussian and Gaussian Noises
    Zeng Chun-Hua
    Chen Li-Li
    Xie Chong-Wei
    COMMUNICATIONS IN THEORETICAL PHYSICS, 2008, 50 (05) : 1165 - 1168
  • [29] An Accurate Kernelized Energy Detection in Gaussian and non-Gaussian/Impulsive Noises
    Margoosian, Argin
    Abouei, Jamshid
    Plataniotis, Konstantinos N.
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2015, 63 (21) : 5621 - 5636
  • [30] Resonant activation driven by strongly non-Gaussian noises
    Dybiec, B
    Gudowska-Nowak, E
    FLUCTUATION AND NOISE LETTERS, 2004, 4 (02): : L273 - L285