Sciweavers

45 search results - page 5 / 9
» ml 2000
Sort
View
ML
2000
ACM
13 years 6 months ago
Enlarging the Margins in Perceptron Decision Trees
Capacity control in perceptron decision trees is typically performed by controlling their size. We prove that other quantities can be as relevant to reduce their flexibility and co...
Kristin P. Bennett, Nello Cristianini, John Shawe-...
ML
2000
ACM
105views Machine Learning» more  ML 2000»
13 years 6 months ago
Multiple Comparisons in Induction Algorithms
Abstract. A single mechanism is responsible for three pathologies of induction algorithms: attribute selection errors, overfitting, and oversearching. In each pathology, induction ...
David D. Jensen, Paul R. Cohen
IJFCS
2000
71views more  IJFCS 2000»
13 years 6 months ago
Light Affine Logic as a Programming Language: A First Contribution
This work is about an experimental paradigmatic functional language for programming with P-TIME functions. The language is designed from Intuitionistic Light Affine Logic. It can ...
Luca Roversi
PADL
2000
Springer
13 years 10 months ago
Programming Deep Concurrent Constraint Combinators
Constraint combination methods are essential for a flexible constraint programming system. This paper presents deep concurrent constraint combinators based on computation spaces as...
Christian Schulte
ML
2000
ACM
244views Machine Learning» more  ML 2000»
13 years 6 months ago
Learnable Evolution Model: Evolutionary Processes Guided by Machine Learning
A new class of evolutionary computation processes is presented, called Learnable Evolution Model or LEM. In contrast to Darwinian-type evolution that relies on mutation, recombinat...
Ryszard S. Michalski