Sciweavers

466 search results - page 31 / 94
» Consensus-based distributed linear support vector machines
Sort
View
ICML
2007
IEEE
14 years 8 months ago
A fast linear separability test by projection of positive points on subspaces
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
A. P. Yogananda, M. Narasimha Murty, Lakshmi Gopal
JMLR
2002
135views more  JMLR 2002»
13 years 7 months ago
Covering Number Bounds of Certain Regularized Linear Function Classes
Recently, sample complexity bounds have been derived for problems involving linear functions such as neural networks and support vector machines. In many of these theoretical stud...
Tong Zhang
WACV
2002
IEEE
14 years 15 days ago
An Experimental Evaluation of Linear and Kernel-Based Methods for Face Recognition
In this paper we present the results of a comparative study of linear and kernel-based methods for face recognition. The methods used for dimensionality reduction are Principal Co...
Himaanshu Gupta, Amit K. Agrawal, Tarun Pruthi, Ch...
IJCNN
2006
IEEE
14 years 1 months ago
Learning to Rank by Maximizing AUC with Linear Programming
— Area Under the ROC Curve (AUC) is often used to evaluate ranking performance in binary classification problems. Several researchers have approached AUC optimization by approxi...
Kaan Ataman, W. Nick Street, Yi Zhang
MP
2006
137views more  MP 2006»
13 years 7 months ago
New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...
Yu-Hong Dai, Roger Fletcher