.png){kind=icon}
返回
Genetic nearest feature plane
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2007.10.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The problem addressed in this paper concerns the complexity reduction of the nearest feature plane classifier, so that it may be applied also in dataset where the training set contains many patterns. This classifier considers, to classify a test pattern, the subspaces created by each combination of three training patterns. The main problem is that in dataset of high cardinality this method is unfeasible. A genetic algorithm is here used for dividing the training patterns in several clusters which centroids are used to build the feature planes used to classify the test set. The performance improvement with respect to other nearest neighbor based classifiers is validated through experiments with several benchmark datasets. (C) 2007 Elsevier Ltd. All rights reserved.
Keyword:
Nearest feature plane classifier
Clustering
Genetic algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
分享收藏Erikson's General and Adult Developmental Revisions of Freudian Thought: “Outward, Forward, Upward”
PREAI
分享收藏Learning prototypes and distances: A prototype reduction technique based on nearest neighbor error minimization.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏Using evolutionary algorithms as instance selection for data reduction in KDD: An experimental study使用进化算法作为KDD中数据约简的实例选择: 一项实验研究
PREAI
分享收藏
查看更多内容