A Visual Network Analysis Method for Large Scale Parallel I/O Systems
Jason Cope, Kamil Iskra, Kwan-Liu Ma, Chris W. Muelder, Robert Ross, and Carmen Sigovan
In Proceedings of 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)
Parallel applications rely on I/O to load data, store end results, and protect partial results from being lost to system failure. Parallel I/O performance thus has a direct and significant
impact on application performance. Because supercomputer I/O
systems are large and complex, one cannot directly analyze their activity traces. While several visual or automated analysis tools for large-scale HPC log data exist, analysis research in the high-performance computing field is geared toward computation performance rather than I/O performance ...
Clustering, Visualizing, and Navigating for Large Dynamic Graphs
Arnaud Sallaberry, Chris W. Muelder, and Kwan-Liu Ma
In Proceedings of Proceedings of Graph Drawing 2012
In this paper, we present a new approach to exploring dynamic
graphs. We first propose a new clustering algorithm for dynamic
graphs which nds an ideal clustering for each time-step and links the clusters together. The resulting time-varying clusters are then used to define two visual representations. The rst view is an overview that shows how clusters evolve over time and provides an interface to find and select interesting time-steps ...
Ambiguity-Free Edge-Bundling for Interactive Graph Visualization
sheng-Jie Luo, Chun-Liang Liu, Bing-Yu Chen, and Kwan-Liu Ma
IEEE Transactions on Visualization and Computer Graphics
Graph visualization has been widely used to understand and present both global structural and local adjacency information in relational datasets (e.g., transportation networks, citation networks, or social networks). Large graphs, however, are difficult to visualize because fast layout and good clarity are not always easily achieved. When the number of edges is large, edge bundling can be used to improve the clarity, but in many cases, the edges could be still too cluttered to permit correct interpretation of the relations between nodes ...
Content Based Graph Visualization of Audio Data for Music Library Navigation
Chris W. Muelder, Thomas Provan, and Kwan-Liu Ma
In Proceedings of The IEEE International Symposium on Multimedia (ISM2010)
As a user's digital music collection grows, it can become difficult to navigate. Music library programs aid in this task by organizing music according to tags such as artist or title. However these generally utilize a text based interface, and they do not take into account the content of the music itself. As such, they do not handle untagged or mistagged music well. Automated metrics exist, but are not as widely used since they have the potential to be unreliable. This paper presents a graph-based visual interface for exploring a library of music based on analysis of the content of the music rather than tag information, which allows the user to navigate a music library thematically. ...
A Hybrid Space-Filling and Force-Directed Layout Method for Visualizing Multiple-Category Graphs
Takayuki Itoh, Chris W. Muelder, Kwan-Liu Ma, and Jun Sese
In Proceedings of IEEE Pacific Visualization 2009 Symposium
Many graphs used in real-world applications consist of nodes belonging to more than one category. We call such graph ”multiplecategory graphs”. Social networks are typical examples of multiplecategory graphs: nodes are persons, links are friendships, and categories are communities that the persons belong to. It is often helpful
to visualize both connectivity and categories of the graphs simultaneously. In this paper, we present a new visualization technique for multiple-category graphs ... ...
Rapid Graph Layout Using Space Filling Curves
Chris W. Muelder and Kwan-Liu Ma
In Proceedings of IEEE Information Visualization Conference (InfoVis)
Network data frequently arises in a wide variety of fields, and node-link diagrams are a very natural and intuitive representation of such data. In order for a node-link diagram to be effective, the nodes must be arranged well on the screen. While many graph layout algorithms exist for this purpose, they often have limitations such as high computational complexity or node colocation. This paper proposes a new approach to graph layout through the use of space filling curves which is very fast and guarantees that there will be no nodes that are colocated. The resulting layout is also aesthetic and satisfies several criteria for graph layout effectiveness. ...
A Scalable Parallel Force-Directed Graph Layout Algorithm
Anna Tikhonova and Kwan-Liu Ma
In Proceedings of Eurographics Parallel Graphics and Visualization Symposium (EGPGV 2008)
April, 2008, pp. 25-32
Understanding the structure, dynamics, and evolution of large graphs is becoming increasingly important in a variety of fields. The demand for visual tools to aid in this process is rising accordingly. Yet, many algorithms that create good representations of small and medium-sized graphs do not scale to larger graph sizes. The exploitation of the massive computational power provided by parallel and distributed computing is a natural progression for handling important problems such as large graph layout ...
A Treemap Based Method for Rapid Layout of Large Graphs
Chris W. Muelder and Kwan-Liu Ma
Pacific Visualization Symposium, 2008 (PacificVIS 08)
March, 2008, pp. 231-238
Abstract graphs or networks are a commonly recurring data type in many fields.
In order to visualize such graphs effectively, the graph must be laid out
on the screen coherently. Many algorithms exist to do this,
but many of these algorithms tend to be very slow when the input graph is large.
This paper presents a new approach to the large graph layout problem,
which quickly generates an effective layout.
This new method proceeds by generating a clustering hierarchy for the graph,
applying a treemap to this hierarchy, and finally placing the graph vertices in their
associated regions in the treemap. It is ideal for interactive systems where
operations such as semantic zooming are to be performed,
since most of the work is done in the initial hierarchy calculation,
and it takes very little work to recalculate the layout.
This method is also valuable in that
the resulting layout can be used as the input to an iterative algorithm (e.g., a force
directed method), which greatly reduces the number of iterations required to converge
to a near optimal layout.
Path Visualization for Adjacency Matrices
Zeqian Shen and Kwan-Liu Ma
In Proceedings of Eurographics/IEEE VGTC Syposium on Visualization
May, 2007, pp. 83-90
For displaying a dense graph, an adjacency matrix is superior than a node-link diagram because it is more compact and free of visual clutter. A node-link diagram, however, is far better for the task of path finding because a path can be easily traced by following the corresponding links, provided that the links are not heavily crossed or tangled.We augment adjacency matrices with path visualization and associated interaction techniques to facilitate path finding. ...
Visual Analysis of Large Heterogeneous Social Networks by Semantic and Structure
Zeqian Shen, Kwan-Liu Ma, and Tina Eliassi-Rad
IEEE Transactions on Visualization and Computer Graphics
Volume 12, Number 6, December, 2006, pp. 1427-1439
Social network analysis is an active area of study beyond sociology. It uncovers the invisible relationships between actors in a network and provides understanding of social processes and behaviors. It has become an important technique in a variety of application areas such as the Web, organizational studies, and homeland security. This paper presents a visual analytics tool, OntoVis, for understanding large, heterogeneous social networks, in which nodes and links could represent different concepts and relations, respectively ...
Evaluating the Effectiveness of Tree Visualization Systems for Knowledge Discovery
Yue Wang, Soon Tee Teoh, and Kwan-Liu Ma
In Proceedings of Eurographics Visualization Symposium
May, 2006, pp. 67-74
User studies, evaluations, and comparisons of tree visualization systems have so far focused on questions that can readily be answered by simple, automated queries without needing visualization. Studies are lacking on the actual use of tree visualization in discovering intrinsic, hidden, non-trivial and potentially valuable knowledge. We have thus formulated a set of tree exploration tasks not previously considered and have performed user studies and analysis to determine how visualization helps users to perform these tasks ...
BiblioViz: A System for Visualizing Bibliography Information
Zeqian Shen, Michael Ogawa, Soon Tee Teoh, and Kwan-Liu Ma
In Proceedings of 2006 Asia-Pacific Symposium on Information Visualization
February, 2006, pp. 93-102
The InfoVis 2004 contest led to the development of several bibliography visualization systems. Even though each of these systems offers some unique views of the bibliography data, there is no single best system offering all the desired views. We have thus studied how to consolidate the desirable unctionalities of these systems into a cohesive design. We have also designed a few novel visualization methods ...
Discovering Parametric Clusters in Social Small-World Graphs
Johnathan McPherson, Kwan-Liu Ma, and Michael Ogawa
In Proceedings of ACM Symposium on Applied Computing
March, 2005, pp. 1231-1238
We present a strategy for analyzing large, social small-world graphs, such as those formed by human networks. Our approach brings together ideas from a number of different research areas, including graph layout, graph clustering and partitioning, machine learning, and user interface design. It helps users explore the networks and develop insights concerning their members and structure that may be difficult or impossible to discover via traditional means, including existing graph visualization and/or statistical methods ...
MoireGraphs: Radial Focus+Context Visualization and Interaction for Graphs with Visual Nodes
T.J. Jankun-Kelly and Kwan-Liu Ma
In Proceedings of 2003 Symposium on Information Visualization
October, 2003, pp. 8-15
Graph and tree visualization techniques enable interactive exploration of complex relations while communicating topology. However, most existing techniques have not been designed for situations where visual information such as images is also present at each node and must be displayed. This paper presents MoireGraphs to address this need. MoireGraphs combine a new focus+context radial graph layout with a suite of interaction techniques (focus strength changing, radial rotation, level highlighting, secondary foci, animated transitions and node information) to assist in the exploration of graphs with visual nodes ...
PaintingClass: Interactive Construction, Visualization and Exploration of Decision Trees
Soon Tee Teoh and Kwan-Liu Ma
In Proceedings of 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2003)
August, 2003, pp. 667-672
Decision trees are commonly used for classification. We propose
to use decision trees not just for classification but also for the wider purpose of knowledge discovery, because visualizing the decision tree can reveal much valuable information in the data. We introduce PaintingClass, a system for interactive construction, visualization and exploration of decision trees. PaintingClass provides an intuitive layout and convenient navigation of the decision tree ...
Back to Page Top
RINGS: A Technique for Visualizing Large Hierarchies
Soon Tee Teoh and Kwan-Liu Ma
In Proceedings of Graph Drawing Conference
April, 2002, pp. 268-275
We present RINGS, a technique for visualizing large trees with hundreds of thousands of nodes. We introduce a new ringed circular layout of nodes to make more efficient use of limited display space. RINGS provides the user with the means to specify areas of primary and secondary focus, and is able to show multiple foci without compromising understanding of the graph ...