Laplacian-based dynamic graph visualization

Che, L; Liang, J; Yuan, X; Shen, J; Xu, J; Li, Y

Laplacian-based dynamic graph visualization

Che, L Liang, J

Yuan, X Shen, J Xu, J Li, Y

Permalink

Publication Type:: Conference Proceeding
Citation:: IEEE Pacific Visualization Symposium, 2015, 2015-July pp. 69 - 73
Issue Date:: 2015-01-01

Closed Access

	Filename	Description	Size
	Laplacian.pdf	Published version	1.92 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Che, L	en_US
dc.contributor.author	Liang, J https://orcid.org/0000-0001-7179-5208	en_US
dc.contributor.author	Yuan, X	en_US
dc.contributor.author	Shen, J	en_US
dc.contributor.author	Xu, J	en_US
dc.contributor.author	Li, Y	en_US
dc.date.issued	2015-01-01	en_US
dc.identifier.citation	IEEE Pacific Visualization Symposium, 2015, 2015-July pp. 69 - 73	en_US
dc.identifier.isbn	9781467368797	en_US
dc.identifier.issn	2165-8765	en_US
dc.identifier.uri	http://hdl.handle.net/10453/116128
dc.description.abstract	© 2015 IEEE. Visualizing dynamic graphs are challenging due to the difficulty to preserving a coherent mental map of the changing graphs. In this paper, we propose a novel layout algorithm which is capable of maintaining the overall structure of a sequence graphs. Through Laplacian constrained distance embedding, our method works online and maintains the aesthetic of individual graphs and the shape similarity between adjacent graphs in the sequence. By preserving the shape of the same graph components across different time steps, our method can effectively help users track and gain insights into the graph changes. Two datasets are tested to demonstrate the effectiveness of our algorithm.	en_US
dc.relation.ispartof	IEEE Pacific Visualization Symposium	en_US
dc.relation.isbasedon	10.1109/PACIFICVIS.2015.7156358	en_US
dc.title	Laplacian-based dynamic graph visualization	en_US
dc.type	Conference Proceeding
utslib.citation.volume	2015-July	en_US
utslib.for	080602 Computer-Human Interaction	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US
pubs.volume	2015-July	en_US

Abstract:

© 2015 IEEE. Visualizing dynamic graphs are challenging due to the difficulty to preserving a coherent mental map of the changing graphs. In this paper, we propose a novel layout algorithm which is capable of maintaining the overall structure of a sequence graphs. Through Laplacian constrained distance embedding, our method works online and maintains the aesthetic of individual graphs and the shape similarity between adjacent graphs in the sequence. By preserving the shape of the same graph components across different time steps, our method can effectively help users track and gain insights into the graph changes. Two datasets are tested to demonstrate the effectiveness of our algorithm.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/116128