No Cover Image

Journal article 647 views

GrouseFlocks: Steerable Exploration of Graph Hierarchy Space / D Archambault; T Munzner; D Auber; Daniel Archambault

IEEE Transactions on Visualization and Computer Graphics, Volume: 14, Issue: 4, Pages: 900 - 913

Swansea University Author: Daniel, Archambault

Full text not available from this repository: check for access using links below.

Check full text

DOI (Published version): 10.1109/TVCG.2008.34

Abstract

Several previous systems allow users to interactively explore a large input graph through cuts of a superimposed hierarchy. This hierarchy is often created using clustering algorithms or topological features present in the graph. However, many graphs have domain-specific attributes associated with t...

Full description

Published in: IEEE Transactions on Visualization and Computer Graphics
ISSN: 1077-2626
Published: 2008
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa13911
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2013-07-23T12:11:18Z
last_indexed 2018-02-09T04:44:58Z
id cronfa13911
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2015-07-01T12:45:24.1096325</datestamp><bib-version>v2</bib-version><id>13911</id><entry>2013-01-18</entry><title>GrouseFlocks: Steerable Exploration of Graph Hierarchy Space</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>2013-01-18</date><deptcode>SCS</deptcode><abstract>Several previous systems allow users to interactively explore a large input graph through cuts of a superimposed hierarchy. This hierarchy is often created using clustering algorithms or topological features present in the graph. However, many graphs have domain-specific attributes associated with the nodes and edges which could be used to create many possible hierarchies providing unique views of the input graph. GrouseFlocks is a system for the exploration of this graph hierarchy space. By allowing users to see several different possible hierarchies on the same graph, the system helps users investigate graph hierarchy space instead of a single, fixed hierarchy. GrouseFlocks provides a simple set of operations so that users can create and modify their graph hierarchies based on selections. These selections can be made manually or based on patterns in the attribute data provided with the graph. It provides feedback to the user within seconds, allowing interactive exploration of this space.</abstract><type>Journal Article</type><journal>IEEE Transactions on Visualization and Computer Graphics</journal><volume>14</volume><journalNumber>4</journalNumber><paginationStart>900</paginationStart><paginationEnd>913</paginationEnd><publisher/><issnPrint>1077-2626</issnPrint><issnElectronic/><keywords/><publishedDay>31</publishedDay><publishedMonth>7</publishedMonth><publishedYear>2008</publishedYear><publishedDate>2008-07-31</publishedDate><doi>10.1109/TVCG.2008.34</doi><url/><notes/><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2015-07-01T12:45:24.1096325</lastEdited><Created>2013-01-18T12:29:46.4423693</Created><path><level id="1">College of Science</level><level id="2">Computer Science</level></path><authors><author><firstname>D</firstname><surname>Archambault</surname><order>1</order></author><author><firstname>T</firstname><surname>Munzner</surname><order>2</order></author><author><firstname>D</firstname><surname>Auber</surname><order>3</order></author><author><firstname>Daniel</firstname><surname>Archambault</surname><orcid>0000-0003-4978-8479</orcid><order>4</order></author></authors><documents/><OutputDurs/></rfc1807>
spelling 2015-07-01T12:45:24.1096325 v2 13911 2013-01-18 GrouseFlocks: Steerable Exploration of Graph Hierarchy Space 8fa6987716a22304ef04d3c3d50ef266 0000-0003-4978-8479 Daniel Archambault Daniel Archambault true false 2013-01-18 SCS Several previous systems allow users to interactively explore a large input graph through cuts of a superimposed hierarchy. This hierarchy is often created using clustering algorithms or topological features present in the graph. However, many graphs have domain-specific attributes associated with the nodes and edges which could be used to create many possible hierarchies providing unique views of the input graph. GrouseFlocks is a system for the exploration of this graph hierarchy space. By allowing users to see several different possible hierarchies on the same graph, the system helps users investigate graph hierarchy space instead of a single, fixed hierarchy. GrouseFlocks provides a simple set of operations so that users can create and modify their graph hierarchies based on selections. These selections can be made manually or based on patterns in the attribute data provided with the graph. It provides feedback to the user within seconds, allowing interactive exploration of this space. Journal Article IEEE Transactions on Visualization and Computer Graphics 14 4 900 913 1077-2626 31 7 2008 2008-07-31 10.1109/TVCG.2008.34 COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University 2015-07-01T12:45:24.1096325 2013-01-18T12:29:46.4423693 College of Science Computer Science D Archambault 1 T Munzner 2 D Auber 3 Daniel Archambault 0000-0003-4978-8479 4
title GrouseFlocks: Steerable Exploration of Graph Hierarchy Space
spellingShingle GrouseFlocks: Steerable Exploration of Graph Hierarchy Space
Daniel, Archambault
title_short GrouseFlocks: Steerable Exploration of Graph Hierarchy Space
title_full GrouseFlocks: Steerable Exploration of Graph Hierarchy Space
title_fullStr GrouseFlocks: Steerable Exploration of Graph Hierarchy Space
title_full_unstemmed GrouseFlocks: Steerable Exploration of Graph Hierarchy Space
title_sort GrouseFlocks: Steerable Exploration of Graph Hierarchy Space
author_id_str_mv 8fa6987716a22304ef04d3c3d50ef266
author_id_fullname_str_mv 8fa6987716a22304ef04d3c3d50ef266_***_Daniel, Archambault
author Daniel, Archambault
author2 D Archambault
T Munzner
D Auber
Daniel Archambault
format Journal article
container_title IEEE Transactions on Visualization and Computer Graphics
container_volume 14
container_issue 4
container_start_page 900
publishDate 2008
institution Swansea University
issn 1077-2626
doi_str_mv 10.1109/TVCG.2008.34
college_str College of Science
hierarchytype
hierarchy_top_id collegeofscience
hierarchy_top_title College of Science
hierarchy_parent_id collegeofscience
hierarchy_parent_title College of Science
department_str Computer Science{{{_:::_}}}College of Science{{{_:::_}}}Computer Science
document_store_str 0
active_str 0
description Several previous systems allow users to interactively explore a large input graph through cuts of a superimposed hierarchy. This hierarchy is often created using clustering algorithms or topological features present in the graph. However, many graphs have domain-specific attributes associated with the nodes and edges which could be used to create many possible hierarchies providing unique views of the input graph. GrouseFlocks is a system for the exploration of this graph hierarchy space. By allowing users to see several different possible hierarchies on the same graph, the system helps users investigate graph hierarchy space instead of a single, fixed hierarchy. GrouseFlocks provides a simple set of operations so that users can create and modify their graph hierarchies based on selections. These selections can be made manually or based on patterns in the attribute data provided with the graph. It provides feedback to the user within seconds, allowing interactive exploration of this space.
published_date 2008-07-31T03:26:48Z
_version_ 1702416831782846464
score 10.800125