Sciweavers

3250 search results - page 206 / 650
» Parameterized Learning Complexity
Sort
View
STOC
2004
ACM
102views Algorithms» more  STOC 2004»
16 years 6 months ago
A simple polynomial-time rescaling algorithm for solving linear programs
The perceptron algorithm, developed mainly in the machine learning literature, is a simple greedy method for finding a feasible solution to a linear program (alternatively, for le...
John Dunagan, Santosh Vempala
ICML
2004
IEEE
16 years 7 months ago
The Bayesian backfitting relevance vector machine
Traditional non-parametric statistical learning techniques are often computationally attractive, but lack the same generalization and model selection abilities as state-of-the-art...
Aaron D'Souza, Sethu Vijayakumar, Stefan Schaal
ITS
2004
Springer
155views Multimedia» more  ITS 2004»
15 years 12 months ago
Modeling the Development of Problem Solving Skills in Chemistry with a Web-Based Tutor
This research describes a probabilistic approach for developing predictive models of how students learn problem-solving skills in general qualitative chemistry. The goal is to use ...
Ron Stevens, Amy Soller, Melanie Cooper, Marcia Sp...
NIPS
2001
15 years 8 months ago
Algorithmic Luckiness
Classical statistical learning theory studies the generalisation performance of machine learning algorithms rather indirectly. One of the main detours is that algorithms are studi...
Ralf Herbrich, Robert C. Williamson
GECCO
2008
Springer
148views Optimization» more  GECCO 2008»
15 years 7 months ago
On the effects of node duplication and connection-oriented constructivism in neural XCSF
For artificial entities to achieve high degrees of autonomy they will need to display appropriate adaptability. In this sense adaptability includes representational flexibility gu...
Gerard David Howard, Larry Bull