Distance criteria are widely applied in cluster analysis and classification techniques. One of the well known and most commonly used distance criteria is the Mahalanobis distance, introduced by P. C. Mahalanobis in 1936. The functions of this distance have been extended to different problems such as detection of multivariate outliers, multivariate statistical testing, and class prediction problems. In the class prediction problems, researcher is usually burdened with problems of excessive features where useful and useless features are all drawn for classification task. Therefore, this paper tries to highlight the procedure of exploiting this criterion in selecting the best features for further classification process. Classification performance for the feature subsets of the ordered features based on the Mahalanobis distance criterion is included.

1.
G.
Chandrashekar
and
F.
Sahin
,
Computers and Electrical Engineering
40
,
16
28
(
2014
).
2.
P. C.
Mahalanobis
,
Proc. Nat. Inst. of Science
2
,
49
55
(
1936
).
3.
S.
Ray
and
L. F.
Turner
,
Information Sciences
60
,
217
245
(
1992
).
4.
P. A.
Devijver
and
J.
Kittler
,
Pattern Recognition: A Statistical Approach
,
Englewood Cliffs, N.J
.:
Prentice Hall International, Inc.
,
1982
, pp.
56
.
5.
M. J.
Masnan
,
N. I.
Mahat
,
A.
Zakaria
,
A. Y. M.
Shakaff
,
A. H.
Adom
and
F. S. A.
Sa’ad
,
Procedia Chemistry
6
,
132
140
(
2012
).
This content is only available via PDF.
You do not currently have access to this content.