Abstract:
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 princi...Show MoreMetadata
Abstract:
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.
Published in: 2006 IEEE International Conference on Fuzzy Systems
Date of Conference: 16-21 July 2006
Date Added to IEEE Xplore: 11 September 2006
Print ISBN:0-7803-9488-7
Print ISSN: 1098-7584