Database Reference
In-Depth Information
Fig. 15.1 DFID outline: A DFID implementation recursively partitions the instance
space of the training set, according to the values of the candidate attributes. As the
recursive partition ends, classifiers are attached to the leaves by employing the embedded
classification method.
Search WWH ::




Custom Search