Sciweavers

2438 search results - page 316 / 488
» Incremental Learning in Biological and Machine Learning Syst...
Sort
View
ICML
2009
IEEE
16 years 5 months ago
Near-Bayesian exploration in polynomial time
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
J. Zico Kolter, Andrew Y. Ng
ICML
2005
IEEE
16 years 5 months ago
Reducing overfitting in process model induction
In this paper, we review the paradigm of inductive process modeling, which uses background knowledge about possible component processes to construct quantitative models of dynamic...
Will Bridewell, Narges Bani Asadi, Pat Langley, Lj...
125
Voted
SAC
2005
ACM
15 years 10 months ago
Discovering parametric clusters in social small-world graphs
We present a strategy for analyzing large, social small-world graphs, such as those formed by human networks. Our approach brings together ideas from a number of different resear...
Jonathan McPherson, Kwan-Liu Ma, Michael Ogawa
ECML
2006
Springer
15 years 8 months ago
The Minimum Volume Covering Ellipsoid Estimation in Kernel-Defined Feature Spaces
Minimum volume covering ellipsoid estimation is important in areas such as systems identification, control, video tracking, sensor management, and novelty detection. It is well kno...
Alexander N. Dolia, Tijl De Bie, Christopher J. Ha...
ICML
2004
IEEE
16 years 5 months ago
Decision trees with minimal costs
We propose a simple, novel and yet effective method for building and testing decision trees that minimizes the sum of the misclassification and test costs. More specifically, we f...
Charles X. Ling, Qiang Yang, Jianning Wang, Shicha...