An algorithm for constructing irredundant tests for binary tables (Q1571149)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for constructing irredundant tests for binary tables |
scientific article; zbMATH DE number 1472893
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for constructing irredundant tests for binary tables |
scientific article; zbMATH DE number 1472893 |
Statements
An algorithm for constructing irredundant tests for binary tables (English)
0 references
30 July 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 presented is particulary efficient when the number of rows exceeds the number of columns.
0 references
irredundant text
0 references
pattern recognition
0 references
algorithm
0 references
tables
0 references
0.9800045490264891
0 references
0.7557520866394043
0 references