Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864)
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 7433362
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficiently enumerating hitting sets of hypergraphs arising in data profiling |
scientific article; zbMATH DE number 7433362 |
Statements
Efficiently enumerating hitting sets of hypergraphs arising in data profiling (English)
0 references
25 November 2021
0 references
data profiling
0 references
enumeration algorithm
0 references
minimal hitting set
0 references
transversal hypergraph
0 references
unique column combination
0 references
W[3]-completeness
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9587188959121704
0 references
0.7978827953338623
0 references
0.7779437899589539
0 references
0.7661464214324951
0 references
0.7660802602767944
0 references
