Orange Forum • View topic - Binary classification tree

Binary classification tree

A place to ask questions about methods in Orange and how they are used and other general support.

Binary classification tree

Postby kdd » Wed Apr 09, 2008 23:10

Is there a way to grow a classification tree that contains binary splits for nominal attributes? I know there is an exhaustive binary split option, but I want each split to have two branches, of the form 'A = v' and 'A != v' (where A is the chosen attribute and v is a particular value). I believe Weka's J48 algorithm can create such a tree.

Thanks,
Ken

Postby Janez » Mon Jul 14, 2008 11:12

We are proud of our quick responses to such queries. ;)

I've put it on the task list. It's of course not complicated to add such a binarization, so I think will have it soon.

Postby Janez » Sat Aug 02, 2008 22:43

Done. It's on the SVN for those who buils Orange themselves, and it should be in tomorrow's snapshot for Windows (the snapshot now requires Qt 4.4 and is rather unstable right now). This feature will not be ported back to 1.0b, of course.

Since this has only been tested on a few examples, please report any errors you might find - thanks.


Return to Questions & Support