Look-ahead based fuzzy decision tree induction.
Decision tree induction is typically based on a top-down greedy algorithm that makes locally optimal decisions at each node. Due to the greedy and local nature of the decisions made at each node, there is considerable possibility of instances at the node being split along branches such that instance...
| Publicat a: | IEEE Transactions on fuzzy systems 9, 3 (2001). |
|---|---|
| Autor principal: | |
| Format: | Article |
| Idioma: | English |
| Matèries: |