{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:59:19Z","timestamp":1742972359690,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":23,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307688"},{"type":"electronic","value":"9780387301648"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-0-387-30164-8_176","type":"book-chapter","created":{"date-parts":[[2010,12,29]],"date-time":"2010-12-29T17:42:10Z","timestamp":1293644530000},"page":"227-231","source":"Crossref","is-referenced-by-count":1,"title":["Correlation Clustering"],"prefix":"10.1007","author":[{"given":"Anthony","family":"Wirth","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"176_CR1_176","first-page":"684","volume-title":"Proceedings of the Thirty-Seventh ACM Symposium on the Theory of Computing","author":"N Ailon","year":"2005","unstructured":"Ailon, N., Charikar, M., & Newman, A. (2005). Aggregating inconsistent information: Ranking and clustering. In Proceedings of the Thirty-Seventh ACM Symposium on the Theory of Computing (pp. 684\u2013693). New York: ACM Press."},{"issue":"3","key":"176_CR2_176","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/s00222-005-0465-9","volume":"163","author":"N Alon","year":"2006","unstructured":"Alon, N., Makarychev, K., Makarychev, Y., & Naor, A. (2006). Quadratic forms on graphs. Inventiones Mathematicae, 163(3), 499\u2013522.","journal-title":"Inventiones Mathematicae"},{"unstructured":"Arora, S., Berger, E., Hazan, E., Kindler, G., & Safra, S. (2005). On non-approximability for quadratic programs. In Proceedings of Forty-Sixth Symposium on Foundations of Computer Science. (pp. 206\u2013215). Washington DC: IEEE Computer Society.","key":"176_CR3_176"},{"key":"176_CR4_176","first-page":"238","volume-title":"Correlation clustering","author":"N Bansal","year":"2002","unstructured":"Bansal, N., Blum, A., & Chawla, S. (2002). Correlation clustering. In Correlation clustering (pp. 238\u2013247). Washington, DC: IEEE Computer Society."},{"key":"176_CR5_176","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1089\/106652799318274","volume":"6","author":"A Ben-Dor","year":"1999","unstructured":"Ben-Dor, A., Shamir, R., & Yakhini, Z. (1999). Clustering gene expression patterns. Journal of Computational Biology, 6, 281\u2013297.","journal-title":"Journal of Computational Biology"},{"doi-asserted-by":"crossref","unstructured":"Bertolacci, M., & Wirth, A. (2007). Are approximation algorithms for consensus clustering worthwhile? In Proceedings of Seventh SIAM International Conference on Data Mining. (pp. 437\u2013442). Philadelphia: SIAM.","key":"176_CR6_176","DOI":"10.1137\/1.9781611972771.41"},{"doi-asserted-by":"crossref","unstructured":"Charikar, M., Guruswami, V., & Wirth, A. (2003). Clustering with qualitative information. In Proceedings of forty fourth FOCS (pp. 524\u2013533).","key":"176_CR7_176","DOI":"10.1109\/SFCS.2003.1238225"},{"doi-asserted-by":"crossref","unstructured":"Charikar, M., & Wirth, A. (2004). Maximizing quadratic programs: Extending Grothendieck\u2019s inequality. In Proceedings of forty fifth FOCS (pp. 54\u201360).","key":"176_CR8_176","DOI":"10.1109\/FOCS.2004.39"},{"unstructured":"Daume, H. (2006). Practical structured learning techniques for natural language processing. PhD thesis, University of Southern California.","key":"176_CR9_176"},{"doi-asserted-by":"crossref","unstructured":"Davidson, I., & Ravi, S. (2005). Clustering with constraints: Feasibility issues and the k-means algorithm. In Proceedings of Fifth SIAM International Conference on Data Mining.","key":"176_CR10_176","DOI":"10.1137\/1.9781611972757.13"},{"issue":"2","key":"176_CR11_176","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.tcs.2006.05.008","volume":"361","author":"E Demaine","year":"2006","unstructured":"Demaine, E., Emanuel, D., Fiat, A., & Immorlica, N. (2006). Correlation clustering in general weighted graphs. Theoretical Computer Science, 361(2), 172\u2013187.","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Demaine, E., & Immorlica, N. (2003). Correlation clustering with partial information. In Proceedings of Sixth Workshop on Approximation Algorithms for Combinatorial Optimization Problems. (pp. 1\u201313).","key":"176_CR12_176","DOI":"10.1007\/978-3-540-45198-3_1"},{"doi-asserted-by":"crossref","unstructured":"Emanuel, D., & Fiat, A. (2003). Correlation clustering \u2013 minimizing disagreements on arbitrary weighted graphs. In Proceedings of Eleventh European Symposium on Algorithms (pp. 208\u2013220).","key":"176_CR13_176","DOI":"10.1007\/978-3-540-39658-1_21"},{"issue":"4","key":"176_CR14_176","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/BF02293706","volume":"47","author":"A Ferligoj","year":"1982","unstructured":"Ferligoj, A., & Batagelj, V. (1982). Clustering with relational constraint. Psychometrika, 47(4), 413\u2013426.","journal-title":"Psychometrika"},{"doi-asserted-by":"crossref","unstructured":"Finley, T., & Joachims, T. (2005). Supervised clustering with support vector machines. In Proceedings of Twenty-Second International Conference on Machine Learning.","key":"176_CR15_176","DOI":"10.1145\/1102351.1102379"},{"doi-asserted-by":"crossref","unstructured":"Gionis, A., Mannila, H., & Tsaparas, P. (2005). Clustering aggregation. In Proceedings of Twenty-First International Conference on Data Engineering. To appear.","key":"176_CR16_176","DOI":"10.1109\/ICDE.2005.34"},{"issue":"4","key":"176_CR17_176","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s00453-004-1090-5","volume":"39","author":"J Gramm","year":"2004","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., & Niedermeier, R. (2004). Automated generation of search tree algorithms for hard graph modification problems. Algorithmica, 39(4), 321\u2013347.","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"Kulis, B., Basu, S., Dhillon, I., & Mooney, R. (2005). Semi-supervised graph clustering: A kernel approach. In Proceedings of Twenty-Second International Conference on Machine Learning (pp. 457\u2013464).","key":"176_CR18_176","DOI":"10.1145\/1102351.1102409"},{"key":"176_CR19_176","first-page":"905","volume-title":"Advances in neural information processing systems 17","author":"A McCallum","year":"2005","unstructured":"McCallum, A., & Wellner, B. (2005). Conditional models of identity uncertainty with application to noun coreference. In L.\u00a0Saul, Y.\u00a0Weiss, & L.\u00a0Bottou, (Eds.), Advances in neural information processing systems 17 (pp. 905\u2013912). Cambridge, MA: MIT Press."},{"doi-asserted-by":"crossref","unstructured":"Meil\u0103, M. (2003). Comparing clusterings by the variation of information. In Proceedings of Sixteenth Conference on Learning Theory (pp. 173\u2013187).","key":"176_CR20_176","DOI":"10.1007\/978-3-540-45167-9_14"},{"key":"176_CR21_176","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.dam.2004.01.007","volume":"144","author":"R Shamir","year":"2004","unstructured":"Shamir, R., Sharan, R., & Tsur, D. (2004). Cluster graph modification problems. Discrete Applied Mathematics, 144, 173\u2013182.","journal-title":"Discrete Applied Mathematics"},{"unstructured":"Swamy, C. (2004). Correlation Clustering: Maximizing agreements via semidefinite programming. In Proceedings of Fifteenth ACM-SIAM Symposium on Discrete Algorithms (pp.\u00a0519\u2013520).","key":"176_CR22_176"},{"unstructured":"Tan, J. (2007). A Note on the inapproximability of correlation clustering. Technical Report 0704.2092, eprint arXiv, 2007.","key":"176_CR23_176"}],"container-title":["Encyclopedia of Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30164-8_176","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,22]],"date-time":"2023-12-22T03:13:15Z","timestamp":1703214795000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30164-8_176"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9780387307688","9780387301648"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30164-8_176","relation":{},"subject":[],"published":{"date-parts":[[2011]]}}}