## Search

Now showing items 21-30 of 46

#### Interior Point Methods for Massive Support Vector Machines

(2000-05-25)

We investigate the use of interior point methods for solving quadratic
programming problems with a small number of linear constraints where
the quadratic term consists of a low-rank update to a positive semi-de nite
matrix. ...

#### 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 ...

#### Chunking for Massive Nonlinear Kernel Classification

(2006)

A chunking procedure [2] utilized in [18] for linear classifiers is proposed here for nonlinear kernel
classification of massive datasets. A highly accurate algorithm based on nonlinear support vector
machines that ...

#### Nonlinear Knowledge in Kernel Approximation

(2006)

Prior knowledge over arbitrary general sets is
incorporated into nonlinear kernel approximation problems in
the form of linear constraints in a linear program. The key
tool in this incorporation is a theorem of the ...

#### A Finite Newton Method for Classi cation Problems

(2001)

A fundamental classi cation problem of data mining and machine
learning is that of minimizing a strongly convex, piecewise quadratic
function on the n-dimensional real space Rn. We show nite termination
of a Newton ...

#### Support Vector Machine Classi cation via Parameterless Robust Linear Programming

(2003)

We show that the problem of minimizing the sum of arbitrary-norm
real distances to misclassi ed points, from a pair of parallel bounding
planes of a classi cation problem, divided by the margin (distance) be-
tween the ...

#### Absolute Value Equations

(2005)

We investigate existence and nonexistence of solutions for NP-hard equations in-
volving absolute values of variables: Ax ? |x| = b, where A is an arbitrary n � n real matrix.
By utilizing an equivalence relation to the ...

#### FATCOP 2.0: Advanced Features in an Opportunistic Mixed Integer Programming Solver

(2000)

We describe FATCOP 2.0, a new parallel mixed integer program solver that
works in an opportunistic computing environment provided by the Condor resource
management system. We outline changes to the search strategy of ...

#### A Practical Approach to Sample-path Simulation Optimization

(2000)

We propose solving continuous parametric simulation
optimizations using a deterministic nonlinear optimiza-
tion algorithm and sample-path simulations. The op-
timization problem is written in a modeling language
with ...