Skip to main content
SpringerLink
Log in

Methods for solving some optimization problems in the theory of recognition by precedents

  • Mathematical Method in Pattern Recognition
  • Published:
Pattern Recognition and Image Analysis Aims and scope Submit manuscript

Abstract

A number of optimization problems arise when constructing various models of precedent-based recognition algorithms. One of them is the search for the maximum consistent subsystem from a given system of linear inequalities. Various approaches are proposed to solve this problem. Methods of its solution based on examining the set of nodal subsystems of a given system are developed. This may be either a complete item-by-item examination that gives an exact solution or a partial directed search that finds an approximate solution. In addition, an approximate method for solving this problem is proposed that is essentially different from the above-mentioned methods. This method is based on a number of geometric considerations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. N. Chernikov, Linear Inequalities (Nauka, Moscow, 1968) [in Russian].

    Google Scholar 

  2. N. N. Katerinochkina, “Decision methods for some discrete extreme problems in recognition theory,” Pattern Recogn. Image Anal. 18(4), 584–587 (2008).

    Article  Google Scholar 

  3. N. N. Katerinochkina, “On some optimization problem for systems of linear inequalities,” Pattern Recogn. Image Anal. 20(4), 447–450 (2010).

    Article  Google Scholar 

  4. I. I. Eremin, Linear Optimization and Linear Inequality Sets (Akademiya, Moscow, 2007) [in Russian].

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dorodnicyn Computing Centre, Russian Academy of Sciences, Vavilov st. 40, Moscow, 119333, Russia

    N. N. Katerinochkina

Authors
  1. N. N. Katerinochkina
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to N. N. Katerinochkina.

Additional information

This paper uses the materials of the report submitted at the 11th International Conference “Pattern Recognition and Image Analysis: New Information Technologies,” Samara, The Russian Federation, September 23–28, 2013.

Natalia Nikolaevna Katerinochkina. Born 1945. Graduated from the Faculty of Mechanics and Mathematics, Moscow State University, in 1967. Received candidate’s degree in physics and mathematics in 1978. Senior researcher at the Dorodnitsyn Computing Centre, Russian Academy of Sciences. Scientific interests: discrete mathematics, discrete optimization, recognition theory, data analysis. Author of 42 publications.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Katerinochkina, N.N. Methods for solving some optimization problems in the theory of recognition by precedents. Pattern Recognit. Image Anal. 24, 473–477 (2014). https://doi.org/10.1134/S1054661814040075

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1054661814040075

Keywords

Search

Navigation