Sciweavers

732 search results - page 79 / 147
» Strongly Non-U-Shaped Learning Results by General Techniques
Sort
View
ICML
1999
IEEE
14 years 9 months ago
Making Better Use of Global Discretization
Before applying learning algorithms to datasets, practitioners often globally discretize any numeric attributes. If the algorithm cannot handle numeric attributes directly, prior ...
Eibe Frank, Ian H. Witten
SIGCSE
2009
ACM
119views Education» more  SIGCSE 2009»
14 years 9 months ago
Implications of integrating test-driven development into CS1/CS2 curricula
Many academic and industry professionals have called for more testing in computer science curricula. Test-driven development (TDD) has been proposed as a solution to improve testi...
Chetan Desai, David S. Janzen, John Clements
GECCO
2009
Springer
110views Optimization» more  GECCO 2009»
14 years 1 months ago
EMO shines a light on the holes of complexity space
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
Núria Macià, Albert Orriols-Puig, Es...
ATAL
2008
Springer
13 years 11 months ago
Sigma point policy iteration
In reinforcement learning, least-squares temporal difference methods (e.g., LSTD and LSPI) are effective, data-efficient techniques for policy evaluation and control with linear v...
Michael H. Bowling, Alborz Geramifard, David Winga...
ML
2000
ACM
150views Machine Learning» more  ML 2000»
13 years 8 months ago
Adaptive Retrieval Agents: Internalizing Local Context and Scaling up to the Web
This paper discusses a novel distributed adaptive algorithm and representation used to construct populations of adaptive Web agents. These InfoSpiders browse networked information ...
Filippo Menczer, Richard K. Belew