Sciweavers

2190 search results - page 256 / 438
» Learning with the Set Covering Machine
Sort
View
UAI
2004
13 years 11 months ago
Bayesian Learning in Undirected Graphical Models: Approximate MCMC Algorithms
Bayesian learning in undirected graphical models--computing posterior distributions over parameters and predictive quantities-is exceptionally difficult. We conjecture that for ge...
Iain Murray, Zoubin Ghahramani
CORR
2002
Springer
99views Education» more  CORR 2002»
13 years 10 months ago
The Identification of Context-Sensitive Features: A Formal Definition of Context for Concept Learning
A large body of research in machine learning is concerned with supervised learning from examples. The examples are typically represented as vectors in a multi-dimensional feature ...
Peter D. Turney
ECML
2004
Springer
14 years 3 months ago
Batch Reinforcement Learning with State Importance
Abstract. We investigate the problem of using function approximation in reinforcement learning where the agent’s policy is represented as a classifier mapping states to actions....
Lihong Li, Vadim Bulitko, Russell Greiner
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
13 years 11 months ago
Semi-Supervised Learning Based on Semiparametric Regularization
Semi-supervised learning plays an important role in the recent literature on machine learning and data mining and the developed semisupervised learning techniques have led to many...
Zhen Guo, Zhongfei (Mark) Zhang, Eric P. Xing, Chr...
CRV
2009
IEEE
115views Robotics» more  CRV 2009»
14 years 5 months ago
Learning Model Complexity in an Online Environment
In this paper we introduce the concept and method for adaptively tuning the model complexity in an online manner as more examples become available. Challenging classification pro...
Dan Levi, Shimon Ullman