www.vustudents.ning.com

We non-commercial site working hard since 2009 to facilitate learning Read More. We can't keep up without your support. Donate.

# CS607 - GDB#1 - from “August 8th to August 9th , 2019.

GDB
Dear Students,
GDB for CS607 subject will open for two days from Thursday 8th August 2019 to Friday 9th August 2019. (48 Hours only). You will be required to post your comments on following GDB

GDB Topic:
Machine learning algorithms are helpful in solving the complex problems. Furthermore, in Machine learning it is impossible to exhaustively search over the entire concept space i.e. used for representing the problem with respect to some given attributes. Secondly during training process learner has to hypothesize to match the output that best fits the true output of the concept space.
GDB Topic:
Discuss and compare that which algorithm is best suitable for either general to specific or specific to general ordering of hypothesis space.
Note:- Keep your comments brief and to the point, GDB will not be accepted via email in any case.

Views: 1542

### Replies to This Discussion

Please Discuss here about this GDB.Thanks

Our main purpose here discussion not just Solution

We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions. Read More>>

Discussed & be touched with this discussion. After discussion a perfect solution will come in a result at the end.

“How to Join Subject Study Groups & Get Helping Material”

P.S:    Please always try to add the discussion in proper format title like “CS101 Assignment / GDB No 01 Solution & Discussion Due Date: ___________”

Share below link with friends for solution & Discussion. A Single link for help in your education.

http://bit.ly/vucodes

Site Overview | Assignment Solutions | Past Papers |Site Features

give some idea solution

Yeah please give :(

plzz solution discuss kr lain koi

solution Idea :                                                                                                                              In general, machine learning algorithms apply In general, machine learning algorithms apply some optimization algorithm to find a good some optimization algorithm to find a good hypothesis. In this case, hypothesis. In this case,
J is piecewise piecewise
constant constant, which makes this a difficult problem , which makes this a difficult problem

The maximum likelihood estimate Direct Computation. The maximum likelihood estimate
of P(x,y) can be computed from the data without search. ) can be computed from the data without search.
However, inverting the However, inverting the Σ matrix requires O(n matrix requires O(n3) time.

General-to-Specific Ordering of Hyothesis
• ≥
g does not depend on the concept to be learned
• It defines a partial order over the set of hypotheses
• strictly-more-general than: >
g
• more-specific-than

g
• Basis for the learning algorithms presented in the following!
• Find-S:
– Start with most specific hypothesis
(
∅, ∅, ∅, ∅, ∅, ∅
)
– Generalize if positive example is not covered!

GDB Solution
Answer:
In general, machine learning algorithms apply some optimization algorithm to find a good some optimization algorithm to find a good hypothesis. In this case, hypothesis. In this case,
J is piecewise constant, which makes this a difficult problem. The maximum likelihood estimates Direct Computation. The maximum likelihood estimate of P(x, y) can be computed from the data without search. ) can be computed from the data without search. However, inverting the Σ matrix requires O(n matrix requires O(n3) time.

which one is 100% correct?

Is this correct ???/

CS607 GDB

Candidate-Elimination algorithm converge toward the true target concept, provided

There are no errors in the training examples If there is error: The algorithm will remove the true target concept from the version space, because it will eliminate all hypotheses that are inconsistent with each training example.

So, this will be the best suited algorithm for specific to general problems.

Inductive Learning A hypothesis (e.g. a classifier) that is consistent with a sufficiently large number of representative training examples is likely to accurately classify novel instances drawn from the same universe and hence it will be better if general to specific hypothesis are given to this algorithm

So, this will be the best suited algorithm for general to specific problems.

1

2

3

4

5

## Latest Activity

7 hours ago
13 hours ago
arham khan and Technical Guru joined Virtual University of Pakistan
13 hours ago
Muhammad Bilal liked иαвєєℓ αнмє∂'s discussion Kya hal hain ning awam?
yesterday
Technical Guru liked Sana Sunny ツ's discussion we need Chat box at ning
yesterday
Technical Guru updated their profile
yesterday
Saturday
monaliza and waseem are now friends
Saturday

© 2022   Created by + M.Tariq Malik.   Powered by