| M. Berthold; J. Diamond, 1998, "Constructive training of probabilistic neural networks", Neurocomputing, pp. 167-- 183. |
No context found.
M.R. Berthold, J. Diamond, "Constructive Training of Probabilistic Neural Networks ", Neurocomputing 19: 167-183, 1998.
....set consists of locally independent, rectangular areas in the input space supporting trapezoidal membership functions. The combined set of soft rules or fuzzy points allows a representation in form of a fuzzy graph. The used algorithm is derived from a constructive neural network training method [19] and builds this rule set from scratch requiring only a few presentations of the training patterns. In addition to crisp targets also soft numbers can be used to specify the desired output behavior. II. Fuzzy Graphs Zadeh illustrates fuzzy graphs in [20] as follows: The primary function of a ....
....; dn then y is k The algorithm presented in this section automatically constructs a fuzzy graph based on a set of examples. The partitioning of the input variables is determined automatically from the examples. The used algorithm is derived from a constructive neural network training algorithm [19]. In this paper a modified version of that algorithm, based on [21] is used to automatically find a set of soft rules that describe the training data. Figure 3 shows an example of a fuzzy graph constructed by the proposed algorithm. The output 1 1 A B C D E F X Y Fig. 3. An example for ....
Michael R. Berthold and Jay Diamond, "Constructive training of probabilistic neural networks", Neurocomputing, 1998.
No context found.
M. Berthold; J. Diamond, 1998, "Constructive training of probabilistic neural networks", Neurocomputing, pp. 167-- 183.
No context found.
Berthold, M., Diamond, J. (1998), Constructive Training of Probabilistic Neural Networks, Neurocomputing 19, 167-183
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC