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

Evaluation of Graph Sampling: A Visualization Perspective

Authors Wu, Yanhong HKUST affiliated (currently or previously)
Cao, Nan
Archambault, Daniel
Shen, Qiaomu HKUST affiliated (currently or previously)
Qu, Huamin View this author's profile
Cui, Weiwei
Issue Date 2017
Source IEEE Transactions on Visualization and Computer Graphics , v. 23, (1), January 2017, article number 7539318, p. 401-410
Summary Graph sampling is frequently used to address scalability issues when analyzing large graphs. Many algorithms have been proposed to sample graphs, and the performance of these algorithms has been quantified through metrics based on graph structural properties preserved by the sampling: degree distribution, clustering coefficient, and others. However, a perspective that is missing is the impact of these sampling strategies on the resultant visualizations. In this paper, we present the results of three user studies that investigate how sampling strategies influence node-link visualizations of graphs. In particular, five sampling strategies widely used in the graph mining literature are tested to determine how well they preserve visual features in node-link diagrams. Our results show that depending on the sampling strategy used different visual features are preserved. These results provide a complimentary view to metric evaluations conducted in the graph mining literature and provide an impetus to conduct future visualization studies.
Note IEEE VIS Conference, Baltimore, MD, 23-28 October 2016
ISSN 1077-2626
Language English
Format Article
Access View full-text via DOI
View full-text via Web of Science
View full-text via Scopus