首页> 外文期刊>Neurocomputing >Incremental on-line learning: A review and comparison of state of the art algorithms
【24h】

Incremental on-line learning: A review and comparison of state of the art algorithms

机译:增量在线学习:最新算法的回顾和比较

获取原文
获取原文并翻译 | 示例
       

摘要

Recently, incremental and on-line learning gained more attention especially in the context of big data and learning from data streams, conflicting with the traditional assumption of complete data availability. Even though a variety of different methods are available, it often remains unclear which of them is suitable for a specific task and how they perform in comparison to each other. We analyze the key properties of eight popular incremental methods representing different algorithm classes. Thereby, we evaluate them with regards to their on-line classification error as well as to their behavior in the limit. Further, we discuss the often neglected issue of hyperparameter optimization specifically for each method and test how robustly it can be done based on a small set of examples. Our extensive evaluation on data sets with different characteristics gives an overview of the performance with respect to accuracy, convergence speed as well as model complexity, facilitating the choice of the best method for a given application. (C) 2017 Elsevier B.V. All rights reserved.
机译:最近,增量和在线学习越来越受到关注,特别是在大数据和从数据流中学习的情况下,这与传统的完全数据可用性假设相冲突。即使可以使用多种不同的方法,也常常不清楚哪种方法适合特定任务,以及它们之间的比较效果如何。我们分析了代表不同算法类别的八种流行的增量方法的关键特性。因此,我们根据它们的在线分类错误以及它们在极限状态下的行为来评估它们。此外,我们针对每种方法讨论了通常被忽略的超参数优化问题,并基于一小组示例测试了它的鲁棒性。我们对具有不同特征的数据集进行了广泛的评估,从准确性,收敛速度以及模型复杂性等方面对性能进行了概述,从而为特定应用选择了最佳方法。 (C)2017 Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号