Classification of dissimilarity data with a new flexible Mahalanobis-like metric - Archive ouverte HAL Access content directly
Journal Articles Pattern Analysis and Applications Year : 2008

Classification of dissimilarity data with a new flexible Mahalanobis-like metric

Abstract

Statistical pattern recognition traditionally relies on features-based representation. For many applications, such vector representation is not available and we only possess proximity data (distance, dissimilarity, similarity, ranks ...). In this paper, we consider a particular point of view on discriminant analysis from dissimilarity data. Our approach is inspired by the Gaussian classifier and we defined decision rules to mimic the behavior of a linear or a quadratic classifier. The number of parameters is limited (two per class). Numerical experiments on artificial and real data show interesting behavior compared to Support Vector Machines and to kNN classifier (i) lower or equivalent error rate, (ii) equivalent CPU time, (iii) more robustness with sparse dissimilarity data.

Dates and versions

hal-00331846 , version 1 (17-10-2008)

Identifiers

Cite

Agata Manolova, Anne Guérin-Dugué. Classification of dissimilarity data with a new flexible Mahalanobis-like metric. Pattern Analysis and Applications, 2008, 11 (3-4), pp.337-351. ⟨10.1007/s10044-008-0101-6⟩. ⟨hal-00331846⟩
91 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More