Relaxational metric adaptation and its application to semi-supervised clustering and content-based image retrieval
DOI10.1016/J.PATCOG.2006.04.006zbMATH Open1096.68714OpenAlexW2129710414MaRDI QIDQ2498685FDOQ2498685
William K. Cheung, Hong Chang, Dit-Yan Yeung
Publication date: 16 August 2006
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2006.04.006
Recommendations
- Locally linear metric adaptation with application to semi-supervised clustering and image retrieval
- Kernel-based metric learning for semi-supervised clustering
- Efficiently learning the metric with side-information
- Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data
- Metric learning: a survey
distance metricside informationnonparametric methodsemi-supervised clusteringcontent-based image retrievalconstrained \(k\)-meanspairwise similarity and dissimilarity
Information storage and retrieval of data (68P20) Pattern recognition, speech recognition (68T10) Computing methodologies for image processing (68U10)
Cites Work
- Regularization Algorithms for Learning That Are Equivalent to Multilayer Networks
- Pattern classification.
- Self-organization and associative memory
- Multidimensional scaling.
- Title not available (Why is that?)
- Clustering based on conditional distributions in an auxiliary space
- An Optimal Global Nearest Neighbor Metric
- The optimal distance measure for nearest neighbor classification
- Optimization of k nearest neighbor density estimates
- On deformable models for visual pattern recognition
- A new nonparametric pairwise clustering algorithm based on iterative estimation of distance profiles
Cited In (5)
- A novel multiset integrated canonical correlation analysis framework and its application in feature fusion
- Semi-supervised clustering with discriminative random fields
- Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN)
- Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data
- Locally linear metric adaptation with application to semi-supervised clustering and image retrieval
Uses Software
This page was built for publication: Relaxational metric adaptation and its application to semi-supervised clustering and content-based image retrieval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2498685)
