Tek-Tips is the largest IT community on the Internet today!

Members share and learn making Tek-Tips Forums the best source of peer-reviewed technical information on the Internet!

  • Congratulations IamaSherpa on being selected by the Tek-Tips community for having the most helpful posts in the forums last week. Way to Go!

Using the ID3 - decision-tree

Status
Not open for further replies.

christioan

Programmer
May 1, 2002
7
AT
I implemented a ID3-algorithm in Prolog.

I have following attributes:
genre: action, komödie, thriller, comic
actor: snips, willis, carrey
dtt: dvd, vhs
zustellung: normal, express

If I use my ID3-algorithm I will get the following result:
tree(internal(action), [komödie-tree(internal(dvd), [vhs-leaf(p), dvd-leaf(n)]), action-tree(internal(willis), [willis-leaf(p), snips-leaf(n), carrey-leaf(p)]), thriller-tree(internal(willis), [willis-tree(internal(zustellung), [express-leaf(n), normal-leaf(p)]), snips-leaf(p)]), comic-leaf(p)]).

How can I use the tree to get a specific solution from my database????

Thx
 
would you like to share your ID3 ID3-algorithm to me? Do you know where has the Java edition for ID3-algorithm ?
my mail box is shellypp@sina.com.Thank you!
 
Status
Not open for further replies.

Part and Inventory Search

Sponsor

Back
Top