Fast effective rule induction

WW Cohen - Machine learning proceedings 1995, 1995 - Elsevier
Many existing rule learning systems are computationally expensive on large noisy datasets.
In this paper we evaluate the recently-proposed rule learning algorithm IREP on a large and …

[图书][B] Machine learning, neural and statistical classification

D Michie, DJ Spiegelhalter, CC Taylor, J Campbell - 1995 - dl.acm.org
Machine learning, neural and statistical classification | Guide books skip to main content ACM
Digital Library home ACM home Google, Inc. (search) Advanced Search Browse About Sign in …

Learning logical definitions from relations

JR Quinlan - Machine learning, 1990 - Springer
This paper describes foil, a system that learns Horn clauses from data expressed as
relations. foil is based on ideas that have proved effective in attribute-value learning …

Inductive Logic Programming.

N Lavrac, S Dzeroski - WLP, 1994 - Springer
The 18th International Conference on Inductive Logic Programming was held in Prague,
September 10–12, 2008. ILP returned to Prague after 11 years, and it is tempting to look at …

Separate-and-conquer rule learning

J Fürnkranz - Artificial Intelligence Review, 1999 - Springer
This paper is a survey of inductive rule learning algorithms that use a separate-and-conquer
strategy. This strategy can be traced back to the AQ learning system and still enjoys …

Incremental reduced error pruning

J Fürnkranz, G Widmer - Machine learning proceedings 1994, 1994 - Elsevier
This paper outlines some problems that may occur with Reduced Error Pruning in relational
learning algorithms, most notably efficiency. Thereafter a new method, Incremental Reduced …

Error reduction through learning multiple descriptions

KM Ali, MJ Pazzani - Machine learning, 1996 - Springer
Learning multiple descriptions for each class in the data has been shown to reduce
generalization error but the amount of error reduction varies greatly from domain to domain …

Learning from positive data

S Muggleton - International conference on inductive logic …, 1996 - Springer
Gold showed in 1967 that not even regular grammars can be exactly identified from positive
examples alone. Since it is known that children learn natural grammars almost exclusively …

Trading accuracy for simplicity in decision trees

M Bohanec, I Bratko - Machine Learning, 1994 - Springer
When communicating concepts, it is often convenient or even necessary to define a concept
approximately. A simple, although only approximately accurate concept definition may be …

The utility of knowledge in inductive learning

M Pazzani, D Kibler - Machine learning, 1992 - Springer
In this paper, we demonstrate how different forms of background knowledge can be
integrated with an inductive method for generating function-free Horn clause rules …