Sciweavers

ML
2002
ACM
223views Machine Learning» more  ML 2002»
13 years 11 months ago
Text Categorization with Support Vector Machines. How to Represent Texts in Input Space?
The choice of the kernel function is crucial to most applications of support vector machines. In this paper, however, we show that in the case of text classification, term-frequenc...
Edda Leopold, Jörg Kindermann
ML
2002
ACM
121views Machine Learning» more  ML 2002»
13 years 11 months ago
Near-Optimal Reinforcement Learning in Polynomial Time
We present new algorithms for reinforcement learning, and prove that they have polynomial bounds on the resources required to achieve near-optimal return in general Markov decisio...
Michael J. Kearns, Satinder P. Singh
ML
2002
ACM
143views Machine Learning» more  ML 2002»
13 years 11 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng
ML
2002
ACM
104views Machine Learning» more  ML 2002»
13 years 11 months ago
A Simple Decomposition Method for Support Vector Machines
The decomposition method is currently one of the major methods for solving support vector machines. An important issue of this method is the selection of working sets. In this pape...
Chih-Wei Hsu, Chih-Jen Lin
ML
2002
ACM
180views Machine Learning» more  ML 2002»
13 years 11 months ago
Gene Selection for Cancer Classification using Support Vector Machines
Isabelle Guyon, Jason Weston, Stephen Barnhill, Vl...
ML
2002
ACM
163views Machine Learning» more  ML 2002»
13 years 11 months ago
Structural Modelling with Sparse Kernels
A widely acknowledged drawback of many statistical modelling techniques, commonly used in machine learning, is that the resulting model is extremely difficult to interpret. A numb...
Steve R. Gunn, Jaz S. Kandola
ML
2002
ACM
145views Machine Learning» more  ML 2002»
13 years 11 months ago
Boosting Methods for Regression
In this paper we examine ensemble methods for regression that leverage or "boost" base regressors by iteratively calling them on modified samples. The most successful lev...
Nigel Duffy, David P. Helmbold
ML
2002
ACM
128views Machine Learning» more  ML 2002»
13 years 11 months ago
A Simple Method for Generating Additive Clustering Models with Limited Complexity
Additive clustering was originally developed within cognitive psychology to enable the development of featural models of human mental representation. The representational flexibili...
Michael D. Lee
ML
2002
ACM
140views Machine Learning» more  ML 2002»
13 years 11 months ago
A Probabilistic Framework for SVM Regression and Error Bar Estimation
In this paper, we elaborate on the well-known relationship between Gaussian Processes (GP) and Support Vector Machines (SVM) under some convex assumptions for the loss functions. ...
Junbin Gao, Steve R. Gunn, Chris J. Harris, Martin...