Learning problems with inherent non-separable Boolean logic is still a challenge that has not been addressed by neural or kernel classifiers. The k-separability concept introduced recently allows for characterization of complexity of non-separable learning problems. A simple constructive feedforward network that uses a modified form of the error function and a window-like functions to localize outputs after projections on a line has been tested on such problems with quite good results. The computational cost of training is low because most nodes and connections are fixed and only weights of one node are modified at each training step. Several examples of learning Boolean functions and results of classification tests on real-world multiclass datasets are presented. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Grochowski, M., & Duch, W. (2007). Learning highly non-separable boolean functions using constructive feedforward neural network. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4668 LNCS, pp. 180–189). Springer Verlag. https://doi.org/10.1007/978-3-540-74690-4_19
Mendeley helps you to discover research relevant for your work.