Inductive Learning with BCT

Chan, Philip K.

BCT (Binary Classification Tree) is a system that learns from examples and represents learned concepts as
a binary polythetic decision tree. Polythetic trees differ from monothetic decision trees in that a logical
combination of multiple (versus a single) attribute values may label each tree arc. Statistical evaluations
are used to recursively partition the concept space in two and expand the tree. As with standard decision
trees, leaves denote classifications. Classes are predicted for unseen instances by traversing appropriate
branches in the tree to the leaves. Empirical results demonstrated that BCT is generally more accurate or
comparable to two earlier systems.



  • thumnail for demo title for ac:110888 demo title for ac:110888 application/octet-stream 23.1 KB Download File

More About This Work

Academic Units
Computer Science
Department of Computer Science, Columbia University
Columbia University Computer Science Technical Reports, CUCS-451-89
Published Here
April 26, 2011