返回
IRAHC: Instance Reduction Algorithm using Hyperrectangle Clustering
DOI:10.1016/j.patcog.2014.11.005.png)
摘要
En 中文
In instance-based classifiers, there is a need for storing a large number of samples as training set. In this work, we propose an instance reduction method based on hyperrectangle clustering, called Instance Reduction Algorithm using Hyperrectangle Clustering (IRAHC). IRAHC removes non-border (interior) instances and keeps border and near border ones. This paper presents an instance reduction process based on hyperrectangle clustering. A hyperrectangle is an n-dimensional rectangle with axes aligned sides, which is defined by min and max points and a corresponding distance function. The min-max points are determined by using the hyperrectangle clustering algorithm. Instance-based learning algorithms are often confronted with the problem of deciding which instances must be stored to be used during an actual test. Storing too many instances can result in a large memory requirements and a slow execution speed. In IRAHC, core of instance reduction process is based on set of hyperrectangles. The performance has been evaluated on real world data sets from UCI repository by the 10-fold crossvalidation method. The results of the experiments have been compared with state-of-the-art methods, which show superiority of the proposed method in terms of classification accuracy and reduction percentage. (C) 2014 Elsevier Ltd. All rights reserved.
Keyword:
Instance reduction
Instance selection
Hyperrectangle
Instance-based classifiers
k-Nearest neighbor (k-NN)
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
An eye disease in silver carp, Hypophthalmichthys molitrix, held in tropical ponds, associated with the bacterium Staphylococcus aureus
Aquaculture
IF0
Acoustic emission studies towards better understanding of high temperature oxidation in CrMo steels

