The Original Gay Porn Community - Free Gay Movies and Photos, Gay Porn Site Reviews and Adult Gay Forums

  • Welcome To Just Us Boys - The World's Largest Gay Message Board Community

    In order to comply with recent US Supreme Court rulings regarding adult content, we will be making changes in the future to require that you log into your account to view adult content on the site.
    If you do not have an account, please register.
    REGISTER HERE - 100% FREE / We Will Never Sell Your Info

    PLEASE READ: To register, turn off your VPN (iPhone users- disable iCloud); you can re-enable the VPN after registration. You must maintain an active email address on your account: disposable email addresses cannot be used to register.

ID3 Trees

trawler69

trawler69

Extreme Muppet
Joined
Aug 26, 2006
Posts
4,554
Reaction score
1
Points
0
Location
Cornwall U.K.
I don't know diddly squat about all these trees / bushes ponderabilities or what not,. I'm sure it is highly clever and all that.

My take on it FWIW and from the evidence of the table is that when it is windy you only go skiing if you are rested. Season makes no difference, the only evidence of being tired is that you don't go skiiing.

Gut feeling says the answer to the "sticky, windy, high, tired question is NO and to the injured is obviously NO.

I don't really require a lecture on what it is all about. Just expressing my observations is all and because I don't imagine there will be a great response. However by making that statement I may in fact have reversed the immediately preceding prognosis!
 
oh dear .. tree and graph theory is a few semesters past. this looks like something that you could solver better without trees. maybe some OR approach have a look at this:
http://en.wikipedia.org/wiki/Decision_Trees

maybe i can look into it more detailed tomorrow ;)
 
yes, that's called backtracking. something prolog is very good at, but i guess he is not allowed to use this as a solution :)
 
one could put a neural net to great use here :)

but imho it seems it is a more simple task .. they are most likely not asking him for an elegant solution, but merely to build a working tree.

at least that's how most of my exercises where. while i was trying to solve the traveling salesman i got told that i just should provide ONE solution :(
 
Thank all you guys for trying to help me or bringing some entertain here. Especially Noelie.
I found out the solution for this one, it's just because the ID3 tree can't handle the null leaf (1st question) or missing information (second question). But we can go further by using another tree named C4.5 (or J48 ) which is an extension of ID3.
If anyone want some further information of their algorithm, pm me :D.
Thank you all one more time. I love JUB & and JUBbers.
 
You must log in or register to reply here.
Back
Top