Efficient pattern synthesis for nearest neighbour classifier

doi:10.1016/j.patcog.2005.03.029

Efficient pattern synthesis for nearest neighbour classifier

2005-11-01

3

OA

AI

DOI：10.1016/j.patcog.2005.03.029

原文链接

查看原文

摘要

En 中文

Synthetic pattern generation is one of the strategies to overcome the curse of dimensionality, but it has its own drawbacks. Most of the synthetic pattern generation techniques take more time than simple classification. In this paper, we propose a new strategy to reduce the time and memory requirements by applying prototyping as an intermediate step in the synthetic pattern generation technique. Results show that through the proposed strategy, classification can be done much faster without compromising much in terms of classification accuracy, in fact for some cases it gives better accuracy in lesser time. The classification time and accuracy can be balanced according to available memory and computing power of a system to get the best possible results. (c) 2005 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

Keyword:

pattern synthesis

prototyping

classification

clustering

partitioning

Efficient pattern synthesis for nearest neighbour classifier

摘要

AI总结

期刊

机构

引用论文