Supervised distance metric learning through maximization of the Jeffrey divergence
From MaRDI portal
Publication:2290334
DOI10.1016/J.PATCOG.2016.11.010zbMATH Open1429.68235OpenAlexW2555454054WikidataQ62782802 ScholiaQ62782802MaRDI QIDQ2290334FDOQ2290334
Authors: Bac T. Nguyen, Carlos Morell, B. De Baets 
Publication date: 27 January 2020
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2016.11.010
Recommendations
- Recent advances on supervised distance metric learning algorithms
- Distance metric learning for large margin nearest neighbor classification
- Survey on distance metric learning and dimensionality reduction in data mining
- Metric learning: a survey
- Learning a Mahalanobis distance metric for data clustering and classification
Learning and adaptive systems in artificial intelligence (68T05) Measures of information, entropy (94A17)
Cites Work
- Distance metric learning for large margin nearest neighbor classification
- Principal component analysis.
- Title not available (Why is that?)
- Statistical comparisons of classifiers over multiple data sets
- Title not available (Why is that?)
- Least squares quantization in PCM
- Nearest neighbor pattern classification
- On Information and Sufficiency
- Title not available (Why is that?)
- Multiple Comparisons Among Means
- Title not available (Why is that?)
- Distance metric learning with eigenvalue optimization
- Positive semidefinite metric learning using boosting-like algorithms
- Handbook of parametric and nonparametric statistical procedures.
- 10.1162/153244304322972667
- Extending the relevant component analysis algorithm for metric learning using both positive and negative equivalence constraints
- Learning a Mahalanobis distance metric for data clustering and classification
- Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data
- Metric learning: a survey
- Generalized iterative RELIEF for supervised distance metric learning
- Metric Learning
- Large margin subspace learning for feature selection
- Semi-supervised metric learning via topology preserving multiple semi-supervised assumptions
- Distance metric learning by knowledge embedding
- A fuzzy decision strategy for topic identification and dynamic selection of language models.
- LogDet Divergence-Based Metric Learning With Triplet Constraints and Its Applications
- Title not available (Why is that?)
Cited In (15)
- Optimal reach estimation and metric learning
- Survey on distance metric learning and dimensionality reduction in data mining
- A nearest-neighbor search model for distance metric learning
- Joint learning adaptive metric and optimal classification hyperplane
- Distance metric learning with eigenvalue optimization
- A multi-birth metric learning framework based on binary constraints
- \(\mathrm{OPM^2L}\): an optimal instance partition-based multi-metric learning method for heterogeneous dataset classification
- Recent advances on supervised distance metric learning algorithms
- A fast diagonal distance metric learning approach for large-scale datasets
- The analysis from nonlinear distance metric to kernel-based prescription prediction system
- A boosting approach for supervised Mahalanobis distance metric learning
- Physics-constrained non-Gaussian probabilistic learning on manifolds
- Ordinal regression with explainable distance metric learning based on ordered sequences
- Fast generalization rates for distance metric learning. Improved theoretical analysis for smooth strongly convex distance metric learning
- An efficient method for clustered multi-metric learning
Uses Software
This page was built for publication: Supervised distance metric learning through maximization of the Jeffrey divergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2290334)
