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

DOI10.1016/j.patcog.2006.04.006zbMath1096.68714OpenAlexW2129710414MaRDI QIDQ2498685

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

zbMATH Keywords

content-based image retrievaldistance metricside informationnonparametric methodsemi-supervised clusteringconstrained \(k\)-meanspairwise similarity and dissimilarity

Mathematics Subject Classification ID

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

Related Items

Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN) ⋮ A novel multiset integrated canonical correlation analysis framework and its application in feature fusion ⋮ Semi-supervised clustering with discriminative random fields ⋮ Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data

Uses Software

• GTM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Self-organization and associative memory
• On deformable models for visual pattern recognition
• Clustering Based on Conditional Distributions in an Auxiliary Space
• Regularization Algorithms for Learning That Are Equivalent to Multilayer Networks
• An Optimal Global Nearest Neighbor Metric
• The optimal distance measure for nearest neighbor classification
• Optimization of k nearest neighbor density estimates
• A new nonparametric pairwise clustering algorithm based on iterative estimation of distance profiles