An investigation of a linguistic perceptron in a nonlinear decision boundary problem
We have developed a linguistic perceptron (LP) to deal with the problem in pattern recognition where inputs are uncertain. This algorithm is based on the extension principle and the decomposition theorem. Several synthetic data sets are used to illustrate the behavior of this linguistic perceptron i...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2014
|
| Online Access: | http://www.scopus.com/inward/record.url?eid=2-s2.0-34250742379&partnerID=40&md5=9d305d0d9a70d181bf88f992579eacd7 http://cmuir.cmu.ac.th/handle/6653943832/1296 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| Language: | English |
| Summary: | We have developed a linguistic perceptron (LP) to deal with the problem in pattern recognition where inputs are uncertain. This algorithm is based on the extension principle and the decomposition theorem. Several synthetic data sets are used to illustrate the behavior of this linguistic perceptron in linearly separable, nonlinearly separable and nonseparable situations. We also compare the results from the linguistic perceptron with that from the regular perceptron. © 2006 IEEE. |
|---|