| Optimal decision rule with class-selective rejection and performance constraints. | |
| | |
MedLine Citation:
|
PMID: 19762932 Owner: NLM Status: MEDLINE |
Abstract/OtherAbstract:
|
The problem of defining a decision rule which takes into account performance constraints and class-selective rejection is formalized in a general framework. In the proposed formulation, the problem is defined using three kinds of criteria. The first is the cost to be minimized, which defines the objective function, the second are the decision options, determined by the admissible assignment classes or subsets of classes, and the third are the performance constraints. The optimal decision rule within the statistical decision theory framework is obtained by solving the stated optimization problem. Two examples are provided to illustrate the formulation and the decision rule is obtained. |
| | |
Authors:
|
Edith Grall-Maës; Pierre Beauseroy |
Publication Detail:
|
Type: Journal Article |
Journal Detail:
|
Title: IEEE transactions on pattern analysis and machine intelligence Volume: 31 ISSN: 1939-3539 ISO Abbreviation: IEEE Trans Pattern Anal Mach Intell Publication Date: 2009 Nov |
Date Detail:
|
Created Date: 2009-09-18 Completed Date: 2009-12-09 Revised Date: - |
Medline Journal Info:
|
Nlm Unique ID: 9885960 Medline TA: IEEE Trans Pattern Anal Mach Intell Country: United States |
Other Details:
|
Languages: eng Pagination: 2073-82 Citation Subset: IM |
Affiliation:
|
Institut Charles Delaunay, Université de Technologie de Troyes, Troyes cedex, France. edith.grall@utt.fr |
Export Citation:
|
APA/MLA Format Download EndNote Download BibTex |
| MeSH Terms | |
Descriptor/Qualifier:
|
Algorithms* Artificial Intelligence* Computer Simulation Decision Support Techniques* Models, Theoretical* Pattern Recognition, Automated / methods* |
From MEDLINE®/PubMed®, a database of the U.S. National Library of Medicine
Previous Document: A new algorithm and system for the characterization of handwriting strokes with delta-lognormal para...
Next Document: Optimal combination of nested clusters by a greedy approximation algorithm.