{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T18:24:26Z","timestamp":1725992666663},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319996479"},{"type":"electronic","value":"9783319996486"}],"license":[{"start":{"date-parts":[[2018,9,19]],"date-time":"2018-09-19T00:00:00Z","timestamp":1537315200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-319-99648-6_1","type":"book-chapter","created":{"date-parts":[[2018,9,18]],"date-time":"2018-09-18T03:35:05Z","timestamp":1537241705000},"page":"1-13","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Contraction Methods for Correlation Clustering: The Order is Important"],"prefix":"10.1007","author":[{"given":"L\u00e1szl\u00f3","family":"Aszal\u00f3s","sequence":"first","affiliation":[]},{"given":"M\u00e1ria","family":"Bak\u00f3","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,19]]},"reference":[{"key":"1_CR1","unstructured":"Aszal\u00f3s, L., Bak\u00f3, M.: Advanced search methods (in Hungarian). \nhttp:\/\/www.tankonyvtar.hu\/hu\/tartalom\/tamop412A\/2011-0103_13_fejlett_keresoalgoritmusok\n\n (2012)"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Aszal\u00f3s, L., Bak\u00f3, M.: Correlation clustering: divide and conquer. In: Ganzha, M., Maciaszek, L., Paprzycki, M. (eds.) Position Papers of the 2016 Federated Conference on Computer Science and Information Systems, Annals of Computer Science and Information Systems, vol. 9, pp. 73\u201378. PTI (2016). \nhttps:\/\/doi.org\/10.15439\/2016F168","DOI":"10.15439\/2016F168"},{"issue":"10","key":"1_CR3","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1109\/TKDE.2007.1061","volume":"19","author":"Bo Yang","year":"2007","unstructured":"Aszal\u00f3s, L., Mih\u00e1lyde\u00e1k, T.: Rough clustering generated by correlation clustering. In: Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, pp. 315\u2013324. Springer, Berlin, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1109\/TKDE.2007.1061","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-319-11740-9_37","volume-title":"Rough Sets and Knowledge Technology","author":"L\u00e1szl\u00f3 Aszal\u00f3s","year":"2014","unstructured":"Aszal\u00f3s, L., Mih\u00e1lyde\u00e1k, T.: Rough classification based on correlation clustering. In: Rough Sets and Knowledge Technology, pp. 399\u2013410. Springer (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-11740-9_37"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-319-40132-4_6","volume-title":"Recent Advances in Computational Optimization","author":"L\u00e1szl\u00f3 Aszal\u00f3s","year":"2016","unstructured":"Aszal\u00f3s, L., Mih\u00e1lyde\u00e1k, T.: Correlation clustering by contraction, a more effective method. In: Recent Advances in Computational Optimization, vol. 655, pp. 81\u201395. Springer (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-40132-4_6"},{"issue":"1-3","key":"1_CR6","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"Nikhil Bansal","year":"2004","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56(1\u20133), 89\u2013113 (2004). \nhttps:\/\/doi.org\/10.1023\/B:MACH.0000033116.57574.95","journal-title":"Machine Learning"},{"issue":"11","key":"1_CR7","doi-asserted-by":"publisher","first-page":"1359","DOI":"10.1093\/bioinformatics\/btn133","volume":"24","author":"Anindya Bhattacharya","year":"2008","unstructured":"Bhattacharya, A., De, R.K.: Divisive correlation clustering algorithm (dcca) for grouping of genes: detecting varying patterns in expression profiles. Bioinformatics 24(11), 1359\u20131366 (2008). \nhttps:\/\/doi.org\/10.1093\/bioinformatics\/btn133","journal-title":"Bioinformatics"},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Chen, Z., Yang, S., Li, L., Xie, Z.: A clustering approximation mechanism based on data spatial correlation in wireless sensor networks. In: Wireless Telecommunications Symposium (WTS), 2010, pp. 1\u20137. IEEE (2010). \nhttps:\/\/doi.org\/10.1109\/WTS.2010.5479626","DOI":"10.1109\/WTS.2010.5479626"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"DuBois, T., Golbeck, J., Kleint, J., Srinivasan, A.: Improving recommendation accuracy by clustering social networks with trust. Recommender Systems & the Social Web 532, 1\u20138 (2009). \nhttps:\/\/doi.org\/10.1145\/2661829.2662085","DOI":"10.1145\/2661829.2662085"},{"key":"1_CR10","unstructured":"Kim, S., Nowozin, S., Kohli, P., Yoo, C.D.: Higher-order correlation clustering for image segmentation. In: Advances in Neural Information Processing Systems, pp. 1530\u20131538 (2011). DOI 10.1.1.229.4144"},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.physa.2005.08.008","volume":"362","author":"Zolt\u00e1n N\u00e9da","year":"2006","unstructured":"N\u00e9da, Z., Florian, R., Ravasz, M., Lib\u00e1l, A., Gy\u00f6rgyi, G.: Phase transition in an optimal clusterization model. Physica A: Stat. Mech. Appl. 362(2), 357\u2013368 (2006). \nhttps:\/\/doi.org\/10.1016\/j.physa.2005.08.008","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"issue":"10","key":"1_CR12","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1109\/TKDE.2007.1061","volume":"19","author":"B Yang","year":"2007","unstructured":"Yang, B., Cheung, W.K., Liu, J.: Community mining from signed social networks. Knowl. Data Eng. IEEE Trans. 19(10), 1333\u20131348 (2007)","journal-title":"Knowl. Data Eng. IEEE Trans."},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Zahn Jr, C.: Approximating symmetric relations by equivalence relations. J. Soc. Ind. Appl. Math. 12(4), 840\u2013847 (1964). \nhttps:\/\/doi.org\/10.1137\/0112071","DOI":"10.1137\/0112071"}],"container-title":["Studies in Computational Intelligence","Recent Advances in Computational Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99648-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,18]],"date-time":"2018-09-18T03:35:58Z","timestamp":1537241758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99648-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,19]]},"ISBN":["9783319996479","9783319996486"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99648-6_1","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2018,9,19]]}}}