A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Oblivious Decision Trees, Graphs, and Top-Down Pruning
1995
International Joint Conference on Artificial Intelligence
We describe a supervised learning algorithm, EODG that uses mutual information to build an oblivious decision tree The tree is then converted to an Oblivious read-Onre Decision Graph (OODG) b\ merging nodes at the same level of the tree For domains that art appropriate for both decision trees and OODGs, per formance is approximately the same aS THAT of C45 ), but the number of nodes in the OODG is much smalle r The merging phase that converts the oblivious decision tree to an OODG provides a
dblp:conf/ijcai/KohaviL95
fatcat:nvs6bezumzdtboeln5dtlg3uoa