On the completeness of the algebraic closure of the space of recognition operators with test support sets

DOI10.1016/0041-5553(84)90101-0MaRDI QIDQ3680307zbMATH OpenOpenAlexFDO

Authors A. G. Itskov, N. I. Kalyadin

Publication date 1984

Published in USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0041-5553(84)90101-0

zbMATH Keywords

classification problembinary featuressupporting setsalgebraic approach to pattern recognitionminimal tests of training tablesmodel of computing estimates

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Recommendations

• On the correctness of algebraic closures of recognition algorithms of the “tests” type
• The construction of a recognition algorithm in the algebraic closure.
• Metrics of algebraic closures in pattern recognition problems with two nonoverlapping classes
• Correctness of algebraic extensions of models of classification algorithms
• scientific article; zbMATH DE number 2101499

Cited in

(8)

• An algebraic approach in describing the method of target iterative classification
• The construction of a recognition algorithm in the algebraic closure.
• Correctness of algebraic extensions of models of classification algorithms
• Completeness criteria for a linear model of classification algorithms with respect to families of decision rules
• On the correctness of algebraic closures of recognition algorithms of the “tests” type
• scientific article; zbMATH DE number 2214272 (Why is no real title available?)
• The algebraic closure of a family of separated algorithms
• Metrics of algebraic closures in pattern recognition problems with two nonoverlapping classes

This page was built for publication: On the completeness of the algebraic closure of the space of recognition operators with test support sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3680307)