Please use this identifier to cite or link to this item:
|Title:||Multi-class semi-supervised SVMs with positiveness exclusive regularization||Authors:||Liu, X.
|Issue Date:||2011||Citation:||Liu, X.,Yuan, X.,Yan, S.,Jin, H. (2011). Multi-class semi-supervised SVMs with positiveness exclusive regularization. Proceedings of the IEEE International Conference on Computer Vision : 1435-1442. ScholarBank@NUS Repository. https://doi.org/10.1109/ICCV.2011.6126399||Abstract:||In this work, we address the problem of multi-class classification problem in semi-supervised setting. A regularized multi-task learning approach is presented to train multiple binary-class Semi-Supervised Support Vector Machines (S3VMs) using the one-vs-rest strategy within a joint framework. A novel type of regularization, namely Positiveness Exclusive Regularization (PER), is introduced to induce the following prior: if an unlabeled sample receives significant positive response from one of the classifiers, it is less likely for this sample to receive positive responses from the other classifiers. That is, we expect an exclusive relationship among different S3VMs for evaluating the same unlabeled sample. We propose to use an ℓ 1,2-norm regularizer as an implementation of PER. The objective of our approach is to minimize an empirical risk regularized by a PER term and a manifold regularization term. An efficient Nesterov-type smoothing approximation based method is developed for optimization. Evaluations with comparisons are conducted on several benchmarks for visual classification to demonstrate the advantages of the proposed method. © 2011 IEEE.||Source Title:||Proceedings of the IEEE International Conference on Computer Vision||URI:||http://scholarbank.nus.edu.sg/handle/10635/83985||ISBN:||9781457711015||DOI:||10.1109/ICCV.2011.6126399|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 11, 2019
checked on Sep 7, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.