A boosting approach for supervised Mahalanobis distance metric learning

DOI10.1016/j.patcog.2011.07.026zbMath1225.68156OpenAlexW2075614355MaRDI QIDQ645912

Chin-Chun Chang

Publication date: 10 November 2011

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

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

zbMATH Keywords

distance metric learningboosting approacheshypothesis margins

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (3)

A pattern recognition framework for detecting dynamic changes on cyclic time series ⋮ A fast diagonal distance metric learning approach for large-scale datasets ⋮ Local discriminative distance metrics ensemble learning

Uses Software

• UCI-ml
• AdaBoost.MH
• ElemStatLearn
• AR face
• LMNN
• Georgia Tech Face

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized iterative RELIEF for supervised distance metric learning
• Wrappers for feature subset selection
• A decision-theoretic generalization of on-line learning and an application to boosting
• Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
• Improved boosting algorithms using confidence-rated predictions
• Stability of unstable learning algorithms
• An Optimal Global Nearest Neighbor Metric
• Nonparametric Discriminant Analysis
• 10.1162/153244302760200704
• 10.1162/153244302760200713
• The elements of statistical learning. Data mining, inference, and prediction

This page was built for publication: A boosting approach for supervised Mahalanobis distance metric learning