Sciweavers

447 search results - page 23 / 90
» Choosing Multiple Parameters for Support Vector Machines
Sort
View
ICML
2006
IEEE
14 years 8 months ago
Two-dimensional solution path for support vector regression
Recently, a very appealing approach was proposed to compute the entire solution path for support vector classification (SVC) with very low extra computational cost. This approach ...
Gang Wang, Dit-Yan Yeung, Frederick H. Lochovsky
KDD
2004
ACM
117views Data Mining» more  KDD 2004»
14 years 8 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
ISF
2010
164views more  ISF 2010»
13 years 5 months ago
An SVM-based machine learning method for accurate internet traffic classification
Accurate and timely traffic classification is critical in network security monitoring and traffic engineering. Traditional methods based on port numbers and protocols have proven t...
Ruixi Yuan, Zhu Li, Xiaohong Guan, Li Xu
ESA
2010
Springer
227views Algorithms» more  ESA 2010»
13 years 9 months ago
Approximating Parameterized Convex Optimization Problems
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
Joachim Giesen, Martin Jaggi, Sören Laue
MICCAI
2006
Springer
14 years 8 months ago
The Entire Regularization Path for the Support Vector Domain Description
Abstract. The support vector domain description is a one-class classification method that estimates the shape and extent of the distribution of a data set. This separates the data ...
Karl Sjöstrand, Rasmus Larsen