Irredundant test for binary tables (Q1974747)
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 1440462
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Irredundant test for binary tables |
scientific article; zbMATH DE number 1440462 |
Statements
Irredundant test for binary tables (English)
0 references
19 June 2000
0 references
The author describes an algorithm designed for constructing all irredundant tests for an arbitrary table. The irredundant test is an incompressible set of features retaining all information concerning the division of a table into classes. As a rule, there are numerous such irredundant sets of features, and they are extremely difficult to construct. The algorithm described in the present paper is particularly efficient when the number of columns exceeds the number of rows.
0 references
irredundant tests
0 references
pattern recognition
0 references
test
0 references
algorithm
0 references
0.9765779972076416
0 references
0.7802978754043579
0 references
0.7570400238037109
0 references
