Learning a Mahalanobis distance metric for data clustering and classification

DOI10.1016/j.patcog.2008.05.018zbMath1162.68642OpenAlexW2062112832MaRDI QIDQ947985

Shiming Xiang, Feiping Nie, Changshui Zhang

Publication date: 8 October 2008

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2008.05.018

zbMATH Keywords

global optimizationdata clusteringdistance metric learningface pose estimationinteractive image segmentationmahalanobis distance

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (21)

Trace optimization and eigenproblems in dimension reduction methods ⋮ Distance metric learning guided adaptive subspace semi-supervised clustering ⋮ Leptokurtic moment-parameterized elliptically contoured distributions with application to financial stock returns ⋮ Active constrained fuzzy clustering: a multiple kernels learning approach ⋮ Beyond linear subspace clustering: a comparative study of nonlinear manifold clustering algorithms ⋮ Learning a metric when clustering data points in the presence of constraints ⋮ Semi-supervised metric learning via topology preserving multiple semi-supervised assumptions ⋮ An exact algorithm for semi-supervised minimum sum-of-squares clustering ⋮ FGC\_SS: fast graph clustering method by joint spectral embedding and improved spectral rotation ⋮ Marginal semi-supervised sub-manifold projections with informative constraints for dimensionality reduction and recognition ⋮ Secure delegated quantum algorithms for solving Mahalanobis distance ⋮ Ordinal Distance Metric Learning with MDS for Image Ranking ⋮ Frameworks for multivariate \(m\)-mediods based modeling and classification in Euclidean and general feature spaces ⋮ Trace ratio criterion based generalized discriminative learning for semi-supervised dimensionality reduction ⋮ Construction of image reduction operators using averaging aggregation functions ⋮ On minimum class locality preserving variance support vector machine ⋮ Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data ⋮ Twin Mahalanobis distance-based support vector machines for pattern recognition ⋮ Supervised distance metric learning through maximization of the Jeffrey divergence ⋮ Simplicial and minimal-variance distances in multivariate data analysis ⋮ Local discriminative distance metrics ensemble learning

Uses Software

• COIL-20

Cites Work

• Extending the relevant component analysis algorithm for metric learning using both positive and negative equivalence constraints
• A generalized Foley–Sammon transform based on generalized fisher discriminant criterion and its application to face recognition
• Algorithmic Learning Theory
• A direct LDA algorithm for high-dimensional data -- with application to face recognition
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Learning a Mahalanobis distance metric for data clustering and classification