No Cover Image

Conference Paper/Proceeding/Abstract 13284 views 280 downloads

The Turing Test for Graph Drawing Algorithms

Helen C. Purchase Orcid Logo, Daniel Archambault Orcid Logo, Stephen Kobourov Orcid Logo, Martin Nöllenburg Orcid Logo, Sergey Pupyrev Orcid Logo, Hsiang-Yun Wu Orcid Logo

Lecture Notes in Computer Science, Volume: 12590, Pages: 466 - 481

Swansea University Author: Daniel Archambault Orcid Logo

Check full text

DOI (Published version): 10.1007/978-3-030-68766-3_36

Abstract

Do algorithms for drawing graphs pass the Turing Test? That is, are their outputs indistinguishable from graphs drawn by humans? We address this question through a human-centred experiment, focusing on `small' graphs, of a size for which it would be reasonable for someone to choose to draw the...

Full description

Published in: Lecture Notes in Computer Science
ISBN: 9783030687656 9783030687663
ISSN: 0302-9743 1611-3349
Published: Cham Springer International Publishing 2021
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa55001
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2020-08-18T09:16:57Z
last_indexed 2022-06-15T03:11:08Z
id cronfa55001
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2022-06-14T15:20:18.0696152</datestamp><bib-version>v2</bib-version><id>55001</id><entry>2020-08-18</entry><title>The Turing Test for Graph Drawing Algorithms</title><swanseaauthors><author><sid>8fa6987716a22304ef04d3c3d50ef266</sid><ORCID>0000-0003-4978-8479</ORCID><firstname>Daniel</firstname><surname>Archambault</surname><name>Daniel Archambault</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2020-08-18</date><deptcode>SCS</deptcode><abstract>Do algorithms for drawing graphs pass the Turing Test? That is, are their outputs indistinguishable from graphs drawn by humans? We address this question through a human-centred experiment, focusing on `small' graphs, of a size for which it would be reasonable for someone to choose to draw the graph manually. Overall, we find that hand-drawn layouts can be distinguished from those generated by graph drawing algorithms, although this is not always the case for graphs drawn by force-directed or multi-dimensional scaling algorithms, making these good candidates for Turing Test success. We show that, in general, hand-drawn graphs are judged to be of higher quality than automatically generated ones, although this result varies with graph size and algorithm.</abstract><type>Conference Paper/Proceeding/Abstract</type><journal>Lecture Notes in Computer Science</journal><volume>12590</volume><journalNumber/><paginationStart>466</paginationStart><paginationEnd>481</paginationEnd><publisher>Springer International Publishing</publisher><placeOfPublication>Cham</placeOfPublication><isbnPrint>9783030687656</isbnPrint><isbnElectronic>9783030687663</isbnElectronic><issnPrint>0302-9743</issnPrint><issnElectronic>1611-3349</issnElectronic><keywords>Empirical studies, Graph Drawing Algorithms, Turing Test</keywords><publishedDay>14</publishedDay><publishedMonth>2</publishedMonth><publishedYear>2021</publishedYear><publishedDate>2021-02-14</publishedDate><doi>10.1007/978-3-030-68766-3_36</doi><url/><notes/><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2022-06-14T15:20:18.0696152</lastEdited><Created>2020-08-18T10:07:49.5017059</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - Computer Science</level></path><authors><author><firstname>Helen C.</firstname><surname>Purchase</surname><orcid>0000-0001-6994-4446</orcid><order>1</order></author><author><firstname>Daniel</firstname><surname>Archambault</surname><orcid>0000-0003-4978-8479</orcid><order>2</order></author><author><firstname>Stephen</firstname><surname>Kobourov</surname><orcid>0000-0002-0477-2724</orcid><order>3</order></author><author><firstname>Martin</firstname><surname>N&#xF6;llenburg</surname><orcid>0000-0003-0454-3937</orcid><order>4</order></author><author><firstname>Sergey</firstname><surname>Pupyrev</surname><orcid>0000-0003-4089-673x</orcid><order>5</order></author><author><firstname>Hsiang-Yun</firstname><surname>Wu</surname><orcid>0000-0003-1028-0010</orcid><order>6</order></author></authors><documents><document><filename>55001__17990__968085dc7d504dbe8a91a1e9fbe2aef3.pdf</filename><originalFilename>55001.pdf</originalFilename><uploaded>2020-08-19T11:16:52.1156759</uploaded><type>Output</type><contentLength>3931375</contentLength><contentType>application/pdf</contentType><version>Accepted Manuscript</version><cronfaStatus>true</cronfaStatus><copyrightCorrect>true</copyrightCorrect><language>eng</language></document></documents><OutputDurs/></rfc1807>
spelling 2022-06-14T15:20:18.0696152 v2 55001 2020-08-18 The Turing Test for Graph Drawing Algorithms 8fa6987716a22304ef04d3c3d50ef266 0000-0003-4978-8479 Daniel Archambault Daniel Archambault true false 2020-08-18 SCS Do algorithms for drawing graphs pass the Turing Test? That is, are their outputs indistinguishable from graphs drawn by humans? We address this question through a human-centred experiment, focusing on `small' graphs, of a size for which it would be reasonable for someone to choose to draw the graph manually. Overall, we find that hand-drawn layouts can be distinguished from those generated by graph drawing algorithms, although this is not always the case for graphs drawn by force-directed or multi-dimensional scaling algorithms, making these good candidates for Turing Test success. We show that, in general, hand-drawn graphs are judged to be of higher quality than automatically generated ones, although this result varies with graph size and algorithm. Conference Paper/Proceeding/Abstract Lecture Notes in Computer Science 12590 466 481 Springer International Publishing Cham 9783030687656 9783030687663 0302-9743 1611-3349 Empirical studies, Graph Drawing Algorithms, Turing Test 14 2 2021 2021-02-14 10.1007/978-3-030-68766-3_36 COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University 2022-06-14T15:20:18.0696152 2020-08-18T10:07:49.5017059 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Helen C. Purchase 0000-0001-6994-4446 1 Daniel Archambault 0000-0003-4978-8479 2 Stephen Kobourov 0000-0002-0477-2724 3 Martin Nöllenburg 0000-0003-0454-3937 4 Sergey Pupyrev 0000-0003-4089-673x 5 Hsiang-Yun Wu 0000-0003-1028-0010 6 55001__17990__968085dc7d504dbe8a91a1e9fbe2aef3.pdf 55001.pdf 2020-08-19T11:16:52.1156759 Output 3931375 application/pdf Accepted Manuscript true true eng
title The Turing Test for Graph Drawing Algorithms
spellingShingle The Turing Test for Graph Drawing Algorithms
Daniel Archambault
title_short The Turing Test for Graph Drawing Algorithms
title_full The Turing Test for Graph Drawing Algorithms
title_fullStr The Turing Test for Graph Drawing Algorithms
title_full_unstemmed The Turing Test for Graph Drawing Algorithms
title_sort The Turing Test for Graph Drawing Algorithms
author_id_str_mv 8fa6987716a22304ef04d3c3d50ef266
author_id_fullname_str_mv 8fa6987716a22304ef04d3c3d50ef266_***_Daniel Archambault
author Daniel Archambault
author2 Helen C. Purchase
Daniel Archambault
Stephen Kobourov
Martin Nöllenburg
Sergey Pupyrev
Hsiang-Yun Wu
format Conference Paper/Proceeding/Abstract
container_title Lecture Notes in Computer Science
container_volume 12590
container_start_page 466
publishDate 2021
institution Swansea University
isbn 9783030687656
9783030687663
issn 0302-9743
1611-3349
doi_str_mv 10.1007/978-3-030-68766-3_36
publisher Springer International Publishing
college_str Faculty of Science and Engineering
hierarchytype
hierarchy_top_id facultyofscienceandengineering
hierarchy_top_title Faculty of Science and Engineering
hierarchy_parent_id facultyofscienceandengineering
hierarchy_parent_title Faculty of Science and Engineering
department_str School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science
document_store_str 1
active_str 0
description Do algorithms for drawing graphs pass the Turing Test? That is, are their outputs indistinguishable from graphs drawn by humans? We address this question through a human-centred experiment, focusing on `small' graphs, of a size for which it would be reasonable for someone to choose to draw the graph manually. Overall, we find that hand-drawn layouts can be distinguished from those generated by graph drawing algorithms, although this is not always the case for graphs drawn by force-directed or multi-dimensional scaling algorithms, making these good candidates for Turing Test success. We show that, in general, hand-drawn graphs are judged to be of higher quality than automatically generated ones, although this result varies with graph size and algorithm.
published_date 2021-02-14T04:08:55Z
_version_ 1763753627811315712
score 11.01353

Similar Items