{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:57Z","timestamp":1759063737322},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3827,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0304-3975(02)00738-7","type":"journal-article","created":{"date-parts":[[2003,3,4]],"date-time":"2003-03-04T17:20:43Z","timestamp":1046798443000},"page":"435-452","source":"Crossref","is-referenced-by-count":43,"title":["Mining for empty spaces in large data sets"],"prefix":"10.1016","volume":"296","author":[{"given":"Jeff","family":"Edmonds","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jarek","family":"Gryz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongming","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren\u00e9e J.","family":"Miller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0304-3975(02)00738-7_BIB1","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/170036.170072","article-title":"Mining association rules between sets of items in large databases","volume":"22","author":"Agrawal","year":"1993","journal-title":"ACM SIGMOD"},{"key":"10.1016\/S0304-3975(02)00738-7_BIB2","doi-asserted-by":"crossref","unstructured":"M.J. Atallah, G.N. Fredrickson, A note on finding a maximum empty rectangle, Discrete Appl. Math. (13) (1986) 87\u201391.","DOI":"10.1016\/0166-218X(86)90071-5"},{"issue":"4","key":"10.1016\/S0304-3975(02)00738-7_BIB3","first-page":"3","article-title":"The New Jersey Data Reduction Report","volume":"20","author":"Barabar\u00e1","year":"1997","journal-title":"Data Eng. Bull."},{"issue":"1","key":"10.1016\/S0304-3975(02)00738-7_BIB4","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1137\/0215022","article-title":"Computing the largest empty rectangle","volume":"15","author":"Chazelle","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(02)00738-7_BIB5","unstructured":"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\u2013698."},{"key":"10.1016\/S0304-3975(02)00738-7_BIB6","unstructured":"J. Edmonds, J. Gryz, D. Liang, R.J. Miller, Mining for empty rectangles in large data sets (extended version), Tech. Report CSRG-410, Department of Computer Science, University of Toronto, 2000."},{"key":"10.1016\/S0304-3975(02)00738-7_BIB7","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(02)00738-7_BIB8","unstructured":"H.V. Jagadish, J. Madar, R.T. Ng, Semantic compression and pattern extraction with fascicles, in: Proc. VLDB, Edinburgh, Scotland, 1999, pp. 186\u2013197."},{"key":"10.1016\/S0304-3975(02)00738-7_BIB9","series-title":"Proc. IJCAI, Nagoya, Japan","first-page":"930","article-title":"Discovering interesting holes in data","author":"Liu","year":"1997"},{"key":"10.1016\/S0304-3975(02)00738-7_BIB10","doi-asserted-by":"crossref","unstructured":"B. Liu, K. Wang, L.-F. Mun, X.-Z. Qi, Using decision tree induction for discovering holes in data, in: Proc. 5th Pacific Rim Internat. Conf. on Artificial Intelligence, 1998, pp. 182\u2013193.","DOI":"10.1007\/BFb0095268"},{"issue":"2","key":"10.1016\/S0304-3975(02)00738-7_BIB11","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1145\/253262.253361","article-title":"Association rules over interval data","volume":"26","author":"Miller","year":"1997","journal-title":"ACM SIGMOD"},{"key":"10.1016\/S0304-3975(02)00738-7_BIB12","doi-asserted-by":"crossref","unstructured":"A. Namaad, W.L. Hsu, D.T. Lee, On the maximum empty rectangle problem, Appl. Discrete Math. (8) (1984) 267\u2013277.","DOI":"10.1016\/0166-218X(84)90124-0"},{"key":"10.1016\/S0304-3975(02)00738-7_BIB13","doi-asserted-by":"crossref","unstructured":"M. Orlowski, A new algorithm for the largest empty rectangle problem, Algorithmica 5(1) (1990) 65\u201373, 103\u2013114.","DOI":"10.1007\/BF01840377"},{"issue":"2","key":"10.1016\/S0304-3975(02)00738-7_BIB14","doi-asserted-by":"crossref","DOI":"10.1145\/235968.233324","article-title":"BIRCH","volume":"25","author":"Zhang","year":"1996","journal-title":"ACM SIGMOD"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502007387?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502007387?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T08:11:17Z","timestamp":1584000677000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502007387"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0304397502007387"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00738-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}