{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:37:09Z","timestamp":1750307829952,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,6,9]],"date-time":"2008-06-09T00:00:00Z","timestamp":1212969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,6,9]]},"DOI":"10.1145\/1376916.1376945","type":"proceedings-article","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T14:13:22Z","timestamp":1213107202000},"page":"201-210","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Approximation algorithms for co-clustering"],"prefix":"10.1145","author":[{"given":"Aris","family":"Anagnostopoulos","sequence":"first","affiliation":[{"name":"Yahoo! Research, Sunnyvale, CA, USA"}]},{"given":"Anirban","family":"Dasgupta","sequence":"additional","affiliation":[{"name":"Yahoo! Research, Sunnyvale, CA, USA"}]},{"given":"Ravi","family":"Kumar","sequence":"additional","affiliation":[{"name":"Yahoo! Research, Sunnyvale, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2008,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281199"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702416402"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509947"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1314498.1314563"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:MACH.0000033116.57574.95"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/645635.660833"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.11"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502550"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:MACH.0000033113.59016.96"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/954544"},{"key":"e_1_3_2_1_11_1","volume-title":"Hardness of approximation of the balanced complete bipartite subgraph problem","author":"Feige U.","year":"2004","unstructured":"U. Feige and S. Kogan . Hardness of approximation of the balanced complete bipartite subgraph problem , 2004 . U. Feige and S. Kogan. Hardness of approximation of the balanced complete bipartite subgraph problem, 2004."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081879"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142400"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1972.10481214"},{"key":"e_1_3_2_1_15_1","volume-title":"Computational complexity of bi-clustering. Master's thesis","author":"Hassanpour S.","year":"2007","unstructured":"S. Hassanpour . Computational complexity of bi-clustering. Master's thesis , University of Waterloo , 2007 . S. Hassanpour. Computational complexity of bi-clustering. Master's thesis, University of Waterloo, 2007."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/331499.331504"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/375827.375845"},{"key":"e_1_3_2_1_18_1","volume-title":"North-Holland","author":"Jambyu M.","year":"1983","unstructured":"M. Jambyu and M. O. Lebeaux . Cluster Analysis and Data Analysis . North-Holland , 1983 . M. Jambyu and M. O. Lebeaux. Cluster Analysis and Data Analysis. North-Holland, 1983."},{"key":"e_1_3_2_1_19_1","first-page":"446","volume-title":"Advances in Neural Information Processing Systems 15","author":"Kleinberg J.","year":"2002","unstructured":"J. Kleinberg . An impossibility theorem for clustering . In Advances in Neural Information Processing Systems 15 , pages 446 -- 453 , 2002 . J. Kleinberg. An impossibility theorem for clustering. In Advances in Neural Information Processing Systems 15, pages 446--453, 2002."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1101\/gr.648603"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.7"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2004.2"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/0213014"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45167-9_33"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:MACH.0000033117.77257.41"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(03)00333-0"},{"key":"e_1_3_2_1_27_1","volume-title":"An approximation ratio for biclustering. CoRR, abs\/0712.2682","author":"Puolam\u00e4ki K.","year":"2007","unstructured":"K. Puolam\u00e4ki , S. Hanhij\u00e4rvi , and G. C. Garriga . An approximation ratio for biclustering. CoRR, abs\/0712.2682 , 2007 . K. Puolam\u00e4ki, S. Hanhij\u00e4rvi, and G. C. Garriga. An approximation ratio for biclustering. CoRR, abs\/0712.2682, 2007."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2004.01.007"},{"key":"e_1_3_2_1_29_1","volume-title":"Co-clustering for text categorization","author":"Takamura H.","year":"2003","unstructured":"H. Takamura and Y. Matsumoto . Co-clustering for text categorization . Information Processing Society of Japan Journal , 2003 . H. Takamura and Y. Matsumoto. Co-clustering for text categorization. Information Processing Society of Japan Journal, 2003."},{"key":"e_1_3_2_1_30_1","volume-title":"E. by Srinivas Aluru","author":"Tanay A.","year":"2005","unstructured":"A. Tanay , R. Sharan , and R. Shamir . Biclustering algorithms: A survey . In E. by Srinivas Aluru , editor, In Handbook of Computational Molecular Biology. Chapman & amp; Hall\/CRC, Computer and Information Science Series, 2005 . A. Tanay, R. Sharan, and R. Shamir. Biclustering algorithms: A survey. In E. by Srinivas Aluru, editor, In Handbook of Computational Molecular Biology. Chapman & Hall\/CRC, Computer and Information Science Series, 2005."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/500776"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/791213.791346"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/876875.878990"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055558.1055579"}],"event":{"name":"SIGMOD\/PODS '08: SIGMOD\/PODS '08 - International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"],"location":"Vancouver Canada","acronym":"SIGMOD\/PODS '08"},"container-title":["Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1376916.1376945","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1376916.1376945","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:57:55Z","timestamp":1750255075000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1376916.1376945"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,9]]},"references-count":34,"alternative-id":["10.1145\/1376916.1376945","10.1145\/1376916"],"URL":"https:\/\/doi.org\/10.1145\/1376916.1376945","relation":{},"subject":[],"published":{"date-parts":[[2008,6,9]]},"assertion":[{"value":"2008-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}