Sciweavers

1897 search results - page 93 / 380
» Sparse Additive Machine
Sort
View
JCP
2006
102views more  JCP 2006»
15 years 2 months ago
Efficient Formulations for 1-SVM and their Application to Recommendation Tasks
The present paper proposes new approaches for recommendation tasks based on one-class support vector machines (1-SVMs) with graph kernels generated from a Laplacian matrix. We intr...
Yasutoshi Yajima, Tien-Fang Kuo
COLT
2010
Springer
15 years 7 days ago
Adaptive Subgradient Methods for Online Learning and Stochastic Optimization
We present a new family of subgradient methods that dynamically incorporate knowledge of the geometry of the data observed in earlier iterations to perform more informative gradie...
John Duchi, Elad Hazan, Yoram Singer
ACSAC
2006
IEEE
15 years 8 months ago
Delegate: A Proxy Based Architecture for Secure Website Access from an Untrusted Machine
Performing sensitive online transactions using computers found in cybercaf´es and public libraries is risky. The untrusted nature of these machines creates a target rich environm...
Ravi Chandra Jammalamadaka, Timothy W. van der Hor...
133
Voted
ALT
2000
Springer
15 years 5 months ago
Computationally Efficient Transductive Machines
In this paper1 we propose a new algorithm for providing confidence and credibility values for predictions on a multi-class pattern recognition problem which uses Support Vector mac...
Craig Saunders, Alexander Gammerman, Volodya Vovk
133
Voted
JMLR
2006
150views more  JMLR 2006»
15 years 2 months ago
Exact 1-Norm Support Vector Machines Via Unconstrained Convex Differentiable Minimization
Support vector machines utilizing the 1-norm, typically set up as linear programs (Mangasarian, 2000; Bradley and Mangasarian, 1998), are formulated here as a completely unconstra...
Olvi L. Mangasarian