In 1965 Lofti A. Zadeh proposed fuzzy sets as a generalization of crisp (or classic) sets to address the incapability of crisp sets to model uncertainty and vagueness inherent in the real world. Initially, fuzzy sets did not receive a very warm welcome as many academics stood skeptical towards a theory of “imprecise” mathematics. In the middle to late 1980’s the success of fuzzy controllers bro...

This paper describes the work on methods for combining rules obtained by machine learning systems. Three methods for obtaining the classification of examples with those rules are compared. The advantages and disadvantages of each method are discussed and the results obtained on three real world domains are commented. The methods compared are: selection of the best rule; PROSPECTOR-like probabil...

1371 Stable On-Line Evolutionary Learning of NN-MLP Qiangfu Zhao Abstract| To design the nearest neighbor based multilayer perceptron (NN-MLP) e ciently, the author has proposed a non-genetic based evolutionary algorithm called the R4|rule. For o -line learning, the R4|rule can produce the smallest or nearly smallest networks with high generalization ability by iteratively performing four basic...

The R-rule is a heuristic algorithm for distancebased neural network (DBNN) learning. Experimental results show that the R-rule can obtain the smallest or nearly smallest DBNNs. However, the computational cost of the R-rule is relatively high because the learning vector quantization (LVQ) algorithm is used iteratively during learning. To reduce the cost of the R-rule, we investigate three appro...

Many learning systems must confront the problem of run time after learning being greater than run time before learning. This utility problem has been a particular focus of research in explanation-based learning. In past work we have examined an approach to the utility problem that is based on restricting the expressiveness of the rule language so as to guarantee polynomial bounds on the cost of...

Dominant theories of implicit learning assume that implicit learning merely involves the learning of chunks of adjacent elements in a sequence. In the experiments presented here, participants implicitly learned a nonlocal rule, thus suggesting that implicit learning can go beyond the learning of chunks. Participants were exposed to a set of musical tunes that were all generated using a diatonic...

Based on an earlier study on lazy Bayesian rule learning, this paper introduces a general lazy learning framework, called LazyRule, that begins to learn a rule only when classifying a test case. The objective of the framework is to improve the performance of a base learning algorithm. It has the potential to be used for diierent types of base learning algorithms. LazyRule performs attribute eli...