Algebraic methods for solving recognition problems with non-crossing classes

Algebraic methods for solving recognition problems with non-crossing classes

In this paper, we propose to consider various models of pattern recognition. At the same time, it is proposed to consider models in the form of two operators: a recognizing operator and a decision rule. Algebraic operations are introduced on recognizing operators, and based on the application of the...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Kabulov, Anvar, Babadzhanov, Alimdzhan, Saymanov, Islambek
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Computer Vision and Pattern Recognition
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Kabulov, Anvar
Babadzhanov, Alimdzhan
Saymanov, Islambek
description In this paper, we propose to consider various models of pattern recognition. At the same time, it is proposed to consider models in the form of two operators: a recognizing operator and a decision rule. Algebraic operations are introduced on recognizing operators, and based on the application of these operators, a family of recognizing algorithms is created. An upper estimate is constructed for the model, which guarantees the completeness of the extension.
doi_str_mv 10.48550/arxiv.2401.13666
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2401_13666</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2401_13666</sourcerecordid><originalsourceid>FETCH-LOGICAL-a676-92021e6dc893fbc569f71653ab67d81f63081935f25e96dba4bf530abb5545793</originalsourceid><addsrcrecordid>eNotz7FuwyAUhWGWDlXaB-gUXsAuGN9rM0ZR01ay1CW7BRgcJAwRWGnz9lXSTmf5daSPkBfO6rYHYK8q__hL3bSM11wg4iMZdmG2Oitv6GLXU5oKdSnTksLFx5lma9Ic_epTpOecdLBLod9-PdGYYmVyKuWWmaBKseWJPDgVin3-3w05Ht6O-49q-Hr_3O-GSmGHlWxYwy1OppfCaQMoXccRhNLYTT13KFjPpQDXgJU4adVqB4IprQFa6KTYkO3f7Z0znrNfVL6ON9Z4Z4lfc3FInA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Algebraic methods for solving recognition problems with non-crossing classes</title><source>arXiv.org</source><creator>Kabulov, Anvar ; Babadzhanov, Alimdzhan ; Saymanov, Islambek</creator><creatorcontrib>Kabulov, Anvar ; Babadzhanov, Alimdzhan ; Saymanov, Islambek</creatorcontrib><description>In this paper, we propose to consider various models of pattern recognition. At the same time, it is proposed to consider models in the form of two operators: a recognizing operator and a decision rule. Algebraic operations are introduced on recognizing operators, and based on the application of these operators, a family of recognizing algorithms is created. An upper estimate is constructed for the model, which guarantees the completeness of the extension.</description><identifier>DOI: 10.48550/arxiv.2401.13666</identifier><language>eng</language><subject>Computer Science - Computer Vision and Pattern Recognition</subject><creationdate>2024-01</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2401.13666$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2401.13666$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Kabulov, Anvar</creatorcontrib><creatorcontrib>Babadzhanov, Alimdzhan</creatorcontrib><creatorcontrib>Saymanov, Islambek</creatorcontrib><title>Algebraic methods for solving recognition problems with non-crossing classes</title><description>In this paper, we propose to consider various models of pattern recognition. At the same time, it is proposed to consider models in the form of two operators: a recognizing operator and a decision rule. Algebraic operations are introduced on recognizing operators, and based on the application of these operators, a family of recognizing algorithms is created. An upper estimate is constructed for the model, which guarantees the completeness of the extension.</description><subject>Computer Science - Computer Vision and Pattern Recognition</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz7FuwyAUhWGWDlXaB-gUXsAuGN9rM0ZR01ay1CW7BRgcJAwRWGnz9lXSTmf5daSPkBfO6rYHYK8q__hL3bSM11wg4iMZdmG2Oitv6GLXU5oKdSnTksLFx5lma9Ic_epTpOecdLBLod9-PdGYYmVyKuWWmaBKseWJPDgVin3-3w05Ht6O-49q-Hr_3O-GSmGHlWxYwy1OppfCaQMoXccRhNLYTT13KFjPpQDXgJU4adVqB4IprQFa6KTYkO3f7Z0znrNfVL6ON9Z4Z4lfc3FInA</recordid><startdate>20240124</startdate><enddate>20240124</enddate><creator>Kabulov, Anvar</creator><creator>Babadzhanov, Alimdzhan</creator><creator>Saymanov, Islambek</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20240124</creationdate><title>Algebraic methods for solving recognition problems with non-crossing classes</title><author>Kabulov, Anvar ; Babadzhanov, Alimdzhan ; Saymanov, Islambek</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a676-92021e6dc893fbc569f71653ab67d81f63081935f25e96dba4bf530abb5545793</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Computer Science - Computer Vision and Pattern Recognition</topic><toplevel>online_resources</toplevel><creatorcontrib>Kabulov, Anvar</creatorcontrib><creatorcontrib>Babadzhanov, Alimdzhan</creatorcontrib><creatorcontrib>Saymanov, Islambek</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Kabulov, Anvar</au><au>Babadzhanov, Alimdzhan</au><au>Saymanov, Islambek</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Algebraic methods for solving recognition problems with non-crossing classes</atitle><date>2024-01-24</date><risdate>2024</risdate><abstract>In this paper, we propose to consider various models of pattern recognition. At the same time, it is proposed to consider models in the form of two operators: a recognizing operator and a decision rule. Algebraic operations are introduced on recognizing operators, and based on the application of these operators, a family of recognizing algorithms is created. An upper estimate is constructed for the model, which guarantees the completeness of the extension.</abstract><doi>10.48550/arxiv.2401.13666</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2401.13666
ispartof
issn
language eng
recordid cdi_arxiv_primary_2401_13666
source arXiv.org
subjects Computer Science - Computer Vision and Pattern Recognition
title Algebraic methods for solving recognition problems with non-crossing classes
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T08%3A25%3A43IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Algebraic%20methods%20for%20solving%20recognition%20problems%20with%20non-crossing%20classes&rft.au=Kabulov,%20Anvar&rft.date=2024-01-24&rft_id=info:doi/10.48550/arxiv.2401.13666&rft_dat=%3Carxiv_GOX%3E2401_13666%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true