The following pages link to (Q2880882):
Displaying 50 items.
- LMNN (Q41468) (← links)
- Geometry preserving multi-task metric learning (Q374164) (← links)
- A supervised non-linear dimensionality reduction approach for manifold learning (Q408078) (← links)
- Efficient distance metric learning by adaptive sampling and mini-batch stochastic gradient descent (SGD) (Q493732) (← links)
- Unregularized online learning algorithms with general loss functions (Q504379) (← links)
- Multiclass classification with potential function rules: margin distribution and generalization (Q645885) (← links)
- A boosting approach for supervised Mahalanobis distance metric learning (Q645912) (← links)
- Fast generalization rates for distance metric learning. Improved theoretical analysis for smooth strongly convex distance metric learning (Q669277) (← links)
- Lowest probability mass neighbour algorithms: relaxing the metric constraint in distance-based neighbourhood algorithms (Q669282) (← links)
- Time series classification by class-specific Mahalanobis distance measures (Q695678) (← links)
- Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework (Q742122) (← links)
- Large margin subspace learning for feature selection (Q888576) (← links)
- Active learning for semi-supervised clustering based on locally linear propagation reconstruction (Q889394) (← links)
- Learning distance metric for object contour tracking (Q903090) (← links)
- A Klein-bottle-based dictionary for texture representation (Q903458) (← links)
- Pattern recognition via projection-based \(k\)NN rules (Q962393) (← links)
- Tuning of the hyperparameters for \(L2\)-loss SVMs with the RBF kernel by the maximum-margin principle and the jackknife technique (Q1669630) (← links)
- Survey on distance metric learning and dimensionality reduction in data mining (Q1711231) (← links)
- CFSBoost: cumulative feature subspace boosting for drug-target interaction prediction (Q1717082) (← links)
- Wasserstein discriminant analysis (Q1722729) (← links)
- On the positive semi-definite property of similarity matrices (Q1725687) (← links)
- SICA: subjectively interesting component analysis (Q1741396) (← links)
- Generalised kernel weighted fuzzy c-means clustering algorithm with local information (Q1795024) (← links)
- Model-aware categorical data embedding: a data-driven approach (Q1797953) (← links)
- Retrieval of brain tumors with region-specific bag-of-visual-words representations in contrast-enhanced MRI images (Q1929534) (← links)
- Using the K-nearest neighbor algorithm for the classification of lymph node metastasis in gastric cancer (Q1929623) (← links)
- Good edit similarity learning by loss minimization (Q1945121) (← links)
- Generalization ability of online pairwise support vector machine (Q1996328) (← links)
- Learning distance to subspace for the nearest subspace methods in high-dimensional data classification (Q2005504) (← links)
- Image matching from handcrafted to deep features: a survey (Q2056423) (← links)
- Social media as author-audience games (Q2066637) (← links)
- Distance metric learning for graph structured data (Q2071320) (← links)
- Ordinal regression with explainable distance metric learning based on ordered sequences (Q2071504) (← links)
- Interpretable machine learning: fundamental principles and 10 grand challenges (Q2074414) (← links)
- Prescriptive selection of machine learning hyperparameters with applications in power markets: retailer's optimal trading (Q2106752) (← 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 algorithm for Bayesian nearest neighbours (Q2176367) (← links)
- Learning a distance metric from relative comparisons between quadruplets of images (Q2187430) (← links)
- Image annotation by propagating labels from semantic neighbourhoods (Q2187434) (← links)
- Non-rigid 3D shape retrieval based on multi-scale graphical image and joint Bayesian (Q2197940) (← links)
- An efficient method for clustered multi-metric learning (Q2200672) (← links)
- Unsupervised representation learning with minimax distance measures (Q2217399) (← links)
- A new class of metrics for learning on real-valued and structured data (Q2218351) (← links)
- Sparse distance metric learning (Q2259733) (← links)
- A graph-based semi-supervised \(k\) nearest-neighbor method for nonlinear manifold distributed data classification (Q2282041) (← 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)
- Semantic distance between vague concepts in a framework of modeling with words (Q2317635) (← links)
- Adaptive Euclidean maps for histograms: generalized Aitchison embeddings (Q2353001) (← links)
