3250 search results - page 263 / 650 » Parameterized Learning Complexity |
158
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
In this paper, we propose a new context-sensitive Bayesian learning algorithm. By modeling the distributions of data locations by a mixture of Gaussians, the new algorithm can uti...
180
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Relational world models that can be learned from experience in stochastic domains have received significant attention recently. However, efficient planning using these models rema...
152
Voted
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
124
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
We present a novel algorithm for computing a training set consistent subset for the nearest neighbor decision rule. The algorithm, called FCNN rule, has some desirable properties....
211
click to vote
ICML
1995
IEEE
16 years 7 months ago
1995
IEEE
Understanding high-dimensional real world data usually requires learning the structure of the data space. The structure maycontain high-dimensional clusters that are related in co...