A Nonconformity Approach to Model Selection for SVMs (2009)
Hardoon, David R., Hussain, Zakria, Shawe-Taylor, John
We investigate the issue of model selection and the use of the nonconformity (strangeness) measure in batch learning. Using the nonconformity measure we propose a new training algorithm that helps...
Theory of matching pursuit (2009)
Zakria Hussain, John Shawe-taylor
We analyse matching pursuit for kernel principal components analysis (KPCA) by proving that the sparse subspace it produces is a sample compression scheme. We show that this bound is tighter than the...
Directed Acyclic Graph SVM with Decision Value History Smoothing (2009)
David R. Hardoon, Charanpal Dhanjal, Zakria Hussain
Data set V of the BCI competition is comprised of three tasks; that of imagination repetitive self-paced left and right hand movement and the generation of words beginning with the same random...
A Nonconformity Approach to Model Selection for SVMs (2009)
Hardoon, David, Hussain, Zakria, Shawe-Taylor, John
We investigate the issue of model selection and the use of the nonconformity (strangeness) measure in batch learning. Using the nonconformity measure we propose a new training algorithm that helps...
Matching Pursuit Kernel Fisher Discriminant Analysis (2009)
Diethe, Tom, Hussain, Zakria, Hardoon, David, Shawe-Taylor, John
We derive a novel sparse version of Kernel Fisher Discriminant Analysis (KFDA) using an approach based on Matching Pursuit (MP). We call this algorithm Matching Pursuit Kernel Fisher Discriminant...
Prediction with the SVM using test point margins (2009)
Ozogur-Akyuz, Sureyya, Hussain, Zakria, Shawe-Taylor, John
Support vector machines (SVMs) carry out binary classification by constructing a maximal margin hyperplane between the two classes of observed (training) examples and then classifying test points...
Zakria Hussain, Sandor Szedmak
The Set Covering Machine (SCM) was introduced by Marchand & Shawe–Taylor [6, 7] in which a minimum set cover of a class of examples was approximated to find a compact conjunction/disjunction of...
Revised Loss Bounds for the Set Covering Machine and Sample-Compression Loss Bounds (2008)
For Imbalanced Data, Zakria Hussain, François Laviolette, Mario Marchand, Départment Ift-glo, Spencer Charles Brubaker, ...
Marchand and Shawe-Taylor (2002) have proposed a loss bound for the set covering machine that has the property to depend on the observed fraction of positive examples and on what the classifier...
Prediction with the SVM using test point margins (2008)
Ozogur, Sureyya, Hussain, Zakria, Shawe-Taylor, John
Support vector machines (SVMs) carry out binary classification by constructing a maximal margin hyperplane between the two classes of observed (training) examples and then classifying test points...
Theory of matching pursuit (2008)
Hussain, Zakria, Shawe-Taylor, John
We analyse matching pursuit for kernel principal components analysis (KPCA) by proving that the sparse subspace it produces is a sample compression scheme. We show that this bound is tighter than the...
Hussain, Zakria, Laviolette, Francois, Marchand, Mario, Shawe-Taylor, John, Brubaker, Spencer Charles, Mullin, Matthew D
Marchand and Shawe-Taylor (2002) have proposed a loss bound for the set covering machine that has the property to depend on the observed fraction of positive examples and on what the classifier...
Using generalization error bounds to train the set covering machine (2007)
Hussain, Zakria, Shawe-Taylor, John
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider a sub-optimal...
Revised Loss Bound for the Set Covering Machine (2005)
Hussain, Zakria, Brubaker, Spencer Charles, Laviolette, Francois, Marchand, Mario, Shawe-Taylor, John
A revised loss bound for the Set Covering Machine in order to rectify the problem of imbalanced classifications.
The Linear Programming Set Covering Machine (2004)
Hussain, Zakria, Szedmak, Sandor, Shawe-Taylor, John
The Set Covering Machine (SCM) was introduced by Marchand \& Shawe--Taylor~\cite{SCM2001,SCM2002} in which a minimum set cover of a class of examples was approximated to find a compact...