An apparent simplicity appearing in pattern classification problems

作者:

Highlights:

摘要

An apparent simplicity appearing in the classification problems is described in order to assert the importance of the feature selection. If we assume that the sample size is finite, then, by increasing the number of features used to describe each sample pattern, we can improve the interclass distinguishability. On the other hand, increasing the number of features reduces the generality of class descriptions. Therefore, the enhanced distinguishability may be an apparent simplicity appearing in the interclass structure. We illustrate theoretically and experimentally the existence of the trade-off between the interclass distinguishability and the generality of class descriptions.

论文关键词:Classification,Recognition,Feature selection,Distinguishability,Generality,Relative neighborhood graph,Mutual neighborhood graph

论文评审过程:Received 28 September 1998, Accepted 1 June 1999, Available online 7 June 2001.

论文官网地址:https://doi.org/10.1016/S0031-3203(99)00128-4