Sciweavers

3607 search results - page 512 / 722
» Learning with structured sparsity
Sort
View
192
Voted
ICSE
1999
IEEE-ACM
15 years 9 months ago
Exploiting Smalltalk Modules in a Customizable Programming Environment
This paper describes how we have extended a module structure of the Smalltalk LearningWorks to provide a programming environment deigned for very large scale technology transfer. ...
Mark Woodman, Robert Griffiths, Malcolm Macgregor,...
NIPS
2004
15 years 6 months ago
Maximising Sensitivity in a Spiking Network
We use unsupervised probabilistic machine learning ideas to try to explain the kinds of learning observed in real neurons, the goal being to connect abstract principles of self-or...
Anthony J. Bell, Lucas C. Parra
154
Voted
IJCAI
2003
15 years 6 months ago
Spaces of Theories with Ideal Refinement Operators
Refinement operators for theories avoid the problems related to the myopia of many relational learning algorithms based on the operators that refine single clauses. However, the n...
Nicola Fanizzi, Stefano Ferilli, Nicola Di Mauro, ...
CORR
2006
Springer
153views Education» more  CORR 2006»
15 years 5 months ago
Genetic Programming, Validation Sets, and Parsimony Pressure
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
Christian Gagné, Marc Schoenauer, Marc Pari...
JMLR
2008
100views more  JMLR 2008»
15 years 5 months ago
Hit Miss Networks with Applications to Instance Selection
In supervised learning, a training set consisting of labeled instances is used by a learning algorithm for generating a model (classifier) that is subsequently employed for decidi...
Elena Marchiori