Position within the page tree

Kun-Ting Chen

Dr.

Doctoral Researcher
Visualization Research Center (VISUS)
Weiskopf Group

Contact

Allmandring 19
70569 Stuttgart
Germany
Room: 00.107

Subject

Kun-Ting’s research involves human-centred development of interactive visualisation techniques and toolkit that help analysts to explore complex data. To achieve this, Kun-Ting contributed new layout algorithms for network visualisation, novel interaction design, visual analytics toolkit for eye tracking, and extensive empirical testing and comparative user studies to evaluate and further refine these techniques.

Publications

Chen, Kun-Ting ; Dwyer, Tim ; Yang, Yalong ; Bach, Benjamin ; Marriott, Kim: GAN’SDA Wrap: Geographic And Network Structured DAta on surfaces that Wrap around. In: Proceedings of the 2022 CHI Conference on Human Factors in Computing Systems, Proceedings of the 2022 CHI Conference on Human Factors in Computing Systems. New Orleans, LA, USA : Association for Computing Machinery, 2022 — ISBN 9781450391573, S. 1–16
- BibTeX
- Link
BibTeX
@inproceedings{Chen2022, abstract = {There are many methods for projecting spherical maps onto the plane. Interactive versions of these projections allow the user to centre the region of interest. However, the effects of such interaction have not previously been evaluated. In a study with 120 participants we find interaction provides significantly more accurate area, direction and distance estimation in such projections. The surface of 3D sphere and torus topologies provides a continuous surface for uninterrupted network layout. But how best to project spherical network layouts to 2D screens has not been studied, nor have such spherical network projections been compared to torus projections. Using the most successful interactive sphere projections from our first study, we compare spherical, standard and toroidal layouts of networks for cluster and path following tasks with 96 participants, finding benefits for both spherical and toroidal layouts over standard network layouts in terms of accuracy for cluster understanding tasks.}, address = {New York, NY, USA}, author = {Chen, Kun-Ting and Dwyer, Tim and Yang, Yalong and Bach, Benjamin and Marriott, Kim}, booktitle = {Proceedings of the 2022 CHI Conference on Human Factors in Computing Systems}, day = 27, doi = {10.1145/3491102.3501928}, isbn = {9781450391573}, location = {New Orleans, LA, USA}, month = {04}, pages = {1–16}, publisher = {Association for Computing Machinery}, series = {CHI '22}, title = {GAN’SDA Wrap: Geographic And Network Structured DAta on surfaces that Wrap around}, url = {https://doi.org/10.1145/3491102.3501928}, year = 2022 }
Link
https://doi.org/10.1145/3491102.3501928
Chen, Kun-Ting ; Dwyer, Tim ; Marriott, Kim ; Bach, Benjamin: DoughNets: Visualising Networks Using Torus Wrapping. In: Proceedings of the 2020 CHI Conference on Human Factors in Computing Systems, Proceedings of the 2020 CHI Conference on Human Factors in Computing Systems. Honolulu, HI, USA : Association for Computing Machinery, 2020 — ISBN 9781450367080, S. 1–11
- BibTeX
- Link
BibTeX
@inproceedings{Chen2020, abstract = {We investigate visualisations of networks on a 2-dimensional torus topology, like an opened-up and flattened doughnut. That is, the network is drawn on a rectangular area while "wrapping" specific links around the border. Previous work on torus drawings of networks has been mostly theoretical, limited to certain classes of networks, and not evaluated by human readability studies. We offer a simple interactive layout approach applicable to general graphs. We use this to find layouts affording better aesthetics in terms of conventional measures like more equal edge length and fewer crossings. In two controlled user studies we find that torus layout with either additional context or interactive panning provided significant performance improvement (in terms of error and time) over torus layout without either of these improvements, to the point that it is comparable to standard non-torus layout.}, address = {New York, NY, USA}, author = {Chen, Kun-Ting and Dwyer, Tim and Marriott, Kim and Bach, Benjamin}, booktitle = {Proceedings of the 2020 CHI Conference on Human Factors in Computing Systems}, day = 21, doi = {10.1145/3313831.3376180}, isbn = {9781450367080}, location = {Honolulu, HI, USA}, month = {04}, pages = {1–11}, publisher = {Association for Computing Machinery}, series = {CHI '20}, title = {DoughNets: Visualising Networks Using Torus Wrapping}, url = {https://doi.org/10.1145/3313831.3376180}, year = 2020 }
Link
https://doi.org/10.1145/3313831.3376180
Chen, Kun-Ting ; Ngo, Quynh Quang ; Kurzhals, Kuno ; Marriott, Kim ; Dwyer, Tim ; Sedlmair, Michael ; Weiskopf, Daniel: Reading Strategies for Graph Visualizations That Wrap Around in Torus Topology. In: Proceedings of the 2023 Symposium on Eye Tracking Research and Applications, Proceedings of the 2023 Symposium on Eye Tracking Research and Applications. Tubingen, Germany : Association for Computing Machinery, 2023 — ISBN 9798400701504
- BibTeX
- Link
BibTeX
@inproceedings{10.1145/3588015.3589841, abstract = {We investigate reading strategies for node-link diagrams that wrap around the boundaries in a flattened torus topology by examining eye tracking data recorded in a previous controlled study. Prior work showed that torus drawing affords greater flexibility in clutter reduction than traditional node-link representations, but impedes link-and-path exploration tasks, while repeating tiles around boundaries aids comprehension. However, it remains unclear what strategies users apply in different wrapping settings. This is important for design implications for future work on more effective wrapped visualizations for network applications, and cyclic data that could benefit from wrapping. We perform visual-exploratory data analysis of gaze data, and conduct statistical tests derived from the patterns identified. Results show distinguishable gaze behaviors, with more visual glances and transitions between areas of interest in the non-replicated layout. Full-context has more successful visual searches than partial-context, but the gaze allocation indicates that the layout could be more space-efficient.}, address = {New York, NY, USA}, articleno = {67}, author = {Chen, Kun-Ting and Ngo, Quynh Quang and Kurzhals, Kuno and Marriott, Kim and Dwyer, Tim and Sedlmair, Michael and Weiskopf, Daniel}, booktitle = {Proceedings of the 2023 Symposium on Eye Tracking Research and Applications}, doi = {10.1145/3588015.3589841}, isbn = {9798400701504}, location = {Tubingen, Germany}, numpages = {7}, publisher = {Association for Computing Machinery}, series = {ETRA '23}, title = {Reading Strategies for Graph Visualizations That Wrap Around in Torus Topology}, url = {https://doi.org/10.1145/3588015.3589841}, year = 2023 }
Link
https://doi.org/10.1145/3588015.3589841
Chen, Kun-Ting ; Dwyer, Tim ; Bach, Benjamin ; Marriott, Kim: It’s a Wrap: Toroidal Wrapping of Network Visualisations Supports Cluster Understanding Tasks. In: Proceedings of the 2021 CHI Conference on Human Factors in Computing Systems, Proceedings of the 2021 CHI Conference on Human Factors in Computing Systems. Yokohama, Japan : Association for Computing Machinery, 2021 — ISBN 9781450380966, S. 1–12
- BibTeX
- Link
BibTeX
@inproceedings{Chen2021, abstract = {We explore network visualisation on a two-dimensional torus topology that continuously wraps when the viewport is panned. That is, links may be “wrapped” across the boundary, allowing additional spreading of node positions to reduce visual clutter. Recent work has investigated such pannable wrapped visualisations, finding them not worse than unwrapped drawings for small networks for path-following tasks. However, they did not evaluate larger networks nor did they consider whether torus-based layout might also better display high-level network structure like clusters. We offer two algorithms for improving toroidal layout that is completely autonomous and automatic panning of the viewport to minimiswe wrapping links. The resulting layouts afford fewer crossings, less stress, and greater cluster separation. In a study of 32 participants comparing performance in cluster understanding tasks, we find that toroidal visualisation offers significant benefits over standard unwrapped visualisation in terms of improvement in error by 62.7% and time by 32.3%.}, address = {New York, NY, USA}, author = {Chen, Kun-Ting and Dwyer, Tim and Bach, Benjamin and Marriott, Kim}, booktitle = {Proceedings of the 2021 CHI Conference on Human Factors in Computing Systems}, day = 6, doi = {10.1145/3411764.3445439}, isbn = {9781450380966}, location = {Yokohama, Japan}, month = {05}, pages = {1–12}, publisher = {Association for Computing Machinery}, series = {CHI '21}, title = {It’s a Wrap: Toroidal Wrapping of Network Visualisations Supports Cluster Understanding Tasks}, url = {https://doi.org/10.1145/3411764.3445439}, year = 2021 }
Link
https://doi.org/10.1145/3411764.3445439
„Floyd“ Mueller, Florian ; Dwyer, Tim ; Goodwin, Sarah ; Marriott, Kim ; Deng, Jialin ; D. Phan, Han ; Lin, Jionghao ; Chen, Kun-Ting ; u. a.: Data as Delight: Eating Data. In: Proceedings of the 2021 CHI Conference on Human Factors in Computing Systems, Proceedings of the 2021 CHI Conference on Human Factors in Computing Systems. Yokohama, Japan : Association for Computing Machinery, 2021 — ISBN 9781450380966
- BibTeX
- Link
BibTeX
@inproceedings{10.1145/3411764.3445218, abstract = {The HCI community has a rich history of finding new ways to engage people with data beyond the screen. With our work, we aim to expand the scope of how interaction design can engage people, arguing that “eating data” has the potential to allow people to experience “data as delight”. With reference to prior work and our design research findings, we discuss the advantages and the challenges of this approach to integrating data and food. We then identify four themes to guide the design of engagements with data through food: food form, food commensality, food ephemerality, and emotional response to food. Within these design themes, we articulate twelve insights for interaction designers to use when working on serving data as delight.}, address = {New York, NY, USA}, articleno = {621}, author = {'Floyd' Mueller, Florian and Dwyer, Tim and Goodwin, Sarah and Marriott, Kim and Deng, Jialin and D. Phan, Han and Lin, Jionghao and Chen, Kun-Ting and Wang, Yan and Ashok Khot, Rohit}, booktitle = {Proceedings of the 2021 CHI Conference on Human Factors in Computing Systems}, doi = {10.1145/3411764.3445218}, isbn = {9781450380966}, location = {Yokohama, Japan}, numpages = {14}, publisher = {Association for Computing Machinery}, series = {CHI '21}, title = {Data as Delight: Eating Data}, url = {https://doi.org/10.1145/3411764.3445218}, year = 2021 }
Link
https://doi.org/10.1145/3411764.3445218
CHEN, KUN-TING: It’s a Wrap! Visualisations that Wrap Around Cylindrical, Toroidal, or Spherical Topologies, Monash University (2022)
- BibTeX
- Link
BibTeX
@article{https://doi.org/10.26180/20723092.v1, author = {CHEN, KUN-TING}, copyright = {In Copyright}, doi = {10.26180/20723092.V1}, publisher = {Monash University}, title = {It’s a Wrap! Visualisations that Wrap Around Cylindrical, Toroidal, or Spherical Topologies}, url = {https://bridges.monash.edu/articles/thesis/It_s_a_Wrap_Visualisations_that_Wrap_Around_Cylindrical_Toroidal_or_Spherical_Topologies/20723092/1}, year = 2022 }
Link
https://bridges.monash.edu/articles/thesis/It_s_a_Wrap_Visualisations_that_Wrap_Around_Cylindrical_Toroidal_or_Spherical_Topologies/20723092/1
Chen, Kun-Ting ; Dwyer, Tim ; Bach, Benjamin ; Marriott, Kim: Rotate or Wrap? Interactive Visualisations of Cyclical Data on Cylindrical or Toroidal Topologies. In: IEEE Transactions on Visualization and Computer Graphics, IEEE Transactions on Visualization and Computer Graphics. Bd. 28 (2022), Nr. 1, S. 727–736
- BibTeX
BibTeX
@article{9552227, abstract = {In this paper, we report on a study of visual representations for cyclical data and the effect of interactively wrapping a bar chart ‘around its boundaries’. Compared to linear bar chart, polar (or radial) visualisations have the advantage that cyclical data can be presented continuously without mentally bridging the visual ‘cut’ across the left-and-right boundaries. To investigate this hypothesis and to assess the effect the cut has on analysis performance, this paper presents results from a crowdsourced, controlled experiment with 72 participants comparing new continuous panning technique to linear bar charts (interactive wrapping). Our results show that bar charts with interactive wrapping lead to less errors compared to standard bar charts or polar charts. Inspired by these results, we generalise the concept of interactive wrapping to other visualisations for cyclical or relational data. We describe a design space based on the concept of one-dimensional wrapping and two-dimensional wrapping, linked to two common 3D topologies; cylinder and torus that can be used to metaphorically explain one- and two-dimensional wrapping. This design space suggests that interactive wrapping is widely applicable to many different data types.}, author = {Chen, Kun-Ting and Dwyer, Tim and Bach, Benjamin and Marriott, Kim}, doi = {10.1109/TVCG.2021.3114693}, issn = {1941-0506}, journal = {IEEE Transactions on Visualization and Computer Graphics}, month = {01}, number = 1, pages = {727-736}, title = {Rotate or Wrap? Interactive Visualisations of Cyclical Data on Cylindrical or Toroidal Topologies}, volume = 28, year = 2022 }
Yang, Chih-Chiang ; Chen, Kun-Ting ; Chen, Chien ; Chen, Jing-Ying: Market-Based Load Balancing for Distributed Heterogeneous Multi-Resource Servers. In: 2009 15th International Conference on Parallel and Distributed Systems, 2009 15th International Conference on Parallel and Distributed Systems, 2009, S. 158–165
- BibTeX
BibTeX
@inproceedings{5395241, abstract = {To cope with rapidly increasing Internet usage nowadays, providing Internet services using multiple servers has become a necessity. To ensure sufficient service quality and server utilization at the same time, effective methods are needed to spread load among servers properly. Existing load balancing methods often assume servers are homogeneous and consider only one type of resource, such as CPU. Such methods suffer from the fact that different requests often demand multiple types of resources with different requirements; trying to balance the usage of only one resource type may induce an inadvertent performance bottleneck, leading to low resource utilization and service quality. To address this problem, we propose a load balancing method based on the concept of distributed market mechanism, where requests are priced with respect to the load of multiple resources on each server. By migrating jobs among servers to balance inter-server load and minimize intra-server job cost at the same time, our method shows significant improvement in terms of load imbalance degrees, server utilization, and response time when compared to other published methods, especially when server heterogeneity increases.}, author = {Yang, Chih-Chiang and Chen, Kun-Ting and Chen, Chien and Chen, Jing-Ying}, booktitle = {2009 15th International Conference on Parallel and Distributed Systems}, doi = {10.1109/ICPADS.2009.96}, issn = {1521-9097}, month = {12}, pages = {158-165}, title = {Market-Based Load Balancing for Distributed Heterogeneous Multi-Resource Servers}, year = 2009 }
Chen, Kun-Ting ; Chen, Chien ; Wang, Po-Hsiang: Network aware load-balancing via parallel VM migration for data centers. In: 2014 23rd International Conference on Computer Communication and Networks (ICCCN), 2014 23rd International Conference on Computer Communication and Networks (ICCCN), 2014, S. 1–8
- BibTeX
BibTeX
@inproceedings{6911748, abstract = {It becomes a challenge to design an efficient load balancing method via live virtual machine (VM) migration without degrading application performance. Two major performance impacts on hosted applications that run on a VM are the system load balancing degree and the total time till a balanced state is reached. Existing load balancing methods usually ignore the VM migration time overhead. In contrast to sequential migration-based load balancing, this paper proposes using a network-topology aware parallel migration to speed up the load balancing process in a data center. We transform the VM migration-based multi-resource load-balancing problem into a minimum weighted matching problem over a weighted bipartite graph. By obtaining the minimum weighted matching pairs through the Hungarian method, we parallel migrate multiple VMs from overloaded hosts to underutilized hosts to reduce the time it takes to reach a load balanced state. The experimental results show that our algorithm not only obtains a compatible multi-resource load balancing performance but also improves the balanced time which results in at most a 10% throughput gain by assuming a large batch application running on all VMs.}, author = {Chen, Kun-Ting and Chen, Chien and Wang, Po-Hsiang}, booktitle = {2014 23rd International Conference on Computer Communication and Networks (ICCCN)}, doi = {10.1109/ICCCN.2014.6911748}, issn = {1095-2055}, month = {08}, pages = {1-8}, title = {Network aware load-balancing via parallel VM migration for data centers}, year = 2014 }

Teaching

10/2022-03/2023: Information Visualisation & Visual Analytics, University of Stuttgart
2011: Vehicular Mobile Commerce with Android Platform, National Chiao Tung University, Taiwan
2010: VLSI programming, National Chiao Tung University, Taiwan
2009: C++ Programming, National Chiao Tung University, Taiwan
2008: C Programming, National Chiao Tung University, Taiwan

Vita

Education and Scientific Qualification

04/2019-09/2022: PhD in Human-Centred Computing, Monash University, Australia
PhD thesis: It's a Wrap! Visualisations that Wrap Around Cylindrical, Toroidal, or Spherical Topologies
10/2007-08/2009: Master in Computer Science & Engineering, National Chiao Tung University, Taiwan. Master thesis: "A Token-based Approach to Load Balancing of Heterogeneous, Multi-resource Systems"
09/2002-06/2006: Bachelor in Computer Science & Engineering, Tatung University, Taiwan. Bachelor thesis: "Real-Time Dynamics Vehicle Chasing Gems game"

Professional Experience

09/2017-04/2019: MSI Global Pte Ltd, Consultant, Subsidy of Land Transport Authority, Singapore
09/2015-09/2017: Senior Software Engineer, Land Transport Authority, Singapore
10/2013-09/2015: Software Engineer, Trek 2000 International Ltd, Singapore

Awards

Special Recognitions for one Outstanding Review at ACM CHI 2022

Reviews

Journals

IEEE Computer Graphics and Applications (CG&A): 2023
IEEE Transactions on Visualization and Computer Graphics (TVCG): 2021-2022
Visual Informatics (Elsevier): 2021

Conferences

ACM CHI Conference on Human Factors in Computing Systems: 2021-2022
IEEE Visualization Conference (VIS): 2021-2022
IEEE Pacific Visualization Symposium (PacificVis): 2022-2023
Eurographics conference on visualization (EuroVis): 2023
International Symposium on Graph Drawing and Network Visualization (GD) – 2021
ACM Symposium on Eye Tracking Research & Application (ETRA): 2022
ACM International Conference on Mobile Human-Computer Interaction (MobileHCI): 2022
China Visualization and Visual Analytics Conference (ChinaVis): 2021-2022
IEEE Conference on Virtual Reality and 3D User Interfaces (IEEE VR): 2022-2023
IEEE International Symposium on Mixed and Augmented Reality (ISMAR): 2021-2022
Visualization in Data Science (VDS): 2021

Invited Talks and Seminars

Organising committees

2023: Student Volunteer Co-Chair – IEEE Visualisation
2022: Student Volunteer Co-Chair – IEEE Visualisation

Kun-Ting Chen

Contact

Subject

Publications

BibTeX

Link

BibTeX

Link

BibTeX

Link

BibTeX

Link

BibTeX

Link

BibTeX

Link

BibTeX

BibTeX

BibTeX

Teaching

Vita

Awards

Reviews

Invited Talks and Seminars

Audience

Formalities

Services

Organization

Kun-Ting Chen

Contact

Subject

Publications

BibTeX

Link

BibTeX

Link

BibTeX

Link

BibTeX

Link

BibTeX

Link

BibTeX

Link

BibTeX

BibTeX

BibTeX

Teaching

Vita

Awards

Reviews

Invited Talks and Seminars

Here you can reach us

Audience

Formalities

Services

Organization