A Quality Metric for Visualization of Clusters in Graphs

dc.contributor.authorMeidiana, Amyra
dc.contributor.authorHong, Seok-Hee
dc.contributor.authorEades, Peter
dc.contributor.authorKeim, Daniel A.
dc.date.accessioned2023-04-05T07:50:15Z
dc.date.available2023-04-05T07:50:15Z
dc.date.issued2019
dc.description.abstractTraditionally, graph quality metrics focus on readability, but recent studies show the need for metrics which are more specific to the discovery of patterns in graphs. Cluster analysis is a popular task within graph analysis, yet there is no metric yet explicitly quantifying how well a drawing of a graph represents its cluster structure. We define a clustering quality metric measuring how well a node-link drawing of a graph represents the clusters contained in the graph. Experiments with deforming graph drawings verify that our metric effectively captures variations in the visual cluster quality of graph drawings. We then use our metric to examine how well different graph drawing algorithms visualize cluster structures in various graphs; the results confirm that some algorithms which have been specifically designed to show cluster structures perform better than other algorithms.
dc.description.versionpublisheddeu
dc.identifier.doi10.1007/978-3-030-35802-0_10
dc.identifier.ppn1842703412
dc.identifier.urihttps://kops.uni-konstanz.de/handle/123456789/66540
dc.language.isoeng
dc.subject.ddc004
dc.titleA Quality Metric for Visualization of Clusters in Graphseng
dc.typeINPROCEEDINGS
dspace.entity.typePublication
kops.citation.bibtex
@inproceedings{Meidiana2019Quali-66540,
  year={2019},
  doi={10.1007/978-3-030-35802-0_10},
  title={A Quality Metric for Visualization of Clusters in Graphs},
  number={11904},
  isbn={978-3-030-35801-3},
  issn={0302-9743},
  publisher={Springer},
  address={Cham},
  series={Lecture Notes in Computer Science},
  booktitle={Graph Drawing and Network Visualization : 27th International Symposium, GD 2019, Proceedings},
  pages={125--138},
  editor={Archambault, Daniel and Tóth, Csaba D.},
  author={Meidiana, Amyra and Hong, Seok-Hee and Eades, Peter and Keim, Daniel A.}
}
kops.citation.iso690MEIDIANA, Amyra, Seok-Hee HONG, Peter EADES, Daniel A. KEIM, 2019. A Quality Metric for Visualization of Clusters in Graphs. Graph Drawing and Network Visualization : 27th International Symposium, GD 2019. Prague, Czech Republic, 17. Sept. 2019 - 20. Sept. 2019. In: ARCHAMBAULT, Daniel, ed., Csaba D. TÓTH, ed.. Graph Drawing and Network Visualization : 27th International Symposium, GD 2019, Proceedings. Cham: Springer, 2019, pp. 125-138. Lecture Notes in Computer Science. 11904. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-030-35801-3. Available under: doi: 10.1007/978-3-030-35802-0_10deu
kops.citation.iso690MEIDIANA, Amyra, Seok-Hee HONG, Peter EADES, Daniel A. KEIM, 2019. A Quality Metric for Visualization of Clusters in Graphs. Graph Drawing and Network Visualization : 27th International Symposium, GD 2019. Prague, Czech Republic, Sep 17, 2019 - Sep 20, 2019. In: ARCHAMBAULT, Daniel, ed., Csaba D. TÓTH, ed.. Graph Drawing and Network Visualization : 27th International Symposium, GD 2019, Proceedings. Cham: Springer, 2019, pp. 125-138. Lecture Notes in Computer Science. 11904. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-030-35801-3. Available under: doi: 10.1007/978-3-030-35802-0_10eng
kops.citation.rdf
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/66540">
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2023-04-05T07:50:15Z</dcterms:available>
    <dc:language>eng</dc:language>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Hong, Seok-Hee</dc:contributor>
    <dc:creator>Meidiana, Amyra</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:abstract>Traditionally, graph quality metrics focus on readability, but recent studies show the need for metrics which are more specific to the discovery of patterns in graphs. Cluster analysis is a popular task within graph analysis, yet there is no metric yet explicitly quantifying how well a drawing of a graph represents its cluster structure.
