File Download

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

박새롬

Park, Saerom
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Loss-Driven Adversarial Ensemble Deep Learning for On-Line Time Series Analysis

Author(s)
Ko, HyungjinLee, JaewookByun, JunyoungSon, BumhoPark, Saerom
Issued Date
2019-06
DOI
10.3390/su11123489
URI
https://scholarworks.unist.ac.kr/handle/201301/64276
Citation
SUSTAINABILITY, v.11, no.12, pp.3489
Abstract
Developing a robust and sustainable system is an important problem in which deep learning models are used in real-world applications. Ensemble methods combine diverse models to improve performance and achieve robustness. The analysis of time series data requires dealing with continuously incoming instances; however, most ensemble models suffer when adapting to a change in data distribution. Therefore, we propose an on-line ensemble deep learning algorithm that aggregates deep learning models and adjusts the ensemble weight based on loss value in this study. We theoretically demonstrate that the ensemble weight converges to the limiting distribution, and, thus, minimizes the average total loss from a new regret measure based on adversarial assumption. We also present an overall framework that can be applied to analyze time series. In the experiments, we focused on the on-line phase, in which the ensemble models predict the binary class for the simulated data and the financial and non-financial real data. The proposed method outperformed other ensemble approaches. Moreover, our method was not only robust to the intentional attacks but also sustainable in data distribution changes. In the future, our algorithm can be extended to regression and multiclass classification problems.
Publisher
MDPI
ISSN
2071-1050
Keyword (Author)
ensemble deep learningon-line learningtime series analysisadaptive learning

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.