Mining for empty rectangles in large data sets
From MaRDI portal
Recommendations
Cited in
(7)- Mining for empty spaces in large data sets.
- Mining maximal frequent rectangles
- Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
- View disassembly: A rewrite that extracts portions of views
- Discovering and Exploiting Statistical Properties for Query Optimization in Relational Databases: A Survey
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
- Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
This page was built for publication: Mining for empty rectangles in large data sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473270)