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

How aliases are used in DNS, How aliases are used in DNS? Explain. CNAM...

How aliases are used in DNS? Explain. CNAME entries are analogous to a symbolic link in a file system- the entry gives an alias for other DNS entry. Corporation of expertsmind

Responsibilities of objects, The Transaction object is responsible for read...

The Transaction object is responsible for reading the transaction file, finding the relevant account in the array of customers and applying the transaction. To find the relevant ac

What are the layers of data description in r/3, What are the layers of data...

What are the layers of data description in R/3? There layesr are there:- The external layer. The ABAP/4 layer. The database layer.

What is the maximum number of fragments, What is the maximum number of frag...

What is the maximum number of fragments that can result from a single IP Datagram? Explain. To fragment a datagram for transmission across a network, a router utilizes the netw

What is computer, WHAT IS COMPUTER? Computer is termed in the Oxford di...

WHAT IS COMPUTER? Computer is termed in the Oxford dictionary as "An automatic electronic apparatus for making controlling operations or calculations    which are expressible i

Duplicating processes, DUPLICATING PROCESSES : As we mentioned earlier dup...

DUPLICATING PROCESSES : As we mentioned earlier duplicating is a process whereby a master copy is prepared from which a large number of other copies are obtained with the help of

Learning decision trees using id3 - artificial intelligence, L e arning D...

L e arning Decision Trees Using ID3 Sp eci f y i n g the Problem We now have to look at how you mentally created your decision tree when deciding what to do at

Complexity of sequential search, Specified the average case complexity of s...

Specified the average case complexity of sequential search in an array of unsorted elements of size n if the following conditions hold: a)  Probability of the key to be in the a

Differentiate b/w pre-emptive and non-pre-emptive scheduling, Differentiate...

Differentiate between pre-emptive and non-pre-emptive scheduling. Pre-emptive scheduling : in its approach, center processing unit can be taken away from a process if there is a

Software engineering, assignment on transaction flow, transform flow, trans...

assignment on transaction flow, transform flow, transform mapping: refining the architectural design

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