A multi-birth metric learning framework based on binary constraints
From MaRDI portal
Recommendations
- An efficient method for clustered multi-metric learning
- Learning a Mahalanobis distance metric for data clustering and classification
- Recent advances on supervised distance metric learning algorithms
- Fast generalization rates for distance metric learning. Improved theoretical analysis for smooth strongly convex distance metric learning
- Supervised distance metric learning through maximization of the Jeffrey divergence
Cites work
- A generalized Foley–Sammon transform based on generalized fisher discriminant criterion and its application to face recognition
- Adaptive Relevance Matrices in Learning Vector Quantization
- An efficient method for clustered multi-metric learning
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Distance metric learning for large margin nearest neighbor classification
- Distance Metric Learning via Iterated Support Vector Machines
- scientific article; zbMATH DE number 1804115 (Why is no real title available?)
- Local discriminative distance metrics ensemble learning
- Statistical comparisons of classifiers over multiple data sets
- Supervised distance metric learning through maximization of the Jeffrey divergence
- Survey on distance metric learning and dimensionality reduction in data mining
This page was built for publication: A multi-birth metric learning framework based on binary constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6052417)
