Sciweavers

KDD
2001
ACM
145views Data Mining» more  KDD 2001»
14 years 5 months ago
Proximal support vector machine classifiers
Given a dataset, each element of which labeled by one of k labels, we construct by a very fast algorithm, a k-category proximal support vector machine (PSVM) classifier. Proximal s...
Glenn Fung, Olvi L. Mangasarian
KDD
2004
ACM
117views Data Mining» more  KDD 2004»
14 years 5 months ago
Regularized multi--task learning
Past empirical work has shown that learning multiple related tasks from data simultaneously can be advantageous in terms of predictive performance relative to learning these tasks...
Theodoros Evgeniou, Massimiliano Pontil
KDD
2005
ACM
168views Data Mining» more  KDD 2005»
14 years 5 months ago
Nomograms for visualizing support vector machines
We propose a simple yet potentially very effective way of visualizing trained support vector machines. Nomograms are an established model visualization technique that can graphica...
Aleks Jakulin, Martin Mozina, Janez Demsar, Ivan B...
KDD
2006
ACM
165views Data Mining» more  KDD 2006»
14 years 5 months ago
Training linear SVMs in linear time
Linear Support Vector Machines (SVMs) have become one of the most prominent machine learning techniques for highdimensional sparse data commonly encountered in applications like t...
Thorsten Joachims
ISBI
2004
IEEE
14 years 5 months ago
Qualitative Asymmetry Measure for Melanoma Detection
Size Functions and Support Vector Machines are used to implement a new automatic classifier of melanocytic lesions. This is mainly based on a qualitative assessment of asymmetry. ...
Michele d'Amico, Massimo Ferri, Ignazio Stanganell...
ICML
2000
IEEE
14 years 5 months ago
Learning Subjective Functions with Large Margins
In manyoptimization and decision problems the objective function can be expressed as a linear combinationof competingcriteria, the weights of whichspecify the relative importanceo...
Claude-Nicolas Fiechter, Seth Rogers
ICML
2000
IEEE
14 years 5 months ago
Bounds on the Generalization Performance of Kernel Machine Ensembles
We study the problem of learning using combinations of machines. In particular we present new theoretical bounds on the generalization performance of voting ensembles of kernel ma...
Luis Pérez-Breva, Massimiliano Pontil, Theo...
ICML
2004
IEEE
14 years 5 months ago
Multi-task feature and kernel selection for SVMs
We compute a common feature selection or kernel selection configuration for multiple support vector machines (SVMs) trained on different yet inter-related datasets. The method is ...
Tony Jebara
ICML
2005
IEEE
14 years 5 months ago
An efficient method for simplifying support vector machines
In this paper we describe a new method to reduce the complexity of support vector machines by reducing the number of necessary support vectors included in their solutions. The red...
DucDung Nguyen, Tu Bao Ho