Greedy algorithms for construction of approximate tests for decision tables with many-valued decisions (Q4902317)
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 6125408
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Greedy algorithms for construction of approximate tests for decision tables with many-valued decisions |
scientific article; zbMATH DE number 6125408 |
Statements
Greedy Algorithms for Construction of Approximate Tests for Decision Tables with Many-Valued Decisions (English)
0 references
14 January 2013
0 references
decision table with many-valued decisions
0 references
test
0 references
reduct
0 references
greedy algorithm
0 references
set cover problem
0 references
0.923180341720581
0 references
0.8571654558181763
0 references
0.8515939712524414
0 references
0.8000333309173584
0 references
0.7954742908477783
0 references
