Skip to main content
SpringerLink
Log in

Some approaches to the solution of optimization problems in supervised learning

  • Published:
Computational Mathematics and Mathematical Physics Aims and scope Submit manuscript

Abstract

There are some optimization problems that arise when highly accurate recognition algorithms are developed. One of them is to determine an optimal feasible (consistent) subsystem in a given system of linear inequalities. The optimality is defined by a number of constraints imposed on the subsystem, which can vary. Various approaches to the solution of this problem are proposed. Solution methods based on the search through the set of nodal subsystems of the given system of linear inequalities are developed. This can be exhaustive search or partial guided search that finds an approximate solution. A drastically different approximate method based on geometric considerations is proposed.

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. N. Chakravarti, “Some Results Concerning Post-Infeasibility Analysis,” J. Oper. Res. 73, 139–143 (1994).

    Article  MATH  Google Scholar 

  2. S. N. Chernikov, Lineinye neravenstva (Nauka, Moscow, 1968) [in Russian].

    Google Scholar 

  3. M. Parker and J. Ryan, “Finding the minimum weight IIS cover of an infeasible system of linear inequalities,” Ann. Math. Artif. Intell. 17 (1–2), 107–126 (1996).

    Article  MathSciNet  MATH  Google Scholar 

  4. E. Amaldi and R. Hauser, “Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem,” Tech. Report No. 2001-90, Politecnico di Milano, 2001.

    Google Scholar 

  5. J. W. Chinneck, “An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem,” Ann. Math. Artif. Intell. 17 (1–2), 127–144 (1996).

    Article  MathSciNet  MATH  Google Scholar 

  6. M. E. Pfetsch, “The maximum feasible subsystem problem and vertex-facet incidences of polyhedra,” PhD thesis, Dep. of Mathematics, Technische Universitat Berlin, October (2002).

    MATH  Google Scholar 

  7. I. I. Eremin, Linear Optimization and Systems of Linear Inequalities (Akademiya, Moscow, 2007) [in Russian].

    MATH  Google Scholar 

  8. N. N. Katerinochkina, “Finding a maximum feasible subsystem in a system of linear inequalities” in Communications on Applied Mathematics (Vychisl. Tsentr, Ross. Akad. Nauk, Moscow, 1997) [in Russian].

    Google Scholar 

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

    Article  Google Scholar 

  10. N. N. Katerinochkina and A. S. Shmakov, “Parallel implementation of an algorithm of finding an optimal feasible subsystem in a system of linear inequalities” in Proc. of the 13th All-Russia Conf. on Mathematical Methods in Pattern Recognition (MAKS Press, Moscow, 2007), pp. 257–261 [in Russian].

    Google Scholar 

  11. N. N. Katerinochkina, “Decision methods for some optimization problems in recognition theory,” Pattern Recognit. Image Anal. 19 (3), 441–446 (2009).

    Article  Google Scholar 

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dorodnicyn Computing Center, Russian Academy of Sciences, ul. Vavilova 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

Original Russian Text © N.N. Katerinochkina, 2015, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2015, Vol. 55, No. 11, pp. 1959–1966.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Katerinochkina, N.N. Some approaches to the solution of optimization problems in supervised learning. Comput. Math. and Math. Phys. 55, 1933–1939 (2015). https://doi.org/10.1134/S0965542515110081

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation