Mining for empty spaces in large data sets.

DOI10.1016/S0304-3975(02)00738-7zbMATH Open1045.68041OpenAlexW2029626238MaRDI QIDQ1401282FDOQ1401282

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

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

Recommendations

• scientific article; zbMATH DE number 2080472
• Largest empty rectangle among a point set
• Data Mining with optimized two-dimensional association rules
• scientific article; zbMATH DE number 1041844
• scientific article; zbMATH DE number 4033105

zbMATH Keywords

data miningquery optimization

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A note on finding a maximum empty rectangle
• Computing the Largest Empty Rectangle
• A new algorithm for the largest empty rectangle problem
• On the maximum empty rectangle problem
• Title not available (Why is that?)

Cited In (11)

• A data mining approach for visual and analytical identification of neurorehabilitation ranges in traumatic brain injury cognitive rehabilitation
• Title not available (Why is that?)
• Fast algorithms for finding disjoint subsequences with extremal densities
• On the number of maximum empty boxes amidst \(n\) points
• An upper bound of the minimal dispersion via delta covers
• Drawing borders efficiently
• Predicting relevant empty spots in social interaction
• On the largest empty axis-parallel box amidst \(n\) points
• Maximal strips data structure to represent free space on partially reconfigurable FPGAs
• Maximal empty boxes amidst random points
• Variations of largest rectangle recognition amidst a bichromatic point set

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401282)