✦ LIBER ✦

Choice of optimal complexity of the class of logical decision functions in pattern recognition problems

✍ Scribed by V. B. Berikov; G. S. Lbov

Book ID: 111454505
Publisher: SP MAIK Nauka/Interperiodica
Year: 2007
Tongue: English
Weight: 137 KB
Volume: 76
Category: Article
ISSN: 1064-5624
DOI: 10.1134/s1064562407060403

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Construction of recognition decision rul

Construction of recognition decision rules in the class of logical functions

✍ G. S. Lbov 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 305 KB

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

Synthesis of the structure of a family o

Synthesis of the structure of a family of nonparametric decision functions in the pattern recognition problem

✍ A. V. Lapko; V. A. Lapko 📂 Article 📅 2011 🏛 Allerton Press Inc 🌐 English ⚖ 182 KB

Computational complexity of recognition

Computational complexity of recognition learning procedures in the class of piecewise-linear committee decision rules

✍ M. Yu. Khachai 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 214 KB

Methods of determining the optimal decis

Methods of determining the optimal decision functions in truncated sequential analysis problems

✍ A. I. Shatilov 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 549 KB

A contribution to the problem of feature

A contribution to the problem of feature selection with similarity functionals in pattern recognition

✍ E. Rasek 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 297 KB

Extremal problems in the class of functi

Extremal problems in the class of functions with bounded boundary rotation of complex order

✍ E. G. Goluzina 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 169 KB