Pruning and sorting, Computer Engineering

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.

Posted Date: 1/10/2013 7:37:12 AM | Location : United States







Related Discussions:- Pruning and sorting, Assignment Help, Ask Question on Pruning and sorting, Get Answer, Expert's Help, Pruning and sorting Discussions

Write discussion on Pruning and sorting
Your posts are moderated
Related Questions
Advantages on electronic payment system It gives good security schemes.  Four necessary security requirements for safe e-payments are Authentication, Encryption, Integrity,

What are the types where relationship exists in Electronic Market Place? In this two forms of relationships can exist, they are: a. Customer/seller linkage is recognized at

What are the Data types of the ABAP/4 layer? Possible ABAP/4 data types: C: Character. D: Date, format YYYYMMDD. F: Floating-point number in DOUBLE PRECISION (8 bytes)

Explain the Structure of Virtual Enterprise. The virtual enterprise can be a suitable structure to explore the emerging opportunities for forming value in the information socie

The Signalling connection control part (SCCP) and message transfer part (MTP) together are referred to as (A) Signal Switching Points (SSPs) (B)  Signal Transfer Points

for calculating simple interest

Placement algorithm - computer architecture: Different strategies can be taken as to how space is allocated to processes: First fit : Allocate the first hole that is la

Visual basic applications have very rich and flexible applications but there is single limitation when using pointer function. Windows API has limited support for function pointers

Based on the variables, construct a design that haves only main effects of one categorical IV and at least 2 continuous DVs. Discuss what you think the relationship is among the de

Performance Evaluation In this part, we talk about the primary attributes used to measure the performance of a computer system. Unit 2 of block 3 is totally devoted to performa