Results 1 
6 of
6
Social Networks
, 2005
"... Social networks provide a rich source of graph drawing problems, because they appear in an incredibly wide variety of forms and contexts. After sketching the scope of social network analysis, we establish some general principles for social network visualization before finally reviewing applications ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Social networks provide a rich source of graph drawing problems, because they appear in an incredibly wide variety of forms and contexts. After sketching the scope of social network analysis, we establish some general principles for social network visualization before finally reviewing applications of, and challenges for, graph drawing methods in this area. Other accounts more generally relating to social network visualization are given, e.g., in [Klo81, BKR + 99a, Fre00, Fre05, BKR06].
10.1109/TVCG.2015.2424878, IEEE Transactions on Visualization and Computer Graphics 1 UnTangle Map: Visual Analysis of Probabilistic MultiLabel Data
"... Abstract—Data with multiple probabilistic labels are common in many situations. For example, a movie may be associated with multiple genres with different levels of confidence. Despite their ubiquity, the problem of visualizing probabilistic labels has not been adequately addressed. Existing approac ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract—Data with multiple probabilistic labels are common in many situations. For example, a movie may be associated with multiple genres with different levels of confidence. Despite their ubiquity, the problem of visualizing probabilistic labels has not been adequately addressed. Existing approaches often either discard the probabilistic information, or map the data to a lowdimensional subspace where their associations with original labels are obscured. In this paper, we propose a novel visual technique, UnTangle Map, for visualizing probabilistic multilabels. In our proposed visualization, data items are placed inside a web of connected triangles, with labels assigned to the triangle vertices such that nearby labels are more relevant to each other. The positions of the data items are determined based on the probabilistic associations between items and labels. UnTangle Map provides both (a) an automatic label placement algorithm, and (b) adaptive interactions that allow users to control the label positioning for different information needs. Our work makes a unique contribution by providing an effective way to investigate the relationship between data items and their probabilistic labels, as well as the relationships among labels. Our user study suggests that the visualization effectively helps users discover emergent patterns and compare the nuances of probabilistic information in the data labels.
ProjectTeam gravite Graph Visualization and Interactive Exploration
, 2010
"... c t i v i t y ..."
(Show Context)
KelpFusion: a Hybrid Set . . .
"... We present KelpFusion: a method for depicting set membership of items on a map or other visualization using continuous boundaries. KelpFusion is a hybrid representation that bridges hull techniques such as Bubble Sets and Euler Diagrams and line and graphbased techniques such as LineSets and Kelp ..."
Abstract
 Add to MetaCart
We present KelpFusion: a method for depicting set membership of items on a map or other visualization using continuous boundaries. KelpFusion is a hybrid representation that bridges hull techniques such as Bubble Sets and Euler Diagrams and line and graphbased techniques such as LineSets and Kelp Diagrams. We describe an algorithm based on shortestpath graphs to compute KelpFusion visualizations. Based on a single parameter, the shortestpath graph varies from the minimal spanning tree to the convex hull of a point set. Shortestpath graphs aim to capture the shape of a point set and smoothly adapt to sets of varying densities. KelpFusion fills enclosed faces based on a set of simple legibility rules. We present the results of a controlled experiment comparing KelpFusion to Bubble Sets and LineSets. We conclude that KelpFusion outperforms Bubble Sets both in accuracy and completion time, and outperforms LineSets in completion time.
26.3 Substancebased Designs Prominence • Cohesion • Twomode networks • Dynamics 26.4 Trends and Challenges
"... Social networks provide a rich source of graph drawing problems, because they appear in an incredibly wide variety of forms and contexts. After sketching the scope of social network analysis, we establish some general principles for social network visualization before finally reviewing applications ..."
Abstract
 Add to MetaCart
(Show Context)
Social networks provide a rich source of graph drawing problems, because they appear in an incredibly wide variety of forms and contexts. After sketching the scope of social network analysis, we establish some general principles for social network visualization before finally reviewing applications of, and challenges for, graph drawing methods in this area. Other accounts more generally relating to the status of visualization in social network analysis are given, e.g., in [Klo81, BKR+99, Fre00, Fre05, BKR06]. Surveys that are more comprehensive on information visualization approaches, interaction, and network applications from social media are given in [CM11, RF10, CY10]. 26.1 Social Network Analysis The fundamental assumption underlying social network theory is the idea that seemingly autonomous individuals and organizations are in fact embedded in social relations and interactions [BMBL09]. The term social network was coined to delineate the relational perspective from other research traditions on social groups and social categories [Bar54]. In general, a social network consists of actors (e.g., persons, organizations) and some form of (often, but not necessarily: social) relation among them. The network structure
Simultaneous Embeddability of Two Partitions
"... Abstract. We study the simultaneous embeddability of a pair of partitions of the same underlying set into disjoint blocks. Each element of the set is mapped to a point in the plane and each block of either of the two partitions is mapped to a region that contains exactly those points that belong to ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We study the simultaneous embeddability of a pair of partitions of the same underlying set into disjoint blocks. Each element of the set is mapped to a point in the plane and each block of either of the two partitions is mapped to a region that contains exactly those points that belong to the elements in the block and that is bounded by a simple closed curve. We establish three main classes of simultaneous embeddability (weak, strong, and full embeddability) that differ by increasingly strict wellformedness conditions on how different block regions are allowed to intersect. We show that these simultaneous embeddability classes are closely related to different planarity concepts of hypergraphs. For each embeddability class we give a full characterization. We show that (i) every pair of partitions has a weak simultaneous embedding, (ii) it is NPcomplete to decide the existence of a strong simultaneous embedding, and (iii) the existence of a full simultaneous embedding can be tested in linear time. 1