06.03.2013 Views

Artificial Intelligence and Soft Computing: Behavioral ... - Arteimi.info

Artificial Intelligence and Soft Computing: Behavioral ... - Arteimi.info

Artificial Intelligence and Soft Computing: Behavioral ... - Arteimi.info

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

trainer, who supplies the input-output training instances. The learning system<br />

adapts its parameters by some algorithms to generate the desired output<br />

patterns from a given input pattern. In absence of trainers, the desired output<br />

for a given input instance is not known, <strong>and</strong> consequently the learner has to<br />

adapt its parameters autonomously. Such type of learning is termed<br />

‘unsupervised learning’. The third type called the re<strong>info</strong>rcement learning<br />

bridges a gap between supervised <strong>and</strong> unsupervised categories. In<br />

re<strong>info</strong>rcement learning, the learner does not explicitly know the input-output<br />

instances, but it receives some form of feedback from its environment. The<br />

feedback signals help the learner to decide whether its action on the<br />

environment is rewarding or punishable. The learner thus adapts its<br />

parameters based on the states (rewarding / punishable) of its actions. Among<br />

the supervised learning techniques, the most common are inductive <strong>and</strong><br />

analogical learning. The inductive learning technique, presented in the<br />

chapter, includes decision tree <strong>and</strong> version space based learning. Analogical<br />

learning is briefly introduced through illustrative examples. The principle of<br />

unsupervised learning is illustrated here with a clustering problem. The<br />

section on re<strong>info</strong>rcement learning includes Q-learning <strong>and</strong> temporal difference<br />

learning. A fourth category of learning, which has emerged recently from the<br />

disciplines of knowledge engineering, is called ‘inductive logic<br />

programming’. The principles of inductive logic programming have also been<br />

briefly introduced in this chapter. The chapter ends with a brief discussion on<br />

the ‘computational theory of learning’. With the background of this theory,<br />

one can measure the performance of the learning behavior of a machine from<br />

the training instances <strong>and</strong> their count.<br />

13.2 Supervised Learning<br />

As already mentioned, in supervised learning a trainer submits the inputoutput<br />

exemplary patterns <strong>and</strong> the learner has to adjust the parameters of the<br />

system autonomously, so that it can yield the correct output pattern when<br />

excited with one of the given input patterns. We shall cover two important<br />

types of supervised learning in this section. These are i) inductive learning <strong>and</strong><br />

ii) analogical learning. A number of other supervised learning techniques<br />

using neural nets will be covered in the next chapter.<br />

13.2.1 Inductive Learning<br />

In supervised learning we have a set of {xi, f (xi)} for 1≤ i ≤ n, <strong>and</strong> our aim is<br />

to determine ‘f’ by some adaptive algorithm. The inductive learning [7-12] is<br />

a special class of the supervised learning techniques, where given a set of {xi,<br />

f(xi)} pairs, we determine a hypothesis h(xi) such that h(xi ) ≈ f(xi), ∀i. A<br />

natural question that may be raised is how to compare the hypothesis h that<br />

approximates f. For instance, there could be more than one h(xi) where all of

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!