Good day.
I would like to ask for a better and clearer explanation for the Find-S algorithm. You see, the one in Machine Learning book was not that clear to me and almost handouts I saw from the net rely on that book as well. Given target = <?, Cold, ?, ?, ?, Warm>, hypothesis = <0,0,0,0,0,0> and random generated example, how can I use them in a Find-S algorithm?
On another forum here, the person who asked gives a good example (which is very simple) and the person who answered gives a very clear explanation. You should be able to apply to your problem from looking at what he did. If not, I would like to see all the posible target & generated example.
I guess, the list of positive examples is my main problem of understanding the whole algorithm. We were not given a list of it or maybe I am missing something?
The examples are generated in random and the program counts the number of examples until hypothesis = given target (concept). The attributes used are the same in the Machine Learning book:
It looks to me that your problem has more dimensions that the simple example on that forum. Though, I believe your target looks wrong to me because it does not match the given attributes you gave (in order). The reason is that the last attribute value of the given target is Warm but your last attribute in the list is forecase which has no warm value.
Anyway in your case, the positive example would be those attributes that match your current hypothesis. It would start from specific (look for the exactly the same) to general. The value in the hypothesis set is not 0 but an empty set.
Look at this pdf on page 3, slide 13, you should see how the sample becomes positive & negative. If you already have a target, you could simply mark as negative if none of the attribute you are looking for is not matched...
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.