Mining for empty spaces in large data sets.

DOI10.1016/S0304-3975(02)00738-7zbMath1045.68041OpenAlexW2029626238MaRDI QIDQ1401282

Dongming Liang, Jarek Gryz, Renée J. Miller, Jeff Edmonds

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00738-7

zbMATH Keywords

data miningquery optimization

Mathematics Subject Classification ID

Database theory (68P15) Data structures (68P05)

Related Items (9)

Fast algorithms for finding disjoint subsequences with extremal densities ⋮ A data mining approach for visual and analytical identification of neurorehabilitation ranges in traumatic brain injury cognitive rehabilitation ⋮ Variations of largest rectangle recognition amidst a bichromatic point set ⋮ On the largest empty axis-parallel box amidst \(n\) points ⋮ An Upper Bound of the Minimal Dispersion via Delta Covers ⋮ On the number of maximum empty boxes amidst \(n\) points ⋮ Drawing borders efficiently ⋮ Maximal Empty Boxes Amidst Random Points ⋮ Maximal strips data structure to represent free space on partially reconfigurable FPGAs

Cites Work

• Unnamed Item
• Unnamed Item
• A new algorithm for the largest empty rectangle problem
• On the maximum empty rectangle problem
• A note on finding a maximum empty rectangle
• Computing the Largest Empty Rectangle

This page was built for publication: Mining for empty spaces in large data sets.