{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:59:17Z","timestamp":1725515957612},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540688655"},{"type":"electronic","value":"9783540688808"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68880-8_14","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T06:37:59Z","timestamp":1217486279000},"page":"131-142","source":"Crossref","is-referenced-by-count":6,"title":["Engineering Comparators for Graph Clusterings"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Delling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Gaertler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"G\u00f6rke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"Network Analysis","year":"2005","unstructured":"Brandes, U., Erlebach, T. (eds.): Network Analysis. LNCS, vol.\u00a03418. Springer, Heidelberg (2005)"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1007\/978-3-540-39658-1_52","volume-title":"Algorithms - ESA 2003","author":"U. Brandes","year":"2003","unstructured":"Brandes, U., Gaertler, M., Wagner, D.: Experiments on Graph Clustering Algorithms. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 568\u2013579. Springer, Heidelberg (2003)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Clauset, A., Newman, M., Moore, C.: Finding community structure in very large networks. Physical Review E\u00a070(066111) (2004)","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"14_CR4","doi-asserted-by":"crossref","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T. Cover","year":"1991","unstructured":"Cover, T., Thomas, J.: Elements of Information Theory. John Wiley & Sons, Inc., Chichester (1991)"},{"key":"14_CR5","unstructured":"Delling, D., Gaertler, M., Wagner, D.: Generating Significant Graph Clusterings. In: European Conference of Complex Systems (ECCS 2006) (2006)"},{"key":"14_CR6","unstructured":"Fred, A., Jain, A.: Robust Data Clustering. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR, pp. 128\u2013136 (2003)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-72870-2_2","volume-title":"Algorithmic Aspects in Information and Management","author":"M. Gaertler","year":"2007","unstructured":"Gaertler, M., G\u00f6rke, R., Wagner, D.: Significance-Driven Graph Clustering. In: Kao, M.-Y., Li, X.-Y. (eds.) AAIM 2007. LNCS, vol.\u00a04508, pp. 11\u201326. Springer, Heidelberg (2007)"},{"key":"14_CR8","volume-title":"Algorithms for Clustering Data","author":"A. Jain","year":"1988","unstructured":"Jain, A., Dubes, R.: Algorithms for Clustering Data. Prentice Hall, Englewood Cliffs (1988)"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Meila, M.: Comparing Clusterings by the Variation of Information. In: 16th Annual Conference of Computational Learning Theory (COLT), pp. 173\u2013187 (2003)","DOI":"10.1007\/978-3-540-45167-9_14"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Meila, M.: Comparing Clusterings - An Axiomatic View. In: 22nd International Conference on Machine Learning, Bonn, Germany, pp. 577\u2013584 (2005)","DOI":"10.1145\/1102351.1102424"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1177\/0013164484441003","volume":"44","author":"R. Morey","year":"1984","unstructured":"Morey, R., Agresti, A.: The Measurement of Classification Agreement: An Adjustment to the RAND Statistic for Chance Agreement. Educational and Psychological Measurement\u00a044, 33\u201337 (1984)","journal-title":"Educational and Psychological Measurement"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"846","DOI":"10.2307\/2284239","volume":"66","author":"W. Rand","year":"1971","unstructured":"Rand, W.: Objective criteria for the evaluation of clustering methods. Journal of the American Statistical Association\u00a066, 846\u2013850 (1971)","journal-title":"Journal of the American Statistical Association"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1162\/153244303321897735","volume":"3","author":"A. Strehl","year":"2003","unstructured":"Strehl, A., Ghosh, J.: Cluster ensembles \u2013 a knowledge reuse framework for combining multiple partitions. J. Mach. Learn. Res.\u00a03, 583\u2013617 (2003)","journal-title":"J. Mach. Learn. Res."},{"key":"14_CR14","unstructured":"van Dongen, S.: A cluster algorithm for graphs. Tech. Report INS-R0010 (2000)"},{"key":"14_CR15","unstructured":"van Dongen, S.: Performance criteria for graph clustering and markov cluster experiments. Technical Report INS-R0012, National Research Institute for Mathematics and Computer Science in the Netherlands, Amsterdam (May 2000)"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"1834","DOI":"10.1016\/j.febslet.2005.02.030","volume":"579","author":"M. Vidal","year":"2005","unstructured":"Vidal, M.: Interactome modeling. FEBS Lett.\u00a0579, 1834\u20131838 (2005)","journal-title":"FEBS Lett."},{"key":"14_CR17","unstructured":"Wagner, S., Wagner, D.: Comparing Clusterings \u2013 An Overview. Technical Report 2006-4, Faculty of Informatics, Universit\u00e4t Karlsruhe (TH) (2006)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68880-8_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:16:59Z","timestamp":1620015419000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68880-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540688655","9783540688808"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68880-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}