http://dx.doi.org/10.1109/ICASSP.2011.5946756">
 

Document Type

Conference Paper

Department/Unit

Department of Computer Science

Title

Similarity learning for semi-supervised multi-class boosting

Language

English

Abstract

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.

Keywords

assumption, boosting, density, manifold, margin, multi-class, semi-supervised learning, similarity

Publication Date

2011

Source Publication Title

2011 IEEE International Conference on Acoustics, Speech, and Signal Processing

Start Page

2164

End Page

2167

Conference Location

Prague, Czech Republic

Publisher

IEEE

ISBN (print)

9781457705380

ISBN (electronic)

9781457705373

This document is currently not available here.

Share

COinS