Sciweavers

3636 search results - page 504 / 728
» Crafting Papers on Machine Learning
Sort
View
SIGIR
2008
ACM
15 years 5 months ago
Automatically identifying localizable queries
Personalization of web search results as a technique for improving user satisfaction has received notable attention in the research community over the past decade. Much of this wo...
Michael J. Welch, Junghoo Cho
153
Voted
JMLR
2002
115views more  JMLR 2002»
15 years 5 months ago
PAC-Bayesian Generalisation Error Bounds for Gaussian Process Classification
Approximate Bayesian Gaussian process (GP) classification techniques are powerful nonparametric learning methods, similar in appearance and performance to support vector machines....
Matthias Seeger
ML
2002
ACM
135views Machine Learning» more  ML 2002»
15 years 5 months ago
Bayesian Treed Models
When simple parametric models such as linear regression fail to adequately approximate a relationship across an entire set of data, an alternative may be to consider a partition o...
Hugh A. Chipman, Edward I. George, Robert E. McCul...
ML
2002
ACM
143views Machine Learning» more  ML 2002»
15 years 5 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
2007
ACM
101views Machine Learning» more  ML 2007»
15 years 5 months ago
A persistent union-find data structure
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
Sylvain Conchon, Jean-Christophe Filliâtre