{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T04:45:21Z","timestamp":1769575521757,"version":"3.49.0"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030358013","type":"print"},{"value":"9783030358020","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-35802-0_10","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"125-138","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A Quality Metric for Visualization of Clusters in Graphs"],"prefix":"10.1007","author":[{"given":"Amyra","family":"Meidiana","sequence":"first","affiliation":[]},{"given":"Seok-Hee","family":"Hong","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Eades","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Keim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Aldenderfer, M.S., Blashfield, R.: Cluster Analysis. Beverly Hills: Sage Publications, Thousand Oaks (1984)","DOI":"10.4135\/9781412983648"},{"key":"10_CR2","unstructured":"Batagelj, V., Mrvar, A.: Pajek data sets (2003). http:\/\/pajek.imfm.si\/doku.php?id=data:index"},{"key":"10_CR3","unstructured":"Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall PTR, Upper Saddle River (1998)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/3-540-45848-4_47","volume-title":"Graph Drawing","author":"M Baur","year":"2002","unstructured":"Baur, M., Benkert, M., Brandes, U., Cornelsen, S., Gaertler, M., K\u00f6pf, B., Lerner, J., Wagner, D.: Visone Software for Visual Social Network Analysis. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 463\u2013464. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45848-4_47"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Behrisch, M., Blumenschein, M., Kim, N.W., Shao, L., El-Assady, M., Fuchs, J., Seebacher, D., Diehl, A., Brandes, U., Pfister, H., Schreck, T., Weiskopf, D., Keim, D.A.: Quality metrics for information visualization. In: Computer Graphics Forum, vol. 37, pp. 625\u2013662. Wiley Online Library (2018)","DOI":"10.1111\/cgf.13446"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-540-70904-6_6","volume-title":"Graph Drawing","author":"U Brandes","year":"2007","unstructured":"Brandes, U., Pich, C.: Eigensolver methods for progressive multidimensional scaling of large data. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 42\u201353. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70904-6_6"},{"key":"10_CR7","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley-Interscience, New York (1991)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/3-540-45848-4_34","volume-title":"Graph Drawing","author":"A David","year":"2002","unstructured":"David, A.: Tulip. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 435\u2013437. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45848-4_34"},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.7155\/jgaa.00405","volume":"21","author":"P Eades","year":"2017","unstructured":"Eades, P., Hong, S.H., Nguyen, A., Klein, K.: Shape-based quality metrics for large graph visualization. J. Graph Algorithms Appl. 21(1), 29\u201353 (2017)","journal-title":"J. Graph Algorithms Appl."},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/3-540-45848-4_57","volume-title":"Graph Drawing","author":"J Ellson","year":"2002","unstructured":"Ellson, J., Gansner, E., Koutsofios, L., North, S.C., Woodhull, G.: Graphviz\u2014 open source graph drawing tools. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 483\u2013484. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45848-4_57"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Estivill-Castro, V.: Why so many clustering algorithms: a position paper. SIGKDD Explor. Newsl. 4(1), 65\u201375 (2002). https:\/\/doi.org\/10.1145\/568574.568575","DOI":"10.1145\/568574.568575"},{"issue":"383","key":"10_CR12","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1080\/01621459.1983.10478008","volume":"78","author":"EB Fowlkes","year":"1983","unstructured":"Fowlkes, E.B., Mallows, C.L.: A method for comparing two hierarchical clusterings. J. Am. Stat. Assoc. 78(383), 553\u2013569 (1983). https:\/\/doi.org\/10.1080\/01621459.1983.10478008","journal-title":"J. Am. Stat. Assoc."},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw.: Practice Exp. 21(11), 1129\u20131164 (1991). https:\/\/doi.org\/10.1002\/spe.4380211102","DOI":"10.1002\/spe.4380211102"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-31843-9_25","volume-title":"Graph Drawing","author":"ER Gansner","year":"2005","unstructured":"Gansner, E.R., Koren, Y., North, S.: Graph drawing by stress majorization. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 239\u2013250. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31843-9_25"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-540-31843-9_29","volume-title":"Graph Drawing","author":"S Hachul","year":"2005","unstructured":"Hachul, S., J\u00fcnger, M.: Drawing large graphs with a potential-field-based multilevel algorithm. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 285\u2013295. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31843-9_29"},{"issue":"1","key":"10_CR16","first-page":"37","volume":"10","author":"Y Hu","year":"2005","unstructured":"Hu, Y.: Efficient, high-quality force-directed graph drawing. Math. J. 10(1), 37\u201371 (2005)","journal-title":"Math. J."},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Huang, W., Hong, S.H., Eades, P.: Effects of crossing angles. In: 2008 IEEE Pacific Visualization Symposium, pp. 41\u201346. IEEE (2008)","DOI":"10.1109\/PACIFICVIS.2008.4475457"},{"issue":"1","key":"10_CR18","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2(1), 193\u2013218 (1985). https:\/\/doi.org\/10.1007\/BF01908075","journal-title":"J. Classif."},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-662-45803-7_20","volume-title":"Graph Drawing","author":"SG Kobourov","year":"2014","unstructured":"Kobourov, S.G., Pupyrev, S., Saket, B.: Are crossings important for drawing large graphs? In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 234\u2013245. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45803-7_20"},{"issue":"11\u201312","key":"10_CR20","doi-asserted-by":"publisher","first-page":"1867","DOI":"10.1016\/j.camwa.2004.08.015","volume":"49","author":"Y Koren","year":"2005","unstructured":"Koren, Y.: Drawing graphs by eigenvectors: theory and practice. Comput. Math. Appl. 49(11\u201312), 1867\u20131888 (2005). https:\/\/doi.org\/10.1016\/j.camwa.2004.08.015","journal-title":"Comput. Math. Appl."},{"key":"10_CR21","unstructured":"Kruiger, J.F.: tsnet (2017). https:\/\/github.com\/HanKruiger\/tsNET\/"},{"issue":"3","key":"10_CR22","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1111\/cgf.13187","volume":"36","author":"JF Kruiger","year":"2017","unstructured":"Kruiger, J.F., Rauber, P.E., Martins, R.M., Kerren, A., Kobourov, S., Telea, A.C.: Graph layouts by t-SNE. Comput. Graph. Forum 36(3), 283\u2013294 (2017). https:\/\/doi.org\/10.1111\/cgf.13187","journal-title":"Comput. Graph. Forum"},{"key":"10_CR23","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection, June 2014. http:\/\/snap.stanford.edu\/data"},{"key":"10_CR24","unstructured":"Maaten, L.V.D., Hinton, G.: Visualizing data using t-SNE. J. Mach. Learn. Res. 9(Nov), 2579\u20132605 (2008)"},{"key":"10_CR25","unstructured":"MacQueen, J., et al.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 281\u2013297. University of California Press (1967)"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-540-24595-7_40","volume-title":"Graph Drawing","author":"A Noack","year":"2004","unstructured":"Noack, A.: An energy model for visual graph clustering. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 425\u2013436. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24595-7_40"},{"issue":"2","key":"10_CR27","doi-asserted-by":"publisher","first-page":"595","DOI":"10.7155\/jgaa.00370","volume":"19","author":"A Nocaj","year":"2015","unstructured":"Nocaj, A., Ortmann, M., Brandes, U.: Untangling the hairballs of multi-centered, small-world online social media networks. J. Graph Algorithms Appl. 19(2), 595\u2013618 (2015). https:\/\/doi.org\/10.7155\/jgaa.00370","journal-title":"J. Graph Algorithms Appl."},{"key":"10_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-319-50106-2_2","volume-title":"Graph Drawing and Network Visualization","author":"M Ortmann","year":"2016","unstructured":"Ortmann, M., Klimenta, M., Brandes, U.: A sparse stress model. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 18\u201332. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_2"},{"key":"10_CR29","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., et al.: Scikit-learn: machine learning in python. J. Mach. Learn. Res. 12(Oct), 2825\u20132830 (2011)"},{"key":"10_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-63938-1_67","volume-title":"Graph Drawing","author":"H Purchase","year":"1997","unstructured":"Purchase, H.: Which aesthetic has the greatest effect on human understanding? In: DiBattista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 248\u2013261. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63938-1_67"},{"key":"10_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/BFb0021827","volume-title":"Graph Drawing","author":"HC Purchase","year":"1996","unstructured":"Purchase, H.C., Cohen, R.F., James, M.: Validating graph drawing aesthetics. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 435\u2013446. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0021827"},{"issue":"336","key":"10_CR32","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"WM Rand","year":"1971","unstructured":"Rand, W.M.: Objective criteria for the evaluation of clustering methods. J. Am. Stat. Assoc. 66(336), 846\u2013850 (1971). https:\/\/doi.org\/10.1080\/01621459.1971.10482356","journal-title":"J. Am. Stat. Assoc."},{"key":"10_CR33","unstructured":"Rosenberg, A., Hirschberg, J.: V-measure: a conditional entropy-based external cluster evaluation measure. In: Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL), pp. 410\u2013420 (2007)"},{"key":"10_CR34","unstructured":"Saket, B., Simonetto, P., Kobourov, S.: Group-level graph visualization taxonomy. CoRR abs\/1403.7421 (2014)"},{"key":"10_CR35","doi-asserted-by":"publisher","unstructured":"Sedlmair, M., Tatu, A., Munzner, T., Tory, M.: A taxonomy of visual cluster separation factors. Comput. Graph. Forum 31(3pt4), 1335\u20131344 (2012). https:\/\/doi.org\/10.1111\/j.1467-8659.2012.03125.x","DOI":"10.1111\/j.1467-8659.2012.03125.x"},{"key":"10_CR36","unstructured":"Strehl, A., Ghosh, J.: Cluster ensembles\u2013a knowledge reuse framework for combining multiple partitions. J. Mach. Learn. Res. 3(Dec), 583\u2013617 (2002)"},{"key":"10_CR37","doi-asserted-by":"publisher","unstructured":"Torgerson, W.S.: Multidimensional scaling: I. Theory and method. Psychometrika 17(4), 401\u2013419 (1952). https:\/\/doi.org\/10.1007\/BF02288916","DOI":"10.1007\/BF02288916"},{"key":"10_CR38","doi-asserted-by":"crossref","unstructured":"Vinh, N.X., Epps, J., Bailey, J.: Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance. J. Mach. Learn. Res. 11(Oct), 2837\u20132854 (2010)","DOI":"10.1145\/1553374.1553511"},{"key":"10_CR39","doi-asserted-by":"publisher","unstructured":"Wiese, R., Eiglsperger, M., Kaufmann, M.: yfiles - visualization and automatic layout of graphs. In: J\u00fcnger, M., Mutzel, P. (eds.) Graph Drawing Software. Mathematics and Visualization, pp. 173\u2013191. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-642-18638-7_8","DOI":"10.1007\/978-3-642-18638-7_8"},{"key":"10_CR40","unstructured":"Zitnik, M., Sosi\u010d, R., Maheshwari, S., Leskovec, J.: BioSNAP Datasets: Stanford biomedical network dataset collection, August 2018. http:\/\/snap.stanford.edu\/biodata"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35802-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:03:01Z","timestamp":1701133381000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/kam.mff.cuni.cz\/gd2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"113","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12.55","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}