Symmetric constraints in classification problems that permit replacement by functional constraints

DOI10.1007/BF01130091MaRDI QIDQ1333698zbMATH OpenFDO

Authors Denis Zorin

Publication date 5 October 1994

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

recognition algorithmssymmetric universal constraints

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10)

Recommendations

• Predicate description of universal constraints in the algebraic approach to pattern recognition problems
• Application of universal constraints in the analysis of classification algorithms
• Completeness criteria for classification problems with set-theoretical constraints
• scientific article; zbMATH DE number 4033129
• scientific article; zbMATH DE number 2099743

Cites work

• scientific article; zbMATH DE number 3854298 (Why is no real title available?)
• scientific article; zbMATH DE number 3534286 (Why is no real title available?)
• An orthogonal descent algorithm to find the zero of a convex function, unsolvability test, and rate of convergence

Cited in

(3)

• scientific article; zbMATH DE number 4033129 (Why is no real title available?)
• Application of universal constraints in the analysis of classification algorithms
• Predicate description of universal constraints in the algebraic approach to pattern recognition problems

This page was built for publication: Symmetric constraints in classification problems that permit replacement by functional constraints

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