We present a recurrent neural network which learns to suggest the next move during the descent along the branches of a decision tree. More precisely, given a decision instance represented by a node in the decision tree, the network provides the degree of membership of each possible move to the fuzzy set << good move >>. These fuzzy values constitute the core of the probability of selecting the move out of the set of the children of the current node. This results in a natural way for driving the sharp discrete- state process running along the decision tree by means of incremental methods on the continuous-valued parameters of the neural network. The bulk of the learning problem consists in stating useful links between the local decisions about the next move and the global decisions about the suitability of the final solution. The peculiarity of the learning task is that the network has to deal explicitly with the twofold charge of lighting up the best solution and generating the move sequence that leads to that solution. We tested various options for the learning procedure on the problem of disambiguating natural language sentences.
|Titolo:||Learning fuzzy decision trees|
|Parole Chiave:||Decision trees; Disambiguation; Fuzzy sets; Hybrid systems; Learning; Natural language; Parsing; Recurrent neural networks|
|Data di pubblicazione:||1998|
|Digital Object Identifier (DOI):||10.1016/S0893-6080(98)00030-6|
|Appare nelle tipologie:||01 - Articolo su periodico|