arrow
返回

ATISA: Adaptive Threshold-based Instance Selection Algorithm

delete2013-12-01
delete23
PRE
AI
G
George D. C. Cavalcanti *
T
Tsang Ing Ren
DOI:10.1016/j.eswa.2013.06.053delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Instance reduction techniques can improve generalization, reduce storage requirements and execution time of instance-based learning algorithms. This paper presents an instance reduction algorithm called Adaptive Threshold-based Instance Selection Algorithm (ATISA). ATISA aims to preserve important instances based on a selection criterion that uses the distance of each instance to its nearest enemy as a threshold. This threshold defines the coverage area of each instance that is given by a hyper-sphere centered at it. The experimental results show the effectiveness, in terms of accuracy, reduction rate, and computational time, of the ATISA algorithm when compared with state-of-the-art reduction algorithms. (C) 2013 Elsevier Ltd. All rights reserved.
Keyword:
Instance selection
Instance-based learning algorithms
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Expert Systems with Applications 封面图
Expert Systems with Applications
IF:
7.5
论文数:
2.9W
被引数:
10.2W

机构

I
interuniversity microelectronics centre
学者数:
6.3K
论文数: 3.9K
被引数: 0