On rejecting unreliably classified patterns

6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we propose to face the rejection problem as a new classification problem. In order to do that, we introduce a trainable classifier, that we call reject classifier, to distinguish it from the classifier to which the reject option is applied (termed primary classifier). This idea yields a reject option that is largely independent of the approach used for the primary classifier, working also for systems providing as their only output the guess class. The whole classification system can be seen as a serial multiple classifier system: given an input patter x, the primary classifier limits to two the number of possible classes (i.e., its guess class and the reject class), while the reject classifier attributes x to one out of these two classes. The proposed reject method has been tested on three different publicly available databases. We also compared it with other reject rules and the results demonstrated the effectiveness of the proposed approach. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Foggia, P., Percannella, G., Sansone, C., & Vento, M. (2007). On rejecting unreliably classified patterns. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4472 LNCS, pp. 282–291). Springer Verlag. https://doi.org/10.1007/978-3-540-72523-7_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free