Kernel-based metric learning for semi-supervised clustering
From MaRDI portal
Recommendations
- Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data
- A Scalable Kernel-Based Semisupervised Metric Learning Algorithm with Out-of-Sample Generalization Ability
- Semi-supervised clustering with metric learning: an adaptive kernel method
- Locally linear metric adaptation with application to semi-supervised clustering and image retrieval
- Learning a Mahalanobis distance metric for data clustering and classification
Cited in
(28)- A nearest-neighbor search model for distance metric learning
- Kernel-based transition probability toward similarity measure for semi-supervised learning
- An efficient method for clustered multi-metric learning
- Positive semidefinite metric learning using boosting-like algorithms
- A Scalable Kernel-Based Semisupervised Metric Learning Algorithm with Out-of-Sample Generalization Ability
- Semi-supervised metric learning via topology preserving multiple semi-supervised assumptions
- Semi-supervised distance metric learning in high-dimensional spaces by using equivalence constraints
- Iterative category discovery via multiple kernel metric learning
- Convergence analysis of an intrinsic steepest descent method on semi-supervised metric learning
- Distance metric learning guided adaptive subspace semi-supervised clustering
- Efficiently learning the metric with side-information
- Distance metric learning by knowledge embedding
- Semi-supervised clustering with metric learning: an adaptive kernel method
- Locally linear metric adaptation with application to semi-supervised clustering and image retrieval
- Relaxational metric adaptation and its application to semi-supervised clustering and content-based image retrieval
- Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data
- The analysis from nonlinear distance metric to kernel-based prescription prediction system
- Learning a Mahalanobis distance metric for data clustering and classification
- Distance metric learning from cannot-be-linked example pairs, with application to name disambiguation
- Multiple kernel geometric mean metric learning for heterogeneous data
- Information-theoretic semi-supervised metric learning via entropy regularization
- PCA-KL: a parametric dimensionality reduction approach for unsupervised metric learning
- Semi-supervised clustering with discriminative random fields
- An intrinsic accelerated projection gradient algorithm for semi-supervised metric learning
- Joint distance and similarity measure learning based on triplet-based constraints
- Metric and kernel learning using a linear transformation
- Learning a distance metric from relative comparisons between quadruplets of images
- Learning a metric when clustering data points in the presence of constraints
This page was built for publication: Kernel-based metric learning for semi-supervised clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976661)
