返回
A memetic algorithm for evolutionary prototype selection:: A scaling up approach
DOI:10.1016/j.patcog.2008.02.006.png)
摘要
En 中文
Prototype selection problem consists of reducing the size of databases by removing samples that are considered noisy or not influential on nearest neighbour classification tasks. Evolutionary algorithms have been used recently for prototype selection showing good results. However, due to the complexity of this problem when the size of the databases increases, the behaviour of evolutionary algorithms could deteriorate considerably because of a lack of convergence. This additional problem is known as the scaling up problem. Memetic algorithms are approaches for heuristic searches in optimization problems that combine a population-based algorithm with a local search. In this paper, we propose a model of memetic algorithm that incorporates an ad hoc local search specifically designed for optimizing the properties of prototype selection problem with the aim of tackling the scaling up problem. In order to check its performance, we have carried out an empirical study including a comparison between our proposal and previous evolutionary and non-evolutionary approaches studied in the literature. The results have been contrasted with the use of non-parametric statistical procedures and show that our approach outperforms previously studied methods, especially when the database scales up. (c) 2008 Elsevier Ltd. All rights reserved.
Keyword:
data reduction
evolutionary algorithms
memetic algorithms
prototype selection
scaling up
nearest neighbour rule
data mining
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Electrical Conductivity of Reproductive Tissue for Detection of Estrus in Dairy Cows用于检测奶牛发情的繁殖组织电导率
On using prototype reduction schemes to optimize dissimilarity-based classification
PATTERN RECOGNITION
IF7.6
Learning prototypes and distances: A prototype reduction technique based on nearest neighbor error minimization
PATTERN RECOGNITION
IF7.6
Using evolutionary algorithms as instance selection for data reduction in KDD: An experimental study使用进化算法作为KDD中数据约简的实例选择: 一项实验研究

