The Algorithm That Maximizes the Accuracy of <i>k</i>-Classification on the Set of Representatives of the <i>k</i> Equivalence Classes
The article formulates the Dictionary Recognition problem, which is relevant for a wide range of applied problems: word recognition in a noisy audio signal for natural language processing tasks or in a noisy electromagnetic signal, recognition of visual patterns in limited visibility, and much more....
Main Author: | Alexandra Bernadotte |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-08-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/10/15/2810 |
Similar Items
-
Clique roots of K4-free chordal graphs
by: Hossein Teimoori Faal
Published: (2019-04-01) -
Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs
by: Chuan-Min Lee
Published: (2021-01-01) -
On clique convergence of graphs
by: S.M. Hegde, et al.
Published: (2016-12-01) -
On a k-clique-join of a class of partitionable graphs
by: Mihai Talmaciu
Published: (2005-05-01) -
Computing the Atom Graph of a Graph and the Union Join Graph of a Hypergraph
by: Anne Berry, et al.
Published: (2021-11-01)