Asymmetric bagging and random subspace for support vector machines-based relevance feedback in image retrieval

Publication Type:
Journal Article
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2006, 28 (7), pp. 1088 - 1099
Issue Date:
Filename Description Size
Thumbnail2011000294OK.pdf3.11 MB
Adobe PDF
Full metadata record
Relevance feedback schemes based on support vector machines (SVM) have been widely used in content-based image retrieval (CBIR). However, the performance of SVM-based relevance feedback is often poor when the number of labeled positive feedback samples is small. This is mainly due to three reasons: 1) an SVM classifier is unstable on a small-sized training set, 2) SVM's optimal hyperplane may be biased when the positive feedback samples are much less than the negative feedback samples, and 3) overfitting happens because the number of feature dimensions is much higher than the size of the training set. In this paper, we develop a mechanism to overcome these problems. To address the first two problems, we propose an asymmetric bagging-based SVM (AB-SVM). For the third problem, we combine the random subspace method and SVM for relevance feedback, which is named random subspace SVM (RS-SVM). Finally, by integrating AB-SVM and RS-SVM, an asymmetric bagging and random subspace SVM (ABRS-SVM) is built to solve these three problems and further improve the relevance feedback performance. © 2006, IEEE. All rights reserved.
Please use this identifier to cite or link to this item: