Publikation: Matrix Reordering Methods for Table and Network Visualization
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
DOI (zitierfähiger Link)
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Publikationsstatus
Erschienen in
Zusammenfassung
This survey provides a description of algorithms to reorder visual matrices of tabular data and adjacency matrix of Networks. The goal of this survey is to provide a comprehensive list of reordering algorithms published in different fields such as statistics, bioinformatics, or graph theory. While several of these algorithms are described in publications and others are available in software libraries and programs, there is little awareness of what is done across all fields. Our survey aims at describing these reordering algorithms in a unified manner to enable a wide audience to understand their differences and subtleties. We organize this corpus in a consistent manner, independently of the application or research field. We also provide practical guidance on how to select appropriate algorithms depending on the structure and size of the matrix to reorder, and point to implementations when available.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
BEHRISCH, Michael, Benjamin BACH, Nathalie HENRY RICHE, Tobias SCHRECK, Jean-Daniel FEKETE, 2016. Matrix Reordering Methods for Table and Network Visualization. In: Computer Graphics Forum. 2016, 35(3), pp. 693-716. ISSN 0167-7055. eISSN 1467-8659. Available under: doi: 10.1111/cgf.12935BibTex
@article{Behrisch2016Matri-35428, year={2016}, doi={10.1111/cgf.12935}, title={Matrix Reordering Methods for Table and Network Visualization}, number={3}, volume={35}, issn={0167-7055}, journal={Computer Graphics Forum}, pages={693--716}, author={Behrisch, Michael and Bach, Benjamin and Henry Riche, Nathalie and Schreck, Tobias and Fekete, Jean-Daniel} }
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/35428"> <dc:contributor>Schreck, Tobias</dc:contributor> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:creator>Bach, Benjamin</dc:creator> <dc:language>eng</dc:language> <dc:contributor>Behrisch, Michael</dc:contributor> <dc:creator>Fekete, Jean-Daniel</dc:creator> <dcterms:title>Matrix Reordering Methods for Table and Network Visualization</dcterms:title> <dc:creator>Schreck, Tobias</dc:creator> <dc:contributor>Bach, Benjamin</dc:contributor> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2016-09-28T09:00:02Z</dcterms:available> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dcterms:issued>2016</dcterms:issued> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dc:creator>Behrisch, Michael</dc:creator> <dc:creator>Henry Riche, Nathalie</dc:creator> <dcterms:abstract xml:lang="eng">This survey provides a description of algorithms to reorder visual matrices of tabular data and adjacency matrix of Networks. The goal of this survey is to provide a comprehensive list of reordering algorithms published in different fields such as statistics, bioinformatics, or graph theory. While several of these algorithms are described in publications and others are available in software libraries and programs, there is little awareness of what is done across all fields. Our survey aims at describing these reordering algorithms in a unified manner to enable a wide audience to understand their differences and subtleties. We organize this corpus in a consistent manner, independently of the application or research field. We also provide practical guidance on how to select appropriate algorithms depending on the structure and size of the matrix to reorder, and point to implementations when available.</dcterms:abstract> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2016-09-28T09:00:02Z</dc:date> <dc:contributor>Henry Riche, Nathalie</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Fekete, Jean-Daniel</dc:contributor> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/35428"/> </rdf:Description> </rdf:RDF>