{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:53:51Z","timestamp":1725764031096},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642539138"},{"type":"electronic","value":"9783642539145"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-53914-5_30","type":"book-chapter","created":{"date-parts":[[2013,12,14]],"date-time":"2013-12-14T00:56:59Z","timestamp":1386982619000},"page":"348-359","source":"Crossref","is-referenced-by-count":3,"title":["Restoring: A Greedy Heuristic Approach Based on Neighborhood for Correlation Clustering"],"prefix":"10.1007","author":[{"given":"Ning","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-3","key":"30_CR1","doi-asserted-by":"crossref","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 56(1-3), 89\u2013113 (2004)","journal-title":"Machine Learning"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Ng, V., Cardie, C.: Improving machine learning approaches to coreference resolution. In: Proceedings of the 40th Annual Meeting on Association for Computational Linguistics, pp. 104\u2013111. Association for Computational Linguistics (2002)","DOI":"10.3115\/1073083.1073102"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Cohen, W.W., Richman, J.: Learning to match and cluster large high-dimensional data sets for data integration. In. In: Proceedings of the Eighth ACMSIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 475\u2013480. ACM (2002)","DOI":"10.1145\/775047.775116"},{"key":"30_CR4","unstructured":"http:\/\/www.cs.umd.edu\/~getoor\/Tutorials\/ER_VLDB2012.pdf\n                    \n                    \n                   (2012)"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Malioutov, I., Barzilay, R.: Minimum cut model for spoken lecture segmentation. In: Proceedings of the 21st International Conference on Computational Linguistics and the 44th Annual Meeting of the Association for Computational Linguistics, pp. 25\u201332. Association for Computational Linguistics (2006)","DOI":"10.3115\/1220175.1220179"},{"issue":"3","key":"30_CR6","doi-asserted-by":"crossref","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. Journal of Computer and System Sciences 71(3), 360\u2013383 (2005)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2\u20133","key":"30_CR7","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.tcs.2006.05.008","volume":"361","author":"E.D. Demaine","year":"2006","unstructured":"Demaine, E.D., Emanuel, D., Fiat, A., Immorlica, N.: Correlation clustering in general weighted graphs. Theoret. Comput. Science\u00a0361(2\u20133), 172\u2013187 (2006)","journal-title":"Theoret. Comput. Science"},{"key":"30_CR8","unstructured":"Swamy, C.: Correlation clustering: maximizing agreements via semi definite programming. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 526\u2013527. Society for Industrial and Applied Mathematics (2004)"},{"issue":"5","key":"30_CR9","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/1411509.1411513","volume":"55","author":"N. Ailon","year":"2008","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating in consistent information: rank in gand clustering. Journal of the ACM (JACM) 55(5), 23 (2008)","journal-title":"Journal of the ACM (JACM)"},{"issue":"3","key":"30_CR10","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1287\/moor.1090.0385","volume":"34","author":"A. VanZuylen","year":"2009","unstructured":"VanZuylen, A., Williamson, D.P.: Deterministicpi voting algorithms for constraine dranking and clustering problems. Mathematics of Operations Research 34(3), 594\u2013620 (2009)","journal-title":"Mathematics of Operations Research"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Giotis, I., Guruswami, V.: Correlation clustering with a fixed number of clusters. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, pp. 1167\u20131176. ACM (2006)","DOI":"10.1145\/1109557.1109686"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Gionis, A., Ukkonen, A.: Overlapping correlation clustering. In: 2011 IEEE 11th International Conference on Data Mining (ICDM), pp. 51\u201360 (2011)","DOI":"10.1109\/ICDM.2011.114"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Gionis, A., Gullo, F., Ukkonen, A.: Chromatic correlation clustering. In: Proceedings of the 18th ACMSIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1321\u20131329. ACM (2012)","DOI":"10.1145\/2339530.2339735"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Bertolacci, M., Wirth, A.: Are approximation algorithms for consensus clustering worth while? In: SDM (2007)","DOI":"10.1137\/1.9781611972771.41"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Goder, A., Filkov, V.: Consensus Clustering Algorithms: Comparison and Refinement. In: ALENEX, vol. 8, pp. 109\u2013117 (2008)","DOI":"10.1137\/1.9781611972887.11"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Gionis, A., Mannila, H., Tsaparas, P.: Clustering aggregation. ACM Transactions on Knowledge Discovery from Data (TKDD) 1(1), 4 (2007)","DOI":"10.1145\/1217299.1217303"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Elsner, M., Schudy, W.: Bounding and comparing methods for correlation clustering beyond ILP. In: Proceedings of the Workshop on Integer Linear Programming for Natural Langauge Processing, pp. 19\u201327. Association for Computational Linguistics (2009)","DOI":"10.3115\/1611638.1611641"},{"key":"30_CR18","unstructured":"Elsner, M., Charniak, E.: You Talking to Me?A Corpus and Algorithm for Conversation Disentanglement. In: ACL, pp. 834\u2013842 (2008)"},{"issue":"5","key":"30_CR19","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1016\/j.jmva.2006.11.013","volume":"98","author":"M. Meil\u0103","year":"2007","unstructured":"Meil\u0103, M.: Comparing clusterings\u2014an information based distance. Journal of Multivariate Analysis 98(5), 873\u2013895 (2007)","journal-title":"Journal of Multivariate Analysis"},{"issue":"1","key":"30_CR20","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L. Hubert","year":"1985","unstructured":"Hubert, L., Arabie, P.: Comparing partitions. Journal of Classification 2(1), 193\u2013218 (1985)","journal-title":"Journal of Classification"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-53914-5_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T08:56:43Z","timestamp":1558774603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-53914-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642539138","9783642539145"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-53914-5_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}