Search
Now showing items 1-10 of 19
Multiple Instance Classification via Successive Linear Programming
(2005)
The multiple instance classification problem [6,2,12] is formulated using a linear
or nonlinear kernel as the minimization of a linear function in a finite dimensional
(noninteger) real space subject to linear and bilinear ...
Massive Data Classification via Unconstrained Support Vector Machines
(2006)
A highly accurate algorithm, based on support vector machines
formulated as linear programs [13, 1], is proposed
here as a completely unconstrained minimization problem
[15]. Combined with a chunking procedure [2] this ...
RSVM: Reduced Support Vector Machines
(2001-01)
An algorithm is proposed which generates a nonlinear kernel-based
separating surface that requires as little as 1% of a large dataset for its explicit
evaluation. To generate this nonlinear surface, the entire dataset ...
Incremental Support Vector Machine Classi cation
(2001)
Using a recently introduced proximal support vector ma-
chine classi er [4], a very fast and simple incremental support vector
machine (SVM) classi er is proposed which is capable of modifying an
existing linear classi ...
Privacy-Preserving Linear and Nonlinear Approximation via Linear Programming
(2011)
We propose a novel privacy-preserving random kernel approximation based on a data matrix
A ? Rm�n whose rows are divided into privately owned blocks. Each block of rows belongs to
a different entity that is unwilling to ...
Survival-Time Classi cation of Breast Cancer Patients
(2001)
The identi cation of breast cancer patients for whom chemother-
apy could prolong survival time is treated here as a data mining prob-
lem. This identi cation is achieved by clustering 253 breast cancer
patients into ...
Cross-Validation, Support Vector Machines and Slice Models
(2001)
We show how to implement the cross-validation technique used in ma-
chine learning as a slice model. We describe the formulation in terms of support
vector machines and extend the GAMS/DEA interface to allow for e cient ...
Robust Linear and Support Vector Regression
(2000-09)
The robust Huber M-estimator, a differentiable cost function that is quadratic for small errors and linear otherwise, is
modeled exactly, in the original primal space of the problem, by an easily solvable simple convex ...
Privacy-Preserving Classification of Vertically Partitioned Data via Random Kernels
(2007)
We propose a novel privacy-preserving support vector machine (SVM) classifier for a data matrix A whose
input feature columns are divided into groups belonging to different entities. Each entity is unwilling to share
its ...
Privacy-Preserving Classification of Horizontally Partitioned Data via Random Kernels
(2007)
We propose a novel privacy-preserving nonlinear support vector machine (SVM) classifier for a
data matrix A whose columns represent input space features and whose individual rows are divided
into groups of rows. Each ...










