Metrics of algebraic closures in pattern recognition problems with two nonoverlapping classes

DOI10.1134/S0965542508050138zbMATH Open1164.68386MaRDI QIDQ3545184FDOQ3545184

Authors: A. G. D'yakonov 

Publication date: 9 December 2008

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

Recommendations

• The construction of a recognition algorithm in the algebraic closure.
• Correct algebras over estimation algorithms in the set of regular recognition problems with nonoverlapping classes
• On the completeness of the algebraic closure of the space of recognition operators with test support sets
• An algebra over estimation algorithms: the minimal power of the correct algorithm
• Theory of equivalence systems for describing the algebraic closures of a generalized estimation model

zbMATH Keywords

pattern recognitionGram matrixcorrect algorithmmatrices of evaluations

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Cited In (6)

• On metric properties of spaces in classification problems
• Correct algebras over estimation algorithms in the set of regular recognition problems with nonoverlapping classes
• On the completeness of the algebraic closure of the space of recognition operators with test support sets
• On metric properties of spaces in classification problems
• A unified approach to pattern recognition
• Title not available (Why is that?)

This page was built for publication: Metrics of algebraic closures in pattern recognition problems with two nonoverlapping classes

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