Mining for empty spaces in large data sets-Reference-Cited by-同舟云学术

Mining for empty spaces in large data sets

Published:2003-03 Issue:3 Volume:296 Page:435-452
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

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

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference14 articles.

1. Mining association rules between sets of items in large databases;Agrawal;ACM SIGMOD,1993

2. M.J. Atallah, G.N. Fredrickson, A note on finding a maximum empty rectangle, Discrete Appl. Math. (13) (1986) 87–91.

3. The New Jersey Data Reduction Report;Barabará;Data Eng. Bull.,1997

4. Computing the largest empty rectangle;Chazelle;SIAM J. Comput.,1986

5. Q. Cheng, J. Gryz, F. Koo, C. Leung, L. Liu, X. Qian, B. Schiefer, Implementation of two semantic query optimization techniques in DB2 universal database, in: Proc. 25th VLDB, Edinburgh, Scotland, 1999, pp. 687–698.

Cited by 40 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Representation Bias in Data: A Survey on Identification and Resolution Techniques;ACM Computing Surveys;2023-07-13

2. On the maximum empty hyper-rectangle problem;Journal of Algorithms & Computational Technology;2023-01

3. Separating Bichromatic Polylines by Fixed-angle Minimal Triangles;Scientia Iranica;2022-04-26

4. Geometric Heuristics for Transfer Learning in Decision Trees;Proceedings of the 30th ACM International Conference on Information & Knowledge Management;2021-10-26

5. Variations of largest rectangle recognition amidst a bichromatic point set;Discrete Applied Mathematics;2020-11