Sciweavers

296 search results - page 20 / 60
» How to process uncertainty in machine learning
Sort
View
ML
2002
ACM
143views Machine Learning» more  ML 2002»
13 years 8 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
ICML
2007
IEEE
14 years 9 months ago
Sample compression bounds for decision trees
We propose a formulation of the Decision Tree learning algorithm in the Compression settings and derive tight generalization error bounds. In particular, we propose Sample Compres...
Mohak Shah
ICALT
2005
IEEE
14 years 2 months ago
Trial of Team Activities in an Engineering Design Course with a Web Communication Tool
The purpose of this study is to consider how to use an electronic learning (e-learning) system in engineering design. The first e-learning trial in an engineering design course wa...
Kazuya Takemata, Nobuyuki Naoe, Masakatsu Matsuish...
JMLR
2008
209views more  JMLR 2008»
13 years 8 months ago
Bayesian Inference and Optimal Design for the Sparse Linear Model
The linear model with sparsity-favouring prior on the coefficients has important applications in many different domains. In machine learning, most methods to date search for maxim...
Matthias W. Seeger
ECTEL
2008
Springer
13 years 10 months ago
e-Learning in Higher Education: Searching for a Model of Curriculum Analysis
The main purpose behind the design of this experience is the idea of obtaining useful information to know how the online courses in our University have been developed, and trying t...
Linda J. Castaneda