๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Decision Tree Induction Based on Efficient Tree Restructuring

โœ Scribed by Paul E. Utgoff; Neil C. Berkman; Jeffery A. Clouse

Book ID
110250052
Publisher
Springer
Year
1997
Tongue
English
Weight
416 KB
Volume
29
Category
Article
ISSN
0885-6125

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Induction of fuzzy decision trees
Induction of fuzzy decision trees
โœ Yufei Yuan; Michael J. Shaw ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 964 KB
Data abstractions for decision tree indu
Data abstractions for decision tree induction
โœ Yoshimitsu Kudoh; Makoto Haraguchi; Yoshiaki Okubo ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 285 KB

When descriptions of data values in a database are too concrete or too detailed, the computational complexity needed to discover useful knowledge from the database will be generally increased. Furthermore, discovered knowledge tends to become complicated. A notion of data abstraction seems useful to

A mass assignment based ID3 algorithm fo
A mass assignment based ID3 algorithm for decision tree induction
โœ J. F. Baldwin; J. Lawry; T. P. Martin ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 243 KB

A mass assignment based ID3 algorithm for learning probabilistic fuzzy decision trees is introduced. Fuzzy partitions are used to discretize continuous feature universes and to reduce complexity when universes are discrete but with large cardinalities. Furthermore, the fuzzy partitioning of classifi