Relaxational metric adaptation and its application to semi-supervised clustering and content-based image retrieval

DOI10.1016/J.PATCOG.2006.04.006MaRDI QIDQ2498685zbMATH OpenOpenAlexFDO

Authors Hong Chang, Dit-Yan Yeung, William K. Cheung

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

zbMATH Keywords

distance metricside informationnonparametric methodsemi-supervised clusteringcontent-based image retrievalconstrained \(k\)-meanspairwise similarity and dissimilarity

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Pattern recognition, speech recognition (68T10) Computing methodologies for image processing (68U10)

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

Cites work

• scientific article; zbMATH DE number 5957283 (Why is no real title available?)
• A new nonparametric pairwise clustering algorithm based on iterative estimation of distance profiles
• An Optimal Global Nearest Neighbor Metric
• Clustering based on conditional distributions in an auxiliary space
• Multidimensional scaling.
• On deformable models for visual pattern recognition
• Optimization of k nearest neighbor density estimates
• Pattern classification.
• Regularization algorithms for learning that are equivalent to multilayer networks
• Self-organization and associative memory
• The optimal distance measure for nearest neighbor classification

Cited in

(7)

• Efficiently learning the metric with side-information
• 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
• Generalized iterative RELIEF for supervised distance metric learning
• Locally linear metric adaptation with application to semi-supervised clustering and image retrieval

Describes a project that uses

Uses Software

• GTM

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)