{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:20:46Z","timestamp":1725603646266},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23719-5_3","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T09:14:33Z","timestamp":1314695673000},"page":"25-36","source":"Crossref","is-referenced-by-count":5,"title":["Improved Approximation Algorithms for Bipartite Correlation Clustering"],"prefix":"10.1007","author":[{"given":"Nir","family":"Ailon","sequence":"first","affiliation":[]},{"given":"Noa","family":"Avigdor-Elgrabli","sequence":"additional","affiliation":[]},{"given":"Edo","family":"Liberty","sequence":"additional","affiliation":[]},{"given":"Anke","family":"van Zuylen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-540-79228-4_39","volume-title":"Theory and Applications of Models of Computation","author":"J. Guo","year":"2008","unstructured":"Guo, J., H\u00fcffner, F., Komusiewicz, C., Zhang, Y.: Improved Algorithms for Bicluster Editing. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol.\u00a04978, pp. 445\u2013456. Springer, Heidelberg (2008)"},{"key":"3_CR2","unstructured":"Symeonidis, P., Nanopoulos, A., Papadopoulos, A., Manolopoulos, Y.: Nearest-biclusters collaborative filtering (2006)"},{"key":"3_CR3","unstructured":"Amit, N.: The bicluster graph editing problem (2004)"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/TCBB.2004.2","volume":"1","author":"S.C. Madeira","year":"2004","unstructured":"Madeira, S.C., Oliveira, A.L.: Biclustering algorithms for biological data analysis: A survey. IEEE\/ACM Trans. Comput. Biol. Bioinformatics\u00a01, 24\u201345 (2004)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinformatics"},{"key":"3_CR5","first-page":"93","volume-title":"Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology","author":"Y. Cheng","year":"2000","unstructured":"Cheng, Y., Church, G.M.: Biclustering of expression data. In: Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology, pp. 93\u2013103. AAAI Press, Menlo Park (2000)"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"N. Bansal","year":"2004","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Machine Learning\u00a056, 89\u2013113 (2004)","journal-title":"Machine Learning"},{"key":"3_CR7","first-page":"36","volume-title":"Proceedings of the Twenty-First International Conference on Machine Learning, ICML 2004","author":"X.Z. Fern","year":"2004","unstructured":"Fern, X.Z., Brodley, C.E.: Solving cluster ensemble problems by bipartite graph partitioning. In: Proceedings of the Twenty-First International Conference on Machine Learning, ICML 2004, p. 36. ACM, New York (2004)"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/502585.502591","volume-title":"Proceedings of the Tenth International Conference on Information and Knowledge Management, CIKM 2001","author":"H. Zha","year":"2001","unstructured":"Zha, H., He, X., Ding, C., Simon, H., Gu, M.: Bipartite graph partitioning and data clustering. In: Proceedings of the Tenth International Conference on Information and Knowledge Management, CIKM 2001, pp. 25\u201332. ACM, New York (2001)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Emanuel, D., Fiat, A., Immorlica, N.: Correlation clustering in general weighted graphs. Theoretical Computer Science (2006)","DOI":"10.1016\/j.tcs.2006.05.008"},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.jcss.2004.10.012","volume":"71","author":"M. Charikar","year":"2005","unstructured":"Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. J. Comput. Syst. Sci.\u00a071(3), 360\u2013383 (2005)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"3_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1411509.1411513","volume":"55","author":"N. Ailon","year":"2008","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: Ranking and clustering. J. ACM\u00a055(5), 1\u201327 (2008)","journal-title":"J. ACM"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-02927-1_4","volume-title":"Automata, Languages and Programming","author":"N. Ailon","year":"2009","unstructured":"Ailon, N., Liberty, E.: Correlation Clustering Revisited: The True Cost of Error Minimization Problems. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05555, pp. 24\u201336. Springer, Heidelberg (2009)"},{"issue":"3","key":"3_CR13","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1287\/moor.1090.0385","volume":"34","author":"A. Zuylen van","year":"2009","unstructured":"van Zuylen, A., Williamson, D.P.: Deterministic pivoting algorithms for constrained ranking and clustering problems. Math. Oper. Res.\u00a034(3), 594\u2013620 (2009); Preliminary version appeared in SODA 2007 (with Rajneesh Hegde and Kamal Jain)","journal-title":"Math. Oper. Res."},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1145\/1109557.1109686","volume-title":"Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms(SODA)","author":"I. Giotis","year":"2006","unstructured":"Giotis, I., Guruswami, V.: Correlation clustering with a fixed number of clusters. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1167\u20131176. ACM, New York (2006)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Karpinski, M., Schudy, W.: Linear time approximation schemes for the gale-berlekamp game and related minimization problems. CoRR, abs\/0811.3244 (2008)","DOI":"10.1145\/1536414.1536458"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T12:07:57Z","timestamp":1560514077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}