A conventional discriminant problem is to determine a discriminant function, which maps a point in a multi-dimensional feature space to a point in a one-dimensional decision space, using a set of labeled (known classification) samples. In many cases, attribute values of each sample are not constant but fluctuating with time. In this paper, we represent the fluctuating attribute values of each sample by an interval vector in the feature space, and propose a discriminant method for a set of interval vectors. The proposed method is based on a linear interval model which maps an interval vector in the feature space to an interval in the decision space. A mathematical programming problem is formulated to determine the coefficients of this model. We also propose a set of discriminant rules to discriminate unknown samples. The proposed method is applied to a smell sensing problem.
[1]
Norman Gaither,et al.
ON USING LINEAR PROGRAMMING IN DISCRIMINANT PROBLEMS
,
1982
.
[2]
Fred Glover,et al.
A NEW CLASS OF MODELS FOR THE DISCRIMINANT PROBLEM
,
1988
.
[3]
Fred Glover,et al.
LINEAR PROGRAMMING AND STATISTICAL DISCRIMINATION THE LP SIDE
,
1982
.
[4]
F. Glover,et al.
Notes and Communications RESOLVING CERTAIN DIFFICULTIES AND IMPROVING THE CLASSIFICATION POWER OF LP DISCRIMINANT ANALYSIS FORMULATIONS
,
1986
.
[5]
Fred Glover,et al.
Applications and Implementation
,
1981
.
[6]
F. Glover,et al.
Simple but powerful goal programming models for discriminant problems
,
1981
.