Interval Discriminant Analysis : An Efficient Method to integrate Errors in Supervised Pattern Recognition - Université de Lorraine Access content directly
Conference Papers Year : 2001

Interval Discriminant Analysis : An Efficient Method to integrate Errors in Supervised Pattern Recognition

Abstract

In a statistical pattern recognition context, probabilistic algorithms like parametric or nonparametric discriminant analysis are designed to classify objects into predefined classes. Because these methods require precise input data, they cannot propagate uncertainties in the classifying process. In real case studies, this could lead to drastic misinterpretations of objects. We have thus developed an extension of these methods to directly propagate imprecise interval-form data. The computations are based on interval arithmetic, which appears to be an efficient tool to handle intervals. They consist in calculating successively interval conditional probability density functions and interval posterior probabilities, whose definitions are closely associated with the imprecise probability theory. The algorithms eventually assign any object to a subset of classes, consistent with the data and its imprecision. The resulting classifying model is thus less precise, but much more realistic than the standard one. The efficiency of this algorithm is tested on a synthetic case study.
No file

Dates and versions

hal-04053616 , version 1 (31-03-2023)

Identifiers

  • HAL Id : hal-04053616 , version 1

Cite

Philippe Nivlet, Frédérique Fournier, Jean-Jacques Royer. Interval Discriminant Analysis : An Efficient Method to integrate Errors in Supervised Pattern Recognition. 2nd International Symposium on Imprecise Probabilities and Their Applications, 2001, Ithaca, United States. ⟨hal-04053616⟩
15 View
0 Download

Share

Gmail Facebook X LinkedIn More