The following pages link to (Q5405107):
Displaying 22 items.
- Generalization bounds for metric and similarity learning (Q255367) (← links)
- Geometry preserving multi-task metric learning (Q374164) (← links)
- Model-aware categorical data embedding: a data-driven approach (Q1797953) (← links)
- Robust pairwise learning with Huber loss (Q1979426) (← links)
- A nearest-neighbor search model for distance metric learning (Q2123495) (← links)
- Software defect prediction model based on distance metric learning (Q2156978) (← links)
- An efficient method for clustered multi-metric learning (Q2200672) (← links)
- Supervised distance metric learning through maximization of the Jeffrey divergence (Q2290334) (← links)
- Joint distance and similarity measure learning based on triplet-based constraints (Q2293255) (← links)
- Decomposition techniques for bilinear saddle point problems and variational inequalities with affine monotone operators (Q2359772) (← links)
- Online regularized learning with pairwise loss functions (Q2361154) (← links)
- Multi-manifold discriminant Isomap for visualization and classification (Q2416973) (← links)
- Low-Rank Matrix Iteration Using Polynomial-Filtered Subspace Extraction (Q3300851) (← links)
- Stability and optimization error of stochastic gradient descent for pairwise learning (Q5132230) (← links)
- (Q5152646) (← links)
- Online regularized pairwise learning with least squares loss (Q5220066) (← links)
- Online Pairwise Learning Algorithms (Q5380417) (← links)
- \(\mathrm{OPM^2L}\): an optimal instance partition-based multi-metric learning method for heterogeneous dataset classification (Q6052667) (← links)
- A fast diagonal distance metric learning approach for large-scale datasets (Q6092062) (← links)
- NN-EVCLUS: neural network-based evidential clustering (Q6092096) (← links)
- Error analysis of kernel regularized pairwise learning with a strongly convex loss (Q6112862) (← links)
- Spectrally constrained optimization (Q6608071) (← links)
