11,972 research outputs found
Probabilistic and fuzzy reasoning in simple learning classifier systems
This paper is concerned with the general stimulus-response problem as addressed by a variety of simple learning c1assifier systems (CSs). We suggest a theoretical model from which the assessment of uncertainty emerges as primary concern. A number of representation schemes borrowing from fuzzy logic theory are reviewed, and sorne connections with a well-known neural architecture revisited. In pursuit of the uncertainty measuring goal, usage of explicit probability distributions in the action part of c1assifiers is advocated. Sorne ideas supporting the design of a hybrid system incorpo'rating bayesian learning on top of the CS basic algorithm are sketched
Iris Codes Classification Using Discriminant and Witness Directions
The main topic discussed in this paper is how to use intelligence for
biometric decision defuzzification. A neural training model is proposed and
tested here as a possible solution for dealing with natural fuzzification that
appears between the intra- and inter-class distribution of scores computed
during iris recognition tests. It is shown here that the use of proposed neural
network support leads to an improvement in the artificial perception of the
separation between the intra- and inter-class score distributions by moving
them away from each other.Comment: 6 pages, 5 figures, Proc. 5th IEEE Int. Symp. on Computational
Intelligence and Intelligent Informatics (Floriana, Malta, September 15-17),
ISBN: 978-1-4577-1861-8 (electronic), 978-1-4577-1860-1 (print
FURY: Fuzzy unification and resolution based on edit distance
We present a theoretically founded framework for fuzzy
unification and resolution based on edit distance over trees.
Our framework extends classical unification and resolution
conservatively. We prove important properties of the framework
and develop the FURY system, which implements the
framework efficiently using dynamic programming. We
evaluate the framework and system on a large problem in
the bioinformatics domain, that of detecting typographical
errors in an enzyme name databas
Compactness of first-order fuzzy logics
One of the nice properties of the first-order logic is the compactness of
satisfiability. It state that a finitely satisfiable theory is satisfiable.
However, different degrees of satisfiability in many-valued logics, poses
various kind of the compactness in these logics. One of this issues is the
compactness of -satisfiability. Here, after an overview on the results
around the compactness of satisfiability and compactness of -satisfiability
in many-valued logic based on continuous t-norms (basic logic), we extend the
results around this topic. To this end, we consider a reverse semantical
meaning for basic logic. Then we introduce a topology on and
that the interpretation of all logical connectives are continuous with respect
to these topologies. Finally using this fact we extend the results around the
compactness of satisfiability in basic ogic
- ā¦