Demonstrating interactive multi-resolution large graph exploration

Zhiyuan Lin; Nan Cao; Hanghang Tong; Fei Wang; U. Kang; Duen Horng Polo Chau

doi:10.1109/ICDMW.2013.124

Demonstrating interactive multi-resolution large graph exploration

Zhiyuan Lin, Nan Cao, Hanghang Tong, Fei Wang, U. Kang, Duen Horng Polo Chau

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

11 Scopus citations

Abstract

We present a scalable, interactive graph visualization system to support multi-resolution exploration of million-node graphs in real time. By adapting a state-of-the-art graph algorithm, called Slash & Burn, our prototype system generates a multi-resolution view of graphs with up to 69 million edges under a few seconds. We are experimenting with interaction techniques that help users interactively explore this overview and drill down into details. While many visualization systems for million-node graphs require dedicated servers to process the graphs, our prototype runs on a commodity laptop computer. We aim to handle graphs that are at least an order of magnitude (100M edges) larger than what current systems can support. We demonstrate our system's usage, benefits, and scalability using two large graphs: a Live Journal friendship network with 69 million edges, and a related-movies network from Rotten Tomatoes with 200K edges.

Original language	English (US)
Title of host publication	Proceedings - IEEE 13th International Conference on Data Mining Workshops, ICDMW 2013
Publisher	IEEE Computer Society
Pages	1097-1100
Number of pages	4
DOIs	https://doi.org/10.1109/ICDMW.2013.124
State	Published - 2013
Externally published	Yes
Event	2013 13th IEEE International Conference on Data Mining Workshops, ICDMW 2013 - Dallas, TX, United States Duration: Dec 7 2013 → Dec 10 2013

Other

Other	2013 13th IEEE International Conference on Data Mining Workshops, ICDMW 2013
Country/Territory	United States
City	Dallas, TX
Period	12/7/13 → 12/10/13

Keywords

Graph decomposition
Hubs and spokes
Interactive graph visualization
Multi-resolution

ASJC Scopus subject areas

Software

Access to Document

10.1109/ICDMW.2013.124

Cite this

Lin, Z, Cao, N, Tong, H, Wang, F, Kang, U & Chau, DHP 2013, Demonstrating interactive multi-resolution large graph exploration. in Proceedings - IEEE 13th International Conference on Data Mining Workshops, ICDMW 2013., 6754046, IEEE Computer Society, pp. 1097-1100, 2013 13th IEEE International Conference on Data Mining Workshops, ICDMW 2013, Dallas, TX, United States, 12/7/13. https://doi.org/10.1109/ICDMW.2013.124

@inproceedings{935fee62c7e5403ca390d364250500d6,

title = "Demonstrating interactive multi-resolution large graph exploration",

abstract = "We present a scalable, interactive graph visualization system to support multi-resolution exploration of million-node graphs in real time. By adapting a state-of-the-art graph algorithm, called Slash & Burn, our prototype system generates a multi-resolution view of graphs with up to 69 million edges under a few seconds. We are experimenting with interaction techniques that help users interactively explore this overview and drill down into details. While many visualization systems for million-node graphs require dedicated servers to process the graphs, our prototype runs on a commodity laptop computer. We aim to handle graphs that are at least an order of magnitude (100M edges) larger than what current systems can support. We demonstrate our system's usage, benefits, and scalability using two large graphs: a Live Journal friendship network with 69 million edges, and a related-movies network from Rotten Tomatoes with 200K edges.",

keywords = "Graph decomposition, Hubs and spokes, Interactive graph visualization, Multi-resolution",

author = "Zhiyuan Lin and Nan Cao and Hanghang Tong and Fei Wang and U. Kang and Chau, {Duen Horng Polo}",

year = "2013",

doi = "10.1109/ICDMW.2013.124",

language = "English (US)",

pages = "1097--1100",

booktitle = "Proceedings - IEEE 13th International Conference on Data Mining Workshops, ICDMW 2013",

publisher = "IEEE Computer Society",

note = "2013 13th IEEE International Conference on Data Mining Workshops, ICDMW 2013 ; Conference date: 07-12-2013 Through 10-12-2013",

}

TY - GEN

T1 - Demonstrating interactive multi-resolution large graph exploration

AU - Lin, Zhiyuan

AU - Cao, Nan

AU - Tong, Hanghang

AU - Wang, Fei

AU - Kang, U.

AU - Chau, Duen Horng Polo

PY - 2013

Y1 - 2013

N2 - We present a scalable, interactive graph visualization system to support multi-resolution exploration of million-node graphs in real time. By adapting a state-of-the-art graph algorithm, called Slash & Burn, our prototype system generates a multi-resolution view of graphs with up to 69 million edges under a few seconds. We are experimenting with interaction techniques that help users interactively explore this overview and drill down into details. While many visualization systems for million-node graphs require dedicated servers to process the graphs, our prototype runs on a commodity laptop computer. We aim to handle graphs that are at least an order of magnitude (100M edges) larger than what current systems can support. We demonstrate our system's usage, benefits, and scalability using two large graphs: a Live Journal friendship network with 69 million edges, and a related-movies network from Rotten Tomatoes with 200K edges.

AB - We present a scalable, interactive graph visualization system to support multi-resolution exploration of million-node graphs in real time. By adapting a state-of-the-art graph algorithm, called Slash & Burn, our prototype system generates a multi-resolution view of graphs with up to 69 million edges under a few seconds. We are experimenting with interaction techniques that help users interactively explore this overview and drill down into details. While many visualization systems for million-node graphs require dedicated servers to process the graphs, our prototype runs on a commodity laptop computer. We aim to handle graphs that are at least an order of magnitude (100M edges) larger than what current systems can support. We demonstrate our system's usage, benefits, and scalability using two large graphs: a Live Journal friendship network with 69 million edges, and a related-movies network from Rotten Tomatoes with 200K edges.

KW - Graph decomposition

KW - Hubs and spokes

KW - Interactive graph visualization

KW - Multi-resolution

UR - http://www.scopus.com/inward/record.url?scp=84898051737&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84898051737&partnerID=8YFLogxK

U2 - 10.1109/ICDMW.2013.124

DO - 10.1109/ICDMW.2013.124

M3 - Conference contribution

AN - SCOPUS:84898051737

SP - 1097

EP - 1100

BT - Proceedings - IEEE 13th International Conference on Data Mining Workshops, ICDMW 2013

PB - IEEE Computer Society

T2 - 2013 13th IEEE International Conference on Data Mining Workshops, ICDMW 2013

Y2 - 7 December 2013 through 10 December 2013

ER -

Demonstrating interactive multi-resolution large graph exploration

Abstract

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this