Access the full text.
Sign up today, get DeepDyve free for 14 days.
(2001)
A Theory of the Learnable
E. Aarts, Van Laarhoven (1985)
Statistical cooling : a general approach to combinatorial optimization problemsPhilips Journal of Research, 40
F. Glover (1989)
Tabu search — Part IORSA J. 3, 1
L. Breiman, J. Friedman, R. Olshen, C. Stone (1984)
Classification and Regression TreesBiometrics, 40
S. Kirkpatrick, C. Gelatt, Mario Vecchi (1983)
Optimization by Simulated AnnealingScience, 220
J. Rissanen (1978)
Modeling By Shortest Data Description*Autom., 14
L. Hyafil, R. Rivest (1976)
Constructing Optimal Binary Decision Trees is NP-CompleteInf. Process. Lett., 5
Stewart Wilson (2004)
Classifier systems and the animat problemMachine Learning, 2
N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller (1953)
Equation of state calculations by fast computing machinesJournal of Chemical Physics, 21
James Kelly, L. Davis (1991)
A Hybrid Genetic Algorithm for Classification
E.M. Kleinberg (1990)
Stochastic discriminationAnn. Math. and AI, 1
Peter Clark, T. Niblett (2004)
The CN2 induction algorithmMachine Learning, 3
J. Grefenstette, C. Ramsey, A. Schultz (2004)
Learning sequential decision rules using simulation models and competitionMachine Learning, 5
K. Yamanishi (1990)
A learning criterion for stochastic rulesMachine Learning, 9
(1974)
Estimation of Dependencies
P. Laarhoven, E. Aarts (1987)
Simulated Annealing: Theory and Applications, 37
F. Glover (1989)
Tabu Search - Part IINFORMS J. Comput., 1
O. Gascuel, G. Caraux (1992)
Distribution-free performance bounds with the
F. Romeo, A. Vincentelli, Huang (1986)
AN EFFICIENT GENERAL COOLING SCHEDULE FOR SIMULATED ANNEALING
P. Bonelli, A. Parodi, S. Sen, Stewart Wilson (1990)
Newboole: A Fast GBML System
K. Jong, W. Spears (1991)
Learning Concept Classification Rules Using Genetic Algorithms
R. Rivest (1987)
Learning Decision ListsMachine Learning, 2
A. Hertz, D. Werra (1990)
The tabu search metaheuristic: How we used itAnnals of Mathematics and Artificial Intelligence, 1
M. Lundy, A. Mees (1986)
Convergence of an annealing algorithmMathematical Programming, 34
A. Blumer, A. Ehrenfeucht, D. Haussler, Manfred Warmuth (1987)
Occam's RazorInf. Process. Lett., 24
E. Bonomi, J. Lutton (1984)
The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis AlgorithmSiam Review, 26
M. Lundy (1985)
Applications of the annealing algorithm to combinatorial problems in statisticsBiometrika, 72
(1992)
Tabu search - Part I , ORSA J . 3 , v . 1 ( 1989 ) 190 . [ 11 ] F . Glover , Tabu search - Part II , ORSA J . 1 , v . 2 ( 1990 ) 4
A. Hertz, D. Werra (1990)
The tabu search metaheuristic: How we used itAnn. Math. and AI, 1
O. Gascuel, G. Caraux (1992)
Distribution-free performance bounds with the resubstitution error estimatePattern Recognition Lett., 13
F. Glover (1989)
Tabu Search - Part IIINFORMS J. Comput., 2
E. Kleinberg (1990)
Stochastic discriminationAnnals of Mathematics and Artificial Intelligence, 1
This paper deals with learning decision lists from examples. In real world problems, data are often noisy and imperfectly described. It is commonly acknowledged that in such cases, consistent but inevitably complex classification procedures usually cause overfitting: results are perfect on the learning set but worse on new examples. Therefore, one searches for less complex procedures which are almost consistent or, in other words, for a good compromise between complexity and goodness-of-fit. But such a requirement generally involves NP-completeness. In a way, CN2 provides a greedy approach to the problem. In this paper, we propose to search the solution space more extensively, using a stochastic procedure, an association of simulated annealing (SA) and simple tabu search (TS) in two distinct phases. In the first phase, we use SA to diversify the search. In the second phase, TS intensifies the search. We compare CART, CN2, and our method using natural and artificial domains.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Apr 5, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.