Mining for Empty Rectangles in Large Data Sets.

@inproceedings{DBLP:conf/icdt/EdmondsGLM01,
  author    = {Jeff Edmonds and
               Jarek Gryz and
               Dongming Liang and
               Ren{\'e}e J. Miller},
  editor    = {Jan Van den Bussche and
               Victor Vianu},
  title     = {Mining for Empty Rectangles in Large Data Sets},
  booktitle = {Database Theory - ICDT 2001, 8th International Conference, London,
               UK, January 4-6, 2001, Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1973},
  year      = {2001},
  isbn      = {3-540-41456-8},
  pages     = {174-188},
  ee        = {db/conf/icdt/EdmondsGLM01.html, http://link.springer.de/link/service/series/0558/bibs/1973/19730174.htm},
  crossref  = {DBLP:conf/icdt/2001},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Online Edition: Springer LINK

References

[1]

Rakesh Agrawal, Tomasz Imielinski, Arun N. Swami: Mining Association Rules between Sets of Items in Large Databases. SIGMOD Conference 1993: 207-216 BibTeX

[2]

...

[3]

Daniel Barbará, William DuMouchel, Christos Faloutsos, Peter J. Haas, Joseph M. Hellerstein, Yannis E. Ioannidis, H. V. Jagadish, Theodore Johnson, Raymond T. Ng, Viswanath Poosala, Kenneth A. Ross, Kenneth C. Sevcik: The New Jersey Data Reduction Report. IEEE Data Eng. Bull. 20(4): 3-45(1997) BibTeX

[4]

Bernard Chazelle, Robert L. (Scot) Drysdale III, D. T. Lee: Computing the Largest Empty Rectangle. SIAM J. Comput. 15(1): 300-315(1986) BibTeX

[5]

Qi Cheng, Jarek Gryz, Fred Koo, T. Y. Cliff Leung, Linqi Liu, Xiaoyan Qian, K. Bernhard Schiefer: Implementation of Two Semantic Query Optimization Techniques in DB2 Universal Database. VLDB 1999: 687-698 BibTeX

[6]

...

[7]

M. R. Garey, David S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman 1979, ISBN 0-7167-1044-7
BibTeX

[8]

H. V. Jagadish, J. Madar, Raymond T. Ng: Semantic Compression and Pattern Extraction with Fascicles. VLDB 1999: 186-198 BibTeX

[9]

Bing Liu, Ke Wang, Lai-Fun Mun, Xin-Zhi Qi: Using Decision Tree Induction for Discovering Holes in Data. PRICAI 1998: 182-193 BibTeX

[10]

Bing Liu, Liang-Ping Ku, Wynne Hsu: Discovering Interesting Holes in Data. IJCAI (2) 1997: 930-935 BibTeX

[11]

Renée J. Miller, Yuping Yang: Association Rules over Interval Data. SIGMOD Conference 1997: 452-461 BibTeX

[12]

...

[13]

M. Orlowski: A New Algorithm for the Largest Empty Rectangle Problem. Algorithmica 5(1): 65-73(1990) BibTeX

[14]

Tian Zhang, Raghu Ramakrishnan, Miron Livny: BIRCH: An Efficient Data Clustering Method for Very Large Databases. SIGMOD Conference 1996: 103-114 BibTeX