Robust template decomposition without weight restriction for cellular neural networks implementing arbitrary Boolean functions using support vector classifiers

MaRDI QIDQ473890zbMATH OpenFDO

Authors Yih-Lon Lin, Jer-Guang Hsieh, J. H. Jeng

Publication date 24 November 2014

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Mathematics Subject Classification ID

Boolean functions (06E30) Learning and adaptive systems in artificial intelligence (68T05)

Review text

Summary: If the given Boolean function is linearly separable, a robust uncoupled cellular neural network can be designed as a maximal margin classifier. On the other hand, if the given Boolean function is linearly separable but has a small geometric margin or it is not linearly separable, a popular approach is to find a sequence of robust uncoupled cellular neural networks implementing the given Boolean function. In the past research works using this approach, the control template parameters and thresholds are restricted to assume only a given finite set of integers, and this is certainly unnecessary for the template design. In this study, we try to remove this restriction. Minterm- and maxterm-based decomposition algorithms utilizing the soft margin and maximal margin support vector classifiers are proposed to design a sequence of robust templates implementing an arbitrary Boolean function. Several illustrative examples are simulated to demonstrate the efficiency of the proposed method by comparing our results with those produced by other decomposition methods with restricted weights.

Recommendations

• ROBUST TEMPLATE DECOMPOSITION WITH RESTRICTED WEIGHTS FOR CELLULAR NEURAL NETWORKS IMPLEMENTING AN ARBITRARY BOOLEAN FUNCTION
• Implementation of arbitrary Boolean functions on a CNN Universal Machine
• IDENTIFICATION AND REALIZATION OF LINEARLY SEPARABLE BOOLEAN FUNCTIONS VIA CELLULAR NEURAL NETWORKS
• REALIZATION OF BOOLEAN FUNCTIONS VIA CNN WITH VON NEUMANN NEIGHBORHOODS
• REALIZATION AND BIFURCATION OF BOOLEAN FUNCTIONS VIA CELLULAR NEURAL NETWORKS

Cited in

(4)

• ROBUST TEMPLATE DECOMPOSITION WITH RESTRICTED WEIGHTS FOR CELLULAR NEURAL NETWORKS IMPLEMENTING AN ARBITRARY BOOLEAN FUNCTION
• Implementation of arbitrary Boolean functions on a CNN Universal Machine
• IDENTIFICATION AND REALIZATION OF LINEARLY SEPARABLE BOOLEAN FUNCTIONS VIA CELLULAR NEURAL NETWORKS
• A configurable digital cellular neural network with template decomposition

This page was built for publication: Robust template decomposition without weight restriction for cellular neural networks implementing arbitrary Boolean functions using support vector classifiers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q473890)