Department of Computer Science
Similarity learning for semi-supervised multi-class boosting
In semi-supervised classification boosting, a similarity measure is demanded in order to measure the distance between samples (both labeled and unlabeled). However, most of the existing methods employed a simple metric, such as Euclidian distance, which may not be able to truly reflect the actual similarity/distance. This paper presents a novel similarity learning method based on the geodesic distance. It incorporates the manifold, margin and the density information of the data which is important in semi-supervised classification. The proposed similarity measure is then applied to a semi-supervised multi-class boosting (SSMB) algorithm. In turn, the three semi-supervised assumptions, namely smoothness, low density separation and manifold assumption, are all satisfied. We evaluate the proposed method on UCI databases. Experimental results show that the SSMB algorithm with proposed similarity measure outperforms the SSMB algorithm with Euclidian distance. © 2011 IEEE.
assumption, boosting, density, manifold, margin, multi-class, semi-supervised learning, similarity
Source Publication Title
2011 IEEE International Conference on Acoustics, Speech, and Signal Processing
Prague, Czech Republic
Link to Publisher's Edition
Wang, Q. Y., P. C. Yuen, and G. C. Feng. "Similarity learning for semi-supervised multi-class boosting." 2011 IEEE International Conference on Acoustics, Speech, and Signal Processing (2011): 2164-2167.