返回
Enhancing prototype reduction schemes with LVQ3-type algorithms
DOI:10.1016/S0031-3203(02)00115-2.png)
摘要
En 中文
Various prototype reduction schemes have been reported in the literature. Foremost among these are the prototypes for nearest neighbor (PNN), the vector quantization (VQ), and the support vector machines (SVM) methods. In this paper, we shall show that these schemes can be enhanced by the introduction of a post-processing phase that is related, but not identical to, the LVQ3 process. Although the post-processing with LVQ3 has been reported for the SOM and the basic VQ methods, in this paper, we shall show that an analogous philosophy can be used in conjunction with the SVM and PNN rules. Our essential modification to LVQ3 first entails a partitioning of the respective training sets into two sets called the Placement set and the Optimizing set, which are instrumental in determining the LVQ3 parameters. Such a partitioning is novel to the literature. Our experimental results demonstrate that the proposed enhancement yields the best reported prototype condensation scheme to-date for both artificial data sets, and for samples involving real-life data sets. (C) 2002 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.
Keyword:
prototype reduction
LVQ (learning vector quantization)
SVM (support vector machines)
VQ (vector quantization)
PNN (prototypes for nearest neighbor classifier)
CNN (condensed nearest neighbor)
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem
NEURAL NETWORKS
IF6.3

