Semi-supervised clustering with metric learning: an adaptive kernel method
From MaRDI portal
Publication:962673
DOI10.1016/j.patcog.2009.11.005zbMath1192.68623OpenAlexW2056766567MaRDI QIDQ962673
Enliang Hu, Xuesong Yin, Dao-Qiang Zhang, Song-can Chen
Publication date: 7 April 2010
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2009.11.005
Related Items (8)
Comparing clusterings using combination of the kappa statistic and entropy-based measure ⋮ Learning a metric when clustering data points in the presence of constraints ⋮ Semi-supervised clustering via multi-level random walk ⋮ On using supervised clustering analysis to improve classification performance ⋮ Semi-supervised clustering with discriminative random fields ⋮ Semi-supervised learning using autodidactic interpolation on sparse representation-based multiple one-dimensional embedding ⋮ Efficient semi-supervised learning on locally informative multiple graphs ⋮ Kernel-based hard clustering methods in the feature space with automatic variable weighting
Cites Work
This page was built for publication: Semi-supervised clustering with metric learning: an adaptive kernel method
