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

Recordable cds and dvds, Optical disk becomes an attractive alternative for...

Optical disk becomes an attractive alternative for backing up information from hard disk drives and employs large text, audio and video data. Advent of CD-ROM-R and DVD-ROM-R has b

Application and function areas - artificial intelligence, Application and F...

Application and Function Areas - artificial intelligence: Individual applications and function often drive "AI" research much more than the long term relative field described

Write a short note on pointer declaration, Write a short note on pointer de...

Write a short note on pointer declaration A simple variable in a program is stored in a certain number of bytes at a particular memory location, or address, in the machine. Poi

Using binary search, A sorted file having 16 items. Using binary search, th...

A sorted file having 16 items. Using binary search, the maximum number of comparisons to find for an item in this file is The maximum number of comparison is 4

Artificial intelligence software, Artificial Intelligence Software A...

Artificial Intelligence Software Artificial Intelligence (AI) software employs non numerical algorithms to resolve complex problems that are not amenable to computation or s

What do you mean by resolution, Q. What do you mean by Resolution? Reso...

Q. What do you mean by Resolution? Resolution is parameter which defines possible sharpness or clarity of a video image.  Resolution is defined as number of pixels which make u

Explain the term step-wise refinement, Explain the term step-wise refinemen...

Explain the term step-wise refinement. Ans:  Step Wise Refinement  Refinement is a method of elaboration. Here one starts with a statement of function that is described a

Determine a program that is in execution, Determine a program that is in ex...

Determine a program that is in execution is known as Program in execution is known as Process

Define miss rate, Define miss rate? It is the number of misses' states ...

Define miss rate? It is the number of misses' states as a fraction of attempted accesses.

Explain region, What is a Region? A Region is a continuous area of a p...

What is a Region? A Region is a continuous area of a process's address space (like text, data and stack). The kernel in a "Region Table" that is local to the process mainta

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