{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:28:56Z","timestamp":1725488936816},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414568"},{"type":"electronic","value":"9783540445036"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44503-x_12","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T04:25:32Z","timestamp":1186892732000},"page":"174-188","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Mining for Empty Rectangles in Large Data Sets"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2001,10,12]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinksi, and A. Swami. Mining Association Rules between Sets of Items in Large Databases. ACM SIGMOD, 22(2), June 1993.","DOI":"10.1145\/170036.170072"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"M. J. Atallah and Fredrickson G. N. A note on finding a maximum empty rectangle. Discrete Applied Mathematics, (13):87\u201391, 1986.","DOI":"10.1016\/0166-218X(86)90071-5"},{"issue":"4","key":"12_CR3","first-page":"3","volume":"20","author":"D. Barbar\u00e1","year":"1997","unstructured":"D. Barbar\u00e1, W. DuMouchel, C. Faloutsos, P. J. Haas, J. M. Hellerstein, Y. E. Ioannidis, H. V. Jagadish, T. Johnson, R. T. Ng, V. Poosala, K. A. Ross, and K. C. Sevcik. The New Jersey Data Reduction Report. Data Engineering Bulletin, 20(4):3\u201345, 1997.","journal-title":"Data Engineering Bulletin"},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1137\/0215022","volume":"15","author":"B. Chazelle","year":"1986","unstructured":"Bernard Chazelle, Robert L. (Scot) Drysdale III, and D. T. Lee. Computing the largest empty rectangle. SIAM J. Comput., 15(1):550\u2013555, 1986.","journal-title":"SIAM J. Comput."},{"key":"12_CR5","unstructured":"Q. Cheng, J. Gryz, F. Koo, C. Leung, L. Liu, X. Qian, and B. Schiefer. Implementation of two semantic query optimization techniques in DB2 universal database. In Proceedings of the 25th VLDB, pages 687\u2013698, Edinburgh, Scotland, 1999."},{"key":"12_CR6","unstructured":"J. Edmonds, J. Gryz, D. Liang, and R. J. Miller. Mining for Empty Rectangles in Large Data Sets (Extended Version). Technical Report CSRG-410, Department of Computer Science, University of Toronto, 2000."},{"key":"12_CR7","volume-title":"Computers and Intractability","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability. W. H. Freeman and Co., New York, 1979."},{"key":"12_CR8","unstructured":"H. V. Jagadish, J. Madar, and R. T. Ng. Semantic Compression and Pattern Extraction with Fascicles. In Proc. of VLDB, pages 186\u2013197, 1999."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"B. Liu, K. Wang, L.-F. Mun, and X.-Z. Qi. Using Decision Tree Induction for Discovering Holes in Data. In 5th Pacific Rim International Conference on Artificial Intelligence, pages 182\u2013193, 1998.","DOI":"10.1007\/BFb0095268"},{"key":"12_CR10","unstructured":"Bing Liu, Liang-Ping Ku, and Wynne Hsu. Discovering interesting holes in data. In Proceedings of IJCAI, pages 930\u2013935, Nagoya, Japan, 1997. Morgan Kaufmann."},{"issue":"2","key":"12_CR11","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1145\/253262.253361","volume":"26","author":"R. J. Miller","year":"1997","unstructured":"R. J. Miller and Y. Yang. Association Rules over Interval Data. ACM SIGMOD, 26(2):452\u2013461, May 1997.","journal-title":"ACM SIGMOD"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"A. Namaad, W. L. Hsu, and D. T. Lee. On the maximum empty rectangle problem. Applied Discrete Mathematics, (8):267\u2013277, 1984.","DOI":"10.1016\/0166-218X(84)90124-0"},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01840377","volume":"5","author":"M. Orlowski","year":"1990","unstructured":"M. Orlowski. A New Algorithm for the Largest Empty Rectangle Problem. Algorithmica, 5(1):65\u201373, 1990.","journal-title":"Algorithmica"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: An Efficient Data Clustering Method for Very Large Databases. ACM SIGMOD, 25(2), June 1996.","DOI":"10.1145\/235968.233324"}],"container-title":["Lecture Notes in Computer Science","Database Theory \u2014 ICDT 2001"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44503-X_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:17:47Z","timestamp":1558275467000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44503-X_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540414568","9783540445036"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44503-x_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"12 October 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}