Balanced-partitioning treemapping method for digital hierarchical dataset

Loading...
Thumbnail Image
Date
2022
Authors
Feng, Cong
Gong, Minglun
Editors
Contact
Journal ISSN
Electronic ISSN
ISBN
Bibliographical data
Publisher
Series
DOI (citable link)
ArXiv-ID
International patent number
Link to the license
EU project number
Project
Open Access publication
Restricted until
Title in another language
Research Projects
Organizational Units
Journal Issue
Publication type
Journal article
Publication status
Published
Published in
Virtual Reality & Intelligent Hardware ; 4 (2022), 4. - pp. 342-358. - Elsevier. - ISSN 2096-5796. - eISSN 2666-1209
Abstract
Background
The problem of visualizing a hierarchical dataset is an important and useful technique in many real-life situations. Folder systems, stock markets, and other hierarchical-related datasets can use this technique to better understand the structure and dynamic variation of the dataset. Traditional space-filling(square)-based methods have the advantages of compact space usage and node size as opposed to diagram-based methods. Spacefilling- based methods have two main research directions: static and dynamic performance.

Methods
This study presented a treemapping method based on balanced partitioning that enables excellent aspect ratios in one variant, good temporal coherence for dynamic data in another, and in the third, a satisfactory compromise between these two aspects. To layout a treemap, all the children of a node were divided into two groups, which were then further divided until groups of single elements were reached. After this, these groups were combined to form a rectangle representing the parent node. This process was performed for each layer of the hierarchical dataset. For the first variant from the partitioning, the child elements were sorted and two groups, sized as equally as possible, were built from both big and small elements (size-balanced partition). This achieved satisfactory aspect ratios for the rectangles but less so temporal coherence (dynamic). For the second variant, the sequence of children was taken and from this, groups, sized as equally as possible, were created without the need for sorting (sequence-based, good compromise between aspect ratio and temporal coherency). For the third variant, the children were split into two groups of equal cardinalities, regardless of their size (number-balanced, worse aspect ratios but good temporal coherence).

Results
This study evaluated the aspect ratios and dynamic stability of the employed methods and proposed a new metric that measures the visual difference between rectangles during their movement to represent temporally changing inputs.

Conclusion
This study demonstrated that the proposed method of treemapping via balanced partitioning outperformed the state-of-the-art methods for several real-world datasets.
Summary in another language
Subject (DDC)
004 Computer Science
Keywords
Conference
Review
undefined / . - undefined, undefined. - (undefined; undefined)
Cite This
ISO 690FENG, Cong, Minglun GONG, Oliver DEUSSEN, 2022. Balanced-partitioning treemapping method for digital hierarchical dataset. In: Virtual Reality & Intelligent Hardware. Elsevier. 4(4), pp. 342-358. ISSN 2096-5796. eISSN 2666-1209. Available under: doi: 10.1016/j.vrih.2021.09.006
BibTex
@article{Feng2022-08Balan-58600,
  year={2022},
  doi={10.1016/j.vrih.2021.09.006},
  title={Balanced-partitioning treemapping method for digital hierarchical dataset},
  number={4},
  volume={4},
  issn={2096-5796},
  journal={Virtual Reality & Intelligent Hardware},
  pages={342--358},
  author={Feng, Cong and Gong, Minglun and Deussen, Oliver}
}
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/58600">
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-09-13T07:37:21Z</dcterms:available>
    <dc:contributor>Gong, Minglun</dc:contributor>
    <dc:contributor>Feng, Cong</dc:contributor>
    <dc:contributor>Deussen, Oliver</dc:contributor>
    <dc:creator>Deussen, Oliver</dc:creator>
    <dc:language>eng</dc:language>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:creator>Gong, Minglun</dc:creator>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/58600"/>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/4.0/"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:title>Balanced-partitioning treemapping method for digital hierarchical dataset</dcterms:title>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/58600/1/Feng_2-9d62bb4ap8dz4.pdf"/>
    <dc:rights>Attribution-NonCommercial-NoDerivatives 4.0 International</dc:rights>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:abstract xml:lang="eng">Background&lt;br /&gt;The problem of visualizing a hierarchical dataset is an important and useful technique in many real-life situations. Folder systems, stock markets, and other hierarchical-related datasets can use this technique to better understand the structure and dynamic variation of the dataset. Traditional space-filling(square)-based methods have the advantages of compact space usage and node size as opposed to diagram-based methods. Spacefilling- based methods have two main research directions: static and dynamic performance.&lt;br /&gt;&lt;br /&gt;Methods&lt;br /&gt;This study presented a treemapping method based on balanced partitioning that enables excellent aspect ratios in one variant, good temporal coherence for dynamic data in another, and in the third, a satisfactory compromise between these two aspects. To layout a treemap, all the children of a node were divided into two groups, which were then further divided until groups of single elements were reached. After this, these groups were combined to form a rectangle representing the parent node. This process was performed for each layer of the hierarchical dataset. For the first variant from the partitioning, the child elements were sorted and two groups, sized as equally as possible, were built from both big and small elements (size-balanced partition). This achieved satisfactory aspect ratios for the rectangles but less so temporal coherence (dynamic). For the second variant, the sequence of children was taken and from this, groups, sized as equally as possible, were created without the need for sorting (sequence-based, good compromise between aspect ratio and temporal coherency). For the third variant, the children were split into two groups of equal cardinalities, regardless of their size (number-balanced, worse aspect ratios but good temporal coherence).&lt;br /&gt;&lt;br /&gt;Results&lt;br /&gt;This study evaluated the aspect ratios and dynamic stability of the employed methods and proposed a new metric that measures the visual difference between rectangles during their movement to represent temporally changing inputs.&lt;br /&gt;&lt;br /&gt;Conclusion&lt;br /&gt;This study demonstrated that the proposed method of treemapping via balanced partitioning outperformed the state-of-the-art methods for several real-world datasets.</dcterms:abstract>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-09-13T07:37:21Z</dc:date>
    <dcterms:issued>2022-08</dcterms:issued>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/58600/1/Feng_2-9d62bb4ap8dz4.pdf"/>
    <dc:creator>Feng, Cong</dc:creator>
  </rdf:Description>
</rdf:RDF>
Internal note
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Contact
URL of original publication
Test date of URL
Examination date of dissertation
Method of financing
Comment on publication
Alliance license
Corresponding Authors der Uni Konstanz vorhanden
International Co-Authors
Bibliography of Konstanz
Yes
Refereed
Unknown