Abstract
The concept of rejection is extended to that of class-selective rejection. That is, when an input pattern cannot be reliably assigned to one of the N classes in a N-class problem, it is assigned to a subset of classes that are most likely to issue the pattern, instead of simply being rejected. First, a new optimality criterion is appropriately defined to accommodate the newly introduced decision outcomes. Then, a new decision rule is proposed and its optimality proven. Various upper-bounds of error rate are obtained. Next, an example is provided to illustrate various aspects of the optimum decision rule. Finally, the implications of the new decision rule are discussed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
