{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:50:17Z","timestamp":1743058217909,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319130743"},{"type":"electronic","value":"9783319130750"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13075-0_24","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T16:37:06Z","timestamp":1415983026000},"page":"298-309","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Co-Clustering Under the Maximum Norm"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Bulteau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Froese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sepp","family":"Hartung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,8]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"597","DOI":"10.4086\/toc.2012.v008a026","volume":"8","author":"A Anagnostopoulos","year":"2012","unstructured":"Anagnostopoulos, A., Dasgupta, A., Kumar, R.: A constant-factor approximation algorithm for co-clustering. Theory of Computing 8, 597\u2013622 (2012)","journal-title":"Theory of Computing"},{"issue":"3","key":"24_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inform. Process. Lett. 8(3), 121\u2013123 (1979)","journal-title":"Inform. Process. Lett."},{"key":"24_CR3","first-page":"1919","volume":"8","author":"A Banerjee","year":"2007","unstructured":"Banerjee, A., Dhillon, I.S., Ghosh, J., Merugu, S., Modha, D.S.: A generalized maximum entropy approach to Bregman co-clustering and matrix approximation. J. Mach. Learn. Res. 8, 1919\u20131986 (2007)","journal-title":"J. Mach. Learn. Res."},{"key":"24_CR4","unstructured":"Califano, C., Stolovitzky, G., Tu, Y.: Analysis of Gene Expression Microarrays for Phenotype Classification. In: Proc. Eighth ISMB, pp. 75-85. AAAI (2000)"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-69115-4_74","volume-title":"Rough Sets and Current Trends in Computing","author":"BS Chlebus","year":"1998","unstructured":"Chlebus, B.S., Nguyen, S.H.: On finding optimal discretizations for two attributes. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS (LNAI), vol. 1424, pp. 537\u2013544. Springer, Heidelberg (1998)"},{"issue":"3","key":"24_CR6","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"RJ Fowler","year":"1981","unstructured":"Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Inform. Process. Lett. 12(3), 133\u2013137 (1981)","journal-title":"Inform. Process. Lett."},{"key":"24_CR7","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company (1979)"},{"issue":"337","key":"24_CR8","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1080\/01621459.1972.10481214","volume":"67","author":"JA Hartigan","year":"1972","unstructured":"Hartigan, J.A.: Direct clustering of a data matrix. J. Amer. Stat. Assoc. 67(337), 123\u2013129 (1972)","journal-title":"J. Amer. Stat. Assoc."},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-642-04414-4_30","volume-title":"Algorithmic Learning Theory","author":"S Jegelka","year":"2009","unstructured":"Jegelka, S., Sra, S., Banerjee, A.: Approximation algorithms for tensor clustering. In: Gavald\u00e0, R., Lugosi, G., Zeugmann, T., Zilles, S. (eds.) ALT 2009. LNCS, vol. 5809, pp. 368\u2013383. Springer, Heidelberg (2009)"},{"issue":"1","key":"24_CR10","first-page":"24","volume":"1","author":"SC Madeira","year":"2004","unstructured":"Madeira, S.C., Oliveira, A.L.: Biclustering algorithms for biological data analysis: A survey. IEEE\/ACM TCBB 1(1), 24\u201345 (2004)","journal-title":"IEEE\/ACM TCBB"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13075-0_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T10:21:10Z","timestamp":1675246870000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13075-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319130743","9783319130750"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13075-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"8 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}