We define a clustering quality metric measuring how well a node-link drawing of a graph represents the clusters contained in the graph. Experiments with deforming graph drawings verify that our metric effectively captures variations in the visual cluster quality of graph drawings. We then use our metric to examine how well different graph drawing algorithms visualize cluster structures in various graphs; the results confirm that some algorithms which have been specifically designed to show cluster structures perform better than other algorithms.</dcterms:abstract>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/66540/1/Meidiana_2-iyjy8fzxa1yd8.PDF"/>
    <dc:creator>Keim, Daniel A.</dc:creator>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/66540"/>
    <dc:contributor>Keim, Daniel A.</dc:contributor>
    <dc:contributor>Eades, Peter</dc:contributor>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2023-04-05T07:50:15Z</dc:date>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/66540/1/Meidiana_2-iyjy8fzxa1yd8.PDF"/>
    <dcterms:title>A Quality Metric for Visualization of Clusters in Graphs</dcterms:title>
    <dc:creator>Hong, Seok-Hee</dc:creator>
    <dc:creator>Eades, Peter</dc:creator>
    <dcterms:issued>2019</dcterms:issued>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:contributor>Meidiana, Amyra</dc:contributor>
  </rdf:Description>
</rdf:RDF>
kops.conferencefieldGraph Drawing and Network Visualization : 27th International Symposium, GD 2019, 17. Sept. 2019 - 20. Sept. 2019, Prague, Czech Republicdeu
kops.date.conferenceEnd2019-09-20
kops.date.conferenceStart2019-09-17
kops.description.openAccessopenaccessgreen
kops.flag.knbibliographytrue
kops.identifier.nbnurn:nbn:de:bsz:352-2-iyjy8fzxa1yd8
kops.location.conferencePrague, Czech Republic
kops.sourcefieldARCHAMBAULT, Daniel, ed., Csaba D. TÓTH, ed.. <i>Graph Drawing and Network Visualization : 27th International Symposium, GD 2019, Proceedings</i>. Cham: Springer, 2019, pp. 125-138. Lecture Notes in Computer Science. 11904. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-030-35801-3. Available under: doi: 10.1007/978-3-030-35802-0_10deu
kops.sourcefield.plainARCHAMBAULT, Daniel, ed., Csaba D. TÓTH, ed.. Graph Drawing and Network Visualization : 27th International Symposium, GD 2019, Proceedings. Cham: Springer, 2019, pp. 125-138. Lecture Notes in Computer Science. 11904. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-030-35801-3. Available under: doi: 10.1007/978-3-030-35802-0_10deu
kops.sourcefield.plainARCHAMBAULT, Daniel, ed., Csaba D. TÓTH, ed.. Graph Drawing and Network Visualization : 27th International Symposium, GD 2019, Proceedings. Cham: Springer, 2019, pp. 125-138. Lecture Notes in Computer Science. 11904. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-030-35801-3. Available under: doi: 10.1007/978-3-030-35802-0_10eng
kops.title.conferenceGraph Drawing and Network Visualization : 27th International Symposium, GD 2019
relation.isAuthorOfPublicationda7dafb0-6003-4fd4-803c-11e1e72d621a
relation.isAuthorOfPublication.latestForDiscoveryda7dafb0-6003-4fd4-803c-11e1e72d621a
source.bibliographicInfo.fromPage125
source.bibliographicInfo.seriesNumber11904
source.bibliographicInfo.toPage138
source.contributor.editorArchambault, Daniel
source.contributor.editorTóth, Csaba D.
source.identifier.eissn1611-3349
source.identifier.isbn978-3-030-35801-3
source.identifier.issn0302-9743
source.publisherSpringer
source.publisher.locationCham
source.relation.ispartofseriesLecture Notes in Computer Science
source.titleGraph Drawing and Network Visualization : 27th International Symposium, GD 2019, Proceedings
temp.internal.duplicatesitems/c5776c5c-ae0e-4129-999d-f030200bc952;true;A practical guide for generating unsupervised, spectrogram-based latent space representations of animal vocalizations
temp.internal.duplicatesitems/5d66d531-9ca3-40f0-b1af-1f4312604e32;true;Interactive Ambiguity Resolution of Named Entities in Fictional Literature
temp.internal.duplicatesitems/ed00d44b-e4a7-4749-be4f-69adc4a47fd4;true;Going beyond Visualization : Verbalization as Complementary Medium to Explain Machine Learning Models
temp.internal.duplicatesitems/81798954-a427-49a0-a42c-ada29c2b80b0;true;Content-Based Layouts for Exploratory Metadata Search in Scientific Research Data
temp.internal.duplicatesitems/c78f93ac-43ce-48b2-b5b6-f723945f866d;true;Immersive Analytics with Abstract 3D Visualizations : a Survey

Dateien

Originalbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
Meidiana_2-iyjy8fzxa1yd8.PDF
Größe:
1.49 MB
Format:
Adobe Portable Document Format
Meidiana_2-iyjy8fzxa1yd8.PDF
Meidiana_2-iyjy8fzxa1yd8.PDFGröße: 1.49 MBDownloads: 84