.png){kind=icon}
返回
A Dynamic Optimization Approach for Adaptive Incremental Learning
.png){kind=icon}
PRE
AI
DOI：10.1002/int.20501.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A fundamental problem when performing incremental learning is that the best set of a classification system's parameters can change with the evolution of the data. Consequently, unless the system self-adapts to such changes, it will become obsolete, even if the application environment seems to be static. To address this problem, we propose a dynamic optimization approach in this paper that performs incremental learning in an adaptive fashion by tracking, evolving, and combining optimum hypotheses overtime. The approach incorporates various theories, such as dynamic particle swarm optimization, incremental support vector machine classifiers, change detection, and dynamic ensemble selection based on classifiers' confidence levels. Experiments carried out on synthetic and real-world databases demonstrate that the proposed approach actually outperforms the classification methods often used in incremental learning scenarios. (C) 2011 Wiley Periodicals, Inc.
Keyword:
CLASSIFICATION
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.7
论文数:
3.1K
被引数:
8.1K
机构
引用论文
.png){kind=icon}
查看更多内容