.png){kind=icon}
返回
Prototype selection for dissimilarity-based classifiers
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2005.06.012.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A conventional way to discriminate between objects represented by dissimilarities is the nearest neighbor method. A more efficient and sometimes a more accurate solution is offered by other dissimilarity-based classifiers. They construct a decision rule based on the entire training set, but they need just a small set of prototypes, the so-called representation set, as a reference for classifying new objects. Such alternative approaches may be especially advantageous for non-Euclidean or even non-metric dissimilarities. The choice of a proper representation set for dissimilarity-based classifiers is not yet fully investigated. It appears that a random selection may work well. In this paper, a number of experiments has been conducted on various metric and non-metric dissimilarity representations and prototype selection methods. Several procedures, like traditional feature selection methods (here effectively searching for prototypes), mode seeking and linear programming are compared to the random selection. In general, we find out that systematic approaches lead to better results than the random selection, especially for a small number of prototypes. Although there is no single winner as it depends on data characteristics, the k-centres works well, in general. For two-class problems, an important observation is that our dissimilarity-based discrimination functions relying on significantly reduced prototype sets (3-10% of the training objects) offer a similar or much better classification accuracy than the best k-NN rule on the entire training set. This may be reached for multi-class data as well, however such problems are more difficult. (c) 2005 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
Keyword:
dissimilarity
representation
prototype selection
normal density based classifiers
nearest neighbor rule
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
ProDom and ProDom-CG: tools for protein domain analysis and whole genome comparisons.png)
NUCLEIC ACIDS RESEARCH
OAAI
NUCLEIC ACIDS RESEARCHIF13.1
OAAI分享收藏A class-dependent weighted dissimilarity measure for nearest neighbor classification problems最近邻分类问题的类相关加权不相似性度量
PREAI
分享收藏
查看更多内容