On implementation of nested rectangular decision regions by multi-layer perceptrons II: properties and feasibility

Authors:
Che-Chern Lin
Affiliations:
Department of Industrial Technology Education, National Kaohsiung Normal University, Kaohsiung, Taiwan, ROC
Venue:
NN'06 Proceedings of the 7th WSEAS International Conference on Neural Networks
Year:
2006

Citing 5
Cited 0

Applying SP-MLP to complex classification problems

Pattern Recognition Letters
The constraint based decomposition (CBD) training architecture

Neural Networks
Classification ability of single hidden layer feedforward neural networks

IEEE Transactions on Neural Networks
A constructive algorithm to solve “convex recursive deletion” (CoRD) classification problems via two-layer perceptron networks

IEEE Transactions on Neural Networks
A two-layer paradigm capable of forming arbitrary decision regions in input space

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, the author theoretically discusses the partitioning capabilities of the up-down algorithm and proves the implementation feasibility of the algorithm. Four propositions are presented in the paper. The first three propositions explain the nature of the up-down algorithm and the last one proves the implementation feasibility of the algorithm. The author also discusses the implementation feasibility of the partially nested rectangular decision regions using the proposed algorithm.