Sciweavers

174 search results - page 18 / 35
» Incremental and Decremental Learning for Linear Support Vect...
Sort
View
ICML
2007
IEEE
14 years 8 months ago
Direct convex relaxations of sparse SVM
Although support vector machines (SVMs) for binary classification give rise to a decision rule that only relies on a subset of the training data points (support vectors), it will ...
Antoni B. Chan, Nuno Vasconcelos, Gert R. G. Lanck...
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
ADMA
2006
Springer
153views Data Mining» more  ADMA 2006»
13 years 9 months ago
An Effective Combination Based on Class-Wise Expertise of Diverse Classifiers for Predictive Toxicology Data Mining
This paper presents a study on the combination of different classifiers for toxicity prediction. Two combination operators for the Multiple-Classifier System definition are also pr...
Daniel Neagu, Gongde Guo, Shanshan Wang
ICDM
2003
IEEE
135views Data Mining» more  ICDM 2003»
14 years 26 days ago
An Algorithm for the Exact Computation of the Centroid of Higher Dimensional Polyhedra and its Application to Kernel Machines
The Support Vector Machine (SVM) solution corresponds to the centre of the largest sphere inscribed in version space. Alternative approaches like Bayesian Point Machines (BPM) and...
Frédéric Maire
EACL
2006
ACL Anthology
13 years 9 months ago
Making Tree Kernels Practical for Natural Language Learning
In recent years tree kernels have been proposed for the automatic learning of natural language applications. Unfortunately, they show (a) an inherent super linear complexity and (...
Alessandro Moschitti