| Sazonov, V. and Wnek, J. (1994). A hypothesis-driven constructive induction approach to expanding neural networks. Proceedings of ML-COLT'94. |
....in a non degenerate sense and yet they are typically described as selective and thus non constructive (see 1 In the case of C4.5 the intermediate constructs are the internal decision tree nodes while in the case of backpropagation the constructs are the hidden units in the network. [8,9,10,11,12] for a selection of views) The decision criterion that is being applied in such cases is not completely clear. But it appears to be grounded in an evaluation of the simplicity of the partitioning introduced by the feature. Constructs that introduce simple, local partitions (e.g. the ....
.... process working with some sort of relational description language, e.g. 28, 11,9] In several recent cases, this type of approach has focussed on what are known as counting or M of N features, i.e. features which effectively count the number of occurrences of a particular variable value, cf. [29,30,2,8 31,32]. Equating constructive induction with relational learning is also compatible with the intuition (noted above) that constructive induction involves the creation of non local partitions. Any feature function whose values depend on absolutes will tend to define a partitioning involving contiguous ....
Sazonov, V. and Wnek, J. (1994). A hypothesis-driven constructive induction approach to expanding neural networks. Proceedings of ML-COLT'94.
....not directly involved in production of output) that identify partitions on the representation space. 1 These methods would seem to satisfy the criterion of being feature generators in a non degenerate sense and yet they are typically described as selective and thus non constructive (see [9,10,4,11,12] for a selection of views) The decision criterion that is being applied in such cases is not completely clear. But it appears to be grounded in an evaluation of the simplicity of the partitioning introduced by the feature. Constructs that introduce simple, local partitions (e.g. the ....
.... process working with some sort of relational description language, e.g. 29, 11,10] In several recent cases, this type of approach has focussed on what are known as counting or M of N features, i.e. features which effectively count the number of occurrences of a particular variable value, cf. [30,31,2,9 32,33]. It is worth noting, finally, that although all these approaches place the constructive process within the domain of supervised methods, there is no reason why constructive induction cannot form a part of an unsupervised process. The justification analysis shows that it can form a part of any ....
Sazonov, V. and Wnek, J. (1994). A hypothesis-driven constructive induction approach to expanding neural networks. Proceedings of ML-COLT'94.
No context found.
V. Sazonov and J. Wnek. A hypothesis-driven constructive induction approach to expanding neural networks. In ML-COLT '94 Workshop on Constructive Induction and Change of Representation, 1994.
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