Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data
From MaRDI portal
Publication:975219
DOI10.1016/J.PATCOG.2010.02.022zbMATH Open1207.68261OpenAlexW2032942379MaRDI QIDQ975219FDOQ975219
Authors: Mahdieh Soleymani Baghshah, Saeed Bagheri-Shouraki 
Publication date: 8 June 2010
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2010.02.022
Recommendations
- Kernel-based metric learning for semi-supervised clustering
- Learning a metric when clustering data points in the presence of constraints
- A Scalable Kernel-Based Semisupervised Metric Learning Algorithm with Out-of-Sample Generalization Ability
- Efficiently learning the metric with side-information
- Semi-supervised clustering with metric learning: an adaptive kernel method
kernelnon-linearmetric learningtopological structureoptimization problemsemi-supervised clusteringpositive and negative constraints
Cites Work
- A generalized Foley–Sammon transform based on generalized fisher discriminant criterion and its application to face recognition
- Title not available (Why is that?)
- Correlation clustering
- 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
- 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
- Efficiently learning the metric with side-information
- Mixture Modeling with Pairwise, Instance-Level Class Constraints
Cited In (23)
- Efficiently learning the metric with side-information
- Extending the relevant component analysis algorithm for metric learning using both positive and negative equivalence constraints
- Information-theoretic semi-supervised metric learning via entropy regularization
- Feature discovery in non-metric pairwise data
- Metric and kernel learning using a linear transformation
- Marginal semi-supervised sub-manifold projections with informative constraints for dimensionality reduction and recognition
- Fusion of geochemical and remote-sensing data for lithological mapping using random forest metric learning
- A novel multiset integrated canonical correlation analysis framework and its application in feature fusion
- Indefinite proximity learning: a review
- Constrained large margin local projection algorithms and extensions for multimodal dimensionality reduction
- Semi-supervised clustering with discriminative random fields
- Semi-supervised metric learning via topology preserving multiple semi-supervised assumptions
- Semi-supervised clustering with metric learning: an adaptive kernel method
- Kernel-based metric learning for semi-supervised clustering
- Pairwise constraints based multiview features fusion for scene classification
- Active constrained fuzzy clustering: a multiple kernels learning approach
- PCA-KL: a parametric dimensionality reduction approach for unsupervised metric learning
- LogDet Divergence-Based Metric Learning With Triplet Constraints and Its Applications
- Learning a metric when clustering data points in the presence of constraints
- A Scalable Kernel-Based Semisupervised Metric Learning Algorithm with Out-of-Sample Generalization Ability
- Supervised distance metric learning through maximization of the Jeffrey divergence
- 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
This page was built for publication: Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975219)
