RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskr. Mat., 2006, Volume 18, Issue 3, Pages 3–34 (Mi dm56)  

This article is cited in 3 scientific papers (total in 3 papers)

Test recognition theory

V. B. Kudryavtsev


Abstract: We describe the logic approach to pattern recognition; its key notion is a test. Analysing the tests allows us to construct functionals characterising the pattern, as well as procedures to compute them. We present qualitative and quantitative properties of tests, functionals, and recognition procedures. Solutions of a series of known problems are also given.

DOI: https://doi.org/10.4213/dm56

Full text: PDF file (2877 kB)
References: PDF file   HTML file

English version:
Discrete Mathematics and Applications, 2006, 16:4, 319–350

Bibliographic databases:

UDC: 519.2
Received: 21.04.2006

Citation: V. B. Kudryavtsev, “Test recognition theory”, Diskr. Mat., 18:3 (2006), 3–34; Discrete Math. Appl., 16:4 (2006), 319–350

Citation in format AMSBIB
\Bibitem{Kud06}
\by V.~B.~Kudryavtsev
\paper Test recognition theory
\jour Diskr. Mat.
\yr 2006
\vol 18
\issue 3
\pages 3--34
\mathnet{http://mi.mathnet.ru/dm56}
\crossref{https://doi.org/10.4213/dm56}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2289318}
\zmath{https://zbmath.org/?q=an:1121.68100}
\elib{https://elibrary.ru/item.asp?id=9311205}
\transl
\jour Discrete Math. Appl.
\yr 2006
\vol 16
\issue 4
\pages 319--350
\crossref{https://doi.org/10.1515/156939206778609723}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-33846854227}


Linking options:
  • http://mi.mathnet.ru/eng/dm56
  • https://doi.org/10.4213/dm56
  • http://mi.mathnet.ru/eng/dm/v18/i3/p3

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. Frolov A.B., “A finite topology principle in recognizing topological forms”, J. Comput. Syst. Sci. Int., 49:1 (2010), 65–72  crossref  mathscinet  zmath  isi  elib  elib  scopus
    2. Rodriguez-Diez V., Francisco Martinez-Trinidad J., Ariel Carrasco-Ochoa J., Lazo-Cortes M., Feregrino-Uribe C., Cumplido R., “a Fast Hardware Software Platform For Computing Irreducible Testors”, Expert Syst. Appl., 42:24 (2015), 9612–9619  crossref  isi  elib  scopus
    3. I. I. Lapikov, “O vozmozhnosti primeneniya metoda ellipsoidov dlya raspoznavaniya porogovykh funktsii”, PDM. Prilozhenie, 2017, no. 10, 163–165  mathnet  crossref
  • Дискретная математика
    Number of views:
    This page:683
    Full text:282
    References:54
    First page:19

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2021