.png){kind=icon}
返回
Instance selection for time series classification based on immune binary particle swarm optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2013.04.021.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose a new immune binary particle swarm optimization algorithm (IBPSO) to solve the problem of instance selection for time series classification, whose objective is to find out the smallest instance combination with maximal classification accuracy. The proposed IBPSO is based on the basic binary particle swarm optimization (BPSO) algorithm proposed by Kennedy and Eberhart. Its immune mechanism includes vaccination and immune selection. Vaccination employs the hubness score of time series and the particles' inertance as heuristic information to direct the search process. Immune selection procedure always discards the particle with the worst fitness in the current swarm for preventing the degradation of the swarm. Experimental results on small and medium datasets show that IBPSO outperforms BPSO and deterministic INSIGHT in terms of storage requirement and classification accuracy, and presents better robustness to noise than BPSO. In addition, experimental results on larger datasets indicate that IBPSO has better scalability than BPSO. (C) 2013 Elsevier B.V. All rights reserved.
Keyword:
Instance selection
Time series classification
Binary particle swarm optimization
Immune algorithm
Data reduction
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Characterization of the p-toluenesulfonate operon tsaMBCD and tsaR in Comamonas testosteroni T-2
OAAI
OAAI分享收藏Weighted dynamic time warping for time series classification基于加权动态时间规整的时间序列分类.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏
查看更多内容