A probabilistic active support vector learning algorithm

Mitra, P. ; Murthy, C. A. ; Pal, S. K. (2004) A probabilistic active support vector learning algorithm IEEE Transactions on Pattern Analysis and Machine Intelligence, 26 (3). pp. 413-418. ISSN 0162-8828

Full text not available from this repository.

Official URL: http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arn...

Related URL: http://dx.doi.org/10.1109/TPAMI.2004.1262340


The paper describes a probabilistic active learning strategy for support vector machine (SVM) design in large data applications. The learning strategy is motivated by the statistical query model. While most existing methods of active SVM learning query for points based on their proximity to the current separating hyperplane, the proposed method queries for a set of points according to a distribution as determined by the current separating hyperplane and a newly defined concept of an adaptive confidence factor. This enables the algorithm to have more robust and efficient learning capabilities. The confidence factor is estimated from local information using the k nearest neighbor principle. The effectiveness of the method is demonstrated on real-life data sets both in terms of generalization performance, query complexity, and training time.

Item Type:Article
Source:Copyright of this article belongs to IEEE.
ID Code:77696
Deposited On:14 Jan 2012 06:06
Last Modified:14 Jan 2012 06:06

Repository Staff Only: item control page