Pruning and sorting, Computer Engineering

Assignment Help:

Pruning and Sorting:

This means we can test where each hypothesis explains as entails a common example that we can associate to a hypothesis a set of positive elements in which it explains and a similar set of negative elements. Moreover there is also a similar analogy with general and specific hypotheses as described above as: whether a hypothesis G is more practical than hypothesis S so then the examples explained by S will be a subset of those explained by G.

In fact we will assume the following generic search strategy for an ILP system as: (i) is a set of current hypotheses is maintained and QH (ii) is at each step in the search, a hypothesis H is taken from QH and some inference rules applied to it in order to generate some new hypotheses that are then added to the set as we say that H has been expanded (iii) is, this continues until a termination criteria is met.
However this leaves many questions unanswered. By looking first at the question of that hypothesis to expand at a particular stage, ILP systems associate a label with each hypothesis generated that expresses a probability of the hypothesis holding which is given the background knowledge and examples are true. After then there hypotheses with a higher probability are expanded rather than those with a lower probability and hypotheses with zero probability are pruned from the set QH entirely. However this probability calculation is derived using Bayesian mathematics and we do not go into the derivation here. Moreover we hint at two aspects of the calculation in the paragraphs below.

In just specific to general ILP systems there the inference rules are inductive so each operator takes a hypothesis and generalizes it. However as mentioned above that this means like the hypothesis generated will explain more examples than the original hypothesis. In fact as the search gradually makes hypotheses more generally there will come a stage where a newly formed hypothesis H is common enough to explain a negative example as e- . Thus this should therefore score zero for the probability calculation is just because it cannot possibly hold given the background and examples being true. This means the operators only generalize so there is no way through H can be fixed to not explain e-, so pruning it from QH means the zero probability score is a good decision.


Related Discussions:- Pruning and sorting

Reprographic methods for information distribution, Reprographic Methods ...

Reprographic Methods i) Thermography ii) Dyeline jii) Microfiche iv) Fax In this unit you have learnt that: Used for Methods of reprography are used for the

Determine about the pick device, Determine about the Pick Device Light ...

Determine about the Pick Device Light Pens The light pen used to select screen positions by detecting the light coming from points on the CRT screen. These are sensitive to

Explain jk flip-flop using sr flip-flop, Q. Explain 4 bit Ripple counter wi...

Q. Explain 4 bit Ripple counter with necessary diagram. Q. Explain JK Master-slave Flip-flop with block diagram and logic design. Q. Explain JK flip-flop using SR flip-flop

Internal conditioning, types of internal conditioning with explanations and...

types of internal conditioning with explanations and examples

Direct mapped strategy, Determine the layout of the specified cache for a C...

Determine the layout of the specified cache for a CPU that can address 1G x 32  of memory.  show the layout of the bits per cache location and the total number of locations.  a)

What is computer virus, What is computer virus?  A  computer  virus  is...

What is computer virus?  A  computer  virus  is  a  computer  program  that  is  designed  to  spread  itself between   computers.   Computer virus are inactive when standing a

The files in tif format, Image Capturing Download the following grey lev...

Image Capturing Download the following grey level 512x512 standard images in TIF format: a-Lena       b-Baboon     c-Bridge       d-Airfield Use Matlab to decrease the siz

Structure tensor, what is structure tensor?how we calculate for image pixel...

what is structure tensor?how we calculate for image pixel?

What do you mean by parallel virtual machine, Q.What do you mean by Paralle...

Q.What do you mean by Parallel virtual machine? PVM is essentially a simulation of a computer machine running parallel programs. It is a software package which allows a heterog

Explain LRU page replacement algorithm, Explain LRU Page replacement algori...

Explain LRU Page replacement algorithm. LRU policy: It expands to least recently use. This policy proposes that we remove a page that last usage is farthest from present time

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd