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

Graphics, what is bitmap and pixmap

what is bitmap and pixmap

Digital communication systems, a pcm has the following parameters a maximum...

a pcm has the following parameters a maximum analog input frequency of 4khz maximum decoded voltage at the receiver of 2.55v minimum dr of 6db compute minimum sampling rate,minimum

What are the data types of vhdl, What are the Data types of VHDL VHDL....

What are the Data types of VHDL VHDL. A multitude of language or user defined data types can be used. This may mean dedicated conversion functions are needed to convert object

What is minimum spanning tree, Minimum Spanning Tree: Given a weighted gra...

Minimum Spanning Tree: Given a weighted graph G, it is often desired to make a spanning tree T for G, like the sum of weights of the edges in T is the least. Like tree is known as

Advantages of instruction set architecture, Advantages of Instruction set a...

Advantages of Instruction set architecture: Stack Advantages : it is simple Model of expression evaluation (reverse polish). Contain Short instructions. Disadvanta

Pipeline processing-parallel computer architecture , Pipeline Processing ...

Pipeline Processing Pipelining is a process to realize, overlapped parallelism in the proposed answer of a problem, on a digital computer in an economical way. To understand th

Explain the advantages of object oriented analysis design, Advantages of Ob...

Advantages of Object oriented analysis design The OO approach inherently makes every object a standalone component which can be reused within specific stat problem domains we

Define underflow and overflow, Define underflow and overflow. Underflow...

Define underflow and overflow. Underflow: If the result the arithmetic operation including n-bit numbers is too small to show by n-bits, underflow is said to occur. Overflow

Optical resolution of scanner, Optical resolution or hardware resolution is...

Optical resolution or hardware resolution is mechanical limit on resolution of Scanner. For scanning the sensor has to advance after every line it scans. Smallness of this advancem

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