Conjugacy in pattern recognition and choice problems

MaRDI QIDQ2724055zbMATH OpenFDO

Authors Vl. D. Mazurov

Publication date 8 July 2001

Published in YUJOR. Yugoslav Journal of Operations Research (Search for Journal in Brave)

zbMATH Keywords

choiceconjugacydiagnosticsdualitypattern recognitionstability

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Decision theory (91B06) Linguistics (91F20)

Review text

General approaches (immersional, existential and logical) to the construction of conjugate (dual) problems of decision making and mathematical diagnostics are considered. Two of the approaches are related to hereditary existence (of solutions and generalized solutions to choice and diagnostics problems) and to sequence conditions (which provide that some inequalities are consequences of the system of some other inequalities). The paper presents a short review of models of conjugate problems of an effective choice of decision variants and their diagnosis in operations research. New models of pattern recognition and decision making problems are also given. The models considered (all based on conjugacy) include: discrimination of sets defined parametrically (contraction method can be used for finding committee solutions of the discriminant analysis problems), committees in nonformalized problems, separation of infinite sets, choice of feature space, conjugate problems in taxonomy, descriptions of complex systems, ambiguous interpretation of contradictory information. Appropriate numerical examples are provided. It is concluded that conjugacy in pattern recognition can help (similarly as in mathematical programming) to estimate the stability of solutions to choice and diagnosing problems and of corresponding decision rules, as well as to resolve the contradictions in the observed data and in the corresponding mathematical models.

Recommendations

• scientific article; zbMATH DE number 1482912
• scientific article; zbMATH DE number 1390430
• scientific article; zbMATH DE number 1380323
• Algorithm for choosing conjunctions for logical recognition methods
• scientific article; zbMATH DE number 617971

Cited in

(7)

• Solving of optimization and identification problems by the committee methods
• Finite groups whose irreducible characters vanish on at most three conjugacy classes
• Calculating the set of orders of elements in the finite linear groups
• The number of composite numbers in the set of element ordes of a finite group
• scientific article; zbMATH DE number 1482912 (Why is no real title available?)
• Recognition by spectrum of simple groups \(C_p(2)\).
• Groups with complete prime graph connected components

This page was built for publication: Conjugacy in pattern recognition and choice problems

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