Average distance recognition algorithm based on interconnection

MaRDI QIDQ2743022zbMATH OpenFDO

Authors S. S. Jumanazarov

Publication date 24 September 2001

Published in Voprosy Vychislitel'noĭ i Prikladnoĭ Matematiki (Search for Journal in Brave)

zbMATH Keywords

algorithmdistancefeatureinterconnectionpattern recognitionstructured data

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Nonnumerical algorithms (68W05) Algebraic methods (93B25)

Review text

One of the pattern recognition models for compound-structured data -- the model of recognition algorithms of average distance type is considered. These recognition algorithms are based on the interconnection between the features. Correctness of the considered recognition algorithms within the framework of algebraic closure is investigated.

Recommendations

• scientific article; zbMATH DE number 1530184
• Pattern recognition algorithms' models based on potential principles
• scientific article; zbMATH DE number 4074530
• A problem of pattern recognition in arrays of interrelated objects. Recognition algorithm
• scientific article; zbMATH DE number 937820

Cited in

(2)

• scientific article; zbMATH DE number 18399 (Why is no real title available?)
• scientific article; zbMATH DE number 1530184 (Why is no real title available?)

This page was built for publication: Average distance recognition algorithm based on interconnection

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