Optimal set-partitioning based on group quality likelihood using partition-growing algorithm (Q2874033)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6251164
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal set-partitioning based on group quality likelihood using partition-growing algorithm |
scientific article; zbMATH DE number 6251164 |
Statements
28 January 2014
0 references
set partitioning
0 references
group quality
0 references
partition-growing algorithm
0 references
broken characters recognition
0 references
historical documents
0 references
0 references
0 references
Optimal set-partitioning based on group quality likelihood using partition-growing algorithm (English)
0 references
0.6836712956428528
0 references
0.6642411947250366
0 references
0.6628077626228333
0 references
