Construction of recognition algorithms correct for a given control sample

Practical algorithms for precedent-based recognition are considered that are based on the logical or algebraic correction of various heuristic algorithms or m odels of recognition. The recognition problem is solved in two stages. First, algorithms from a certain group are independently applied to recognition of an arbitrary object, and then an appropriate corrector is used to calculate the final collective solution. General concepts of the algebraic approach, descriptions of practical algorithms for logical and algebraic correction, and the results of comparison of these algorithms are presented.

show abstract

“…We we solve the problem of finding an algebraic corrector 7", i.e., A, f = of the form (9) among a few strongly correlated ones.…”

Section: Construction Of a Second-degree Algebraic Corrector For A Given Collection Of Algorithmsmentioning

confidence: 99%

Algorithms for algebraic and logical correction and their applications

Zhuravlev

Абламейко

Biryukov

et al. 2010

Pattern Recognit. Image Anal.

View full text Add to dashboard Cite

show abstract

“…But there are other areas of research in this area, for example [25], [26]. Another approach using the cluster concept, based on Zhuravlev's approach to classification [27]- [30], was proposed in [31]- [34] and is associated with the construction of a special algebra over cluster algorithms. Then the main problem reduces to the solvability of the special operator equation.…”

Section: Introductionmentioning

confidence: 99%

Random access memory page caching: a strategy for enhancing shared virtual memory multicomputer systems performance

Vyazigin,

Mansurova,

Malyshkin

et al. 2024

IJEECS

View full text Add to dashboard Cite

This study examines a modified approach to optimizing the performance of support vector machine (SVM)-type multicomputer systems through a distinct type of caching method that allocates space in the random access memory (RAM) of a computing node for caching pages. The article extensively describes research on enhancing the performance of the SVM system through memory page caching in RAM at the hardware level by implementing the SVM system based on field-programmable gate arrays (FPGA). A systematic comparative evaluation highlights a discernible enhancement in system performance relative to systems not equipped with the revised caching algorithm. These findings could prove instrumental for subsequent studies focused on optimizing the performance of SVM systems, providing empirical data to inform future investigations and potential applications in multicomputer system performance enhancement.

show abstract

“…The need for preliminary estimation of the number of modes in Gaussian mixtures is dictated by their wide application in various fields of science and practice, including simulation, pattern recognition, spectroscopy, meteorology, and sea fishery [1][2][3][4]. In this study, several theorems on the sufficient unimodality conditions of a mixture of k normal distributions with the same variance σ 2 and with different mean values µ i , i = 1, …, k , 2 ≤ k < ∞ , taken with their a priori probabilities π i , are formulated on the basis of the principle of contracting mappings.…”

Section: Introductionmentioning

confidence: 99%

Bounds for the number of modes of the simplest Gaussian mixture

Aprausheva

Mollaverdi

Sorokin

2006

Pattern Recognit. Image Anal.

View full text Add to dashboard Cite

-Several theorems on sufficient unimodality conditions are formulated for a sum of k normal distributions with the same variance and with different mean values µ i , i = 1, …, k , 2 ≤ k < ∞ , taken with their a priori probabilities π i . On the basis of these theorems, estimates for the lower and upper bounds for the mode numbers m are obtained for k ≥ 3 in the case when the mixture contains k * components, 2 ≤ k * < k , satisfying the unimodality conditions.

show abstract

Construction of recognition algorithms correct for a given control sample

Cited by 12 publications

References 0 publications

Algorithms for algebraic and logical correction and their applications

Algorithms for algebraic and logical correction and their applications

Random access memory page caching: a strategy for enhancing shared virtual memory multicomputer systems performance

Bounds for the number of modes of the simplest Gaussian mixture

Contact Info

Product

Resources

About