Back to Search
Start Over
Robust Template Decomposition without Weight Restriction for Cellular Neural Networks Implementing Arbitrary Boolean Functions Using Support Vector Classifiers
- Source :
- Mathematical Problems in Engineering, Vol 2013 (2013)
- Publication Year :
- 2013
- Publisher :
- Hindawi Limited, 2013.
-
Abstract
- 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.
- Subjects :
- Article Subject
General Mathematics
lcsh:Mathematics
General Engineering
lcsh:QA1-939
Support vector machine
Boolean network
Margin (machine learning)
lcsh:TA1-2040
Cellular neural network
Margin classifier
Boolean expression
Boolean function
lcsh:Engineering (General). Civil engineering (General)
Algorithm
Linear separability
Mathematics
Subjects
Details
- Language :
- English
- ISSN :
- 15635147
- Volume :
- 2013
- Database :
- OpenAIRE
- Journal :
- Mathematical Problems in Engineering
- Accession number :
- edsair.doi.dedup.....7f47850612e48d25f95a1fd8267b8b48