Sciweavers

1393 search results - page 48 / 279
» Machine Learning by Function Decomposition
Sort
View
COLT
2005
Springer
15 years 7 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
ICASSP
2008
IEEE
15 years 8 months ago
Nested support vector machines
The one-class and cost-sensitive support vector machines (SVMs) are state-of-the-art machine learning methods for estimating density level sets and solving weighted classificatio...
Gyemin Lee, Clayton Scott
IJCAI
2003
15 years 2 months ago
Statistics Gathering for Learning from Distributed, Heterogeneous and Autonomous Data Sources
With the growing use of distributed information networks, there is an increasing need for algorithmic and system solutions for data-driven knowledge acquisition using distributed,...
Doina Caragea, Jaime Reinoso, Adrian Silvescu, Vas...
ML
2002
ACM
146views Machine Learning» more  ML 2002»
15 years 1 months ago
Kernel Matching Pursuit
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
Pascal Vincent, Yoshua Bengio
IJCNN
2006
IEEE
15 years 7 months ago
Learning the Kernel in Mahalanobis One-Class Support Vector Machines
— In this paper, we show that one-class SVMs can also utilize data covariance in a robust manner to improve performance. Furthermore, by constraining the desired kernel function ...
Ivor W. Tsang, James T. Kwok, Shutao Li