title: Key-Node-Separated Graph Clustering and Layouts for Human Relationship Graph Visualization.
abstract: Many graph-drawing methods apply node-clustering techniques based on the density of edges to find tightly connected subgraphs and then hierarchically visualize the clustered graphs. However, users may want to focus on important nodes and their connections to groups of other nodes for some applications. For this purpose, it is effective to separately visualize the key nodes detected based on adjacency and attributes of the nodes. This article presents a graph visualization technique for attribute-embedded graphs that applies a graph-clustering algorithm that accounts for the combination of connections and attributes. The graph clustering step divides the nodes according to the commonality of connected nodes and similarity of feature value vectors. It then calculates the distances between arbitrary pairs of clusters according to the number of connecting edges and the similarity of feature value vectors and finally places the clusters based on the distances. Consequently, the technique separates important nodes that have connections to multiple large clusters and improves the visibility of such nodes' connections. To test this technique, this article presents examples with human relationship graph datasets, including a coauthorship and Twitter communication network dataset.
authors.forename: Takayuki
authors.initials: T
authors.lastname: Itoh
authors.forename: Karsten
authors.initials: K
authors.lastname: Klein
mesh_terms: D000465:Algorithms; D003196:Computer Graphics; D003628:Database Management Systems; D066264:Datasets as Topic; D016247:Information Storage and Retrieval / Q000379:methods*; D012984:Software; D014584:User-Computer Interface