𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Construction of recognition decision rules in the class of logical functions

✍ Scribed by G. S. Lbov

Publisher
John Wiley and Sons
Year
1992
Tongue
English
Weight
305 KB
Volume
4
Category
Article
ISSN
0899-9457

No coin nor oath required. For personal study only.

✦ Synopsis

We consider the class of logical decision rules of pattern recognition and introduce the concept of optimal rules from the given class. It is shown that the methods of construction of logical rules have a set of positive characteristics. A short description of program system LAS-TAN, which realizes the methods of data analysis, is given.

πŸ“œ SIMILAR VOLUMES

The Maximal Closed Classes of Unary Func
The Maximal Closed Classes of Unary Functions in p-Valued Logic
✍ Liu Renren; Lo Czukai πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 327 KB

In many-valued logic the decision of functional completeness is a basic and important problem, and the thorough solution to this problem depends on determining all maximal closed sets in the set of many-valued logic functions. It includes three famous problems, i.e., to determine all maximal closed

Strong Asymptotic Equivalence and Invers
Strong Asymptotic Equivalence and Inversion of Functions in the Class Kc
✍ Dragan DjurčiΔ‡; Aleksandar TorgaΕ‘ev πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 76 KB

In this paper we consider the class of functions K c introduced by W. Matuszewska (1964, Studia Math. 24, 271-279) and W. Matuszewska and W. Orlicz (1965, Studia Math. 26, 11-24). As a main result we describe, in terms of the class K c , when two strictly increasing functions, as well as their inver