Possibilistic reasoning in a computational neural network
- 22 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4, 2541-2545
- https://doi.org/10.1109/icnn.1997.614696
Abstract
Possibilistic reasoning is implemented in a computational neural network for the formulation of a new classification system. The possibilistic classification is derived in analogy to the reasoning used in Bayesian classifiers. A principle of relational consistency is introduced to establish a connection of possibility and probability distributions. It is shown that possibilistic classification is suitable if distributions of very small classes like system failure data tend to be covered by distributions of large clusters. The classification system is also a paradigm for the implementation of a fuzzy logic system in a neural network architecture.Keywords
This publication has 9 references indexed in Scilit:
- Neural Networks for Pattern RecognitionPublished by Oxford University Press (OUP) ,1995
- An alternative approach for generation of membership functions and fuzzy rules based on radial and cubic basis function networksInternational Journal of Approximate Reasoning, 1995
- A practical view of suboptimal Bayesian classification with radial Gaussian kernelsPublished by Springer Nature ,1995
- From Natural to Artificial Neural ComputationPublished by Springer Nature ,1995
- Fuzzy sets in approximate reasoning, Part 1: Inference with possibility distributionsFuzzy Sets and Systems, 1991
- Fast adaptive k-means clustering: some empirical resultsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- Probabilistic neural networksNeural Networks, 1990
- Fast Learning in Networks of Locally-Tuned Processing UnitsNeural Computation, 1989
- Fuzzy sets as a basis for a theory of possibilityFuzzy Sets and Systems, 1978