A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Filters
Visual Representation of Multiple Associations in Data using Constrained Graph Layout
[article]
2009
Computer Graphics and Visual Computing
Preserved Fulltext
We use this approach generically for three applications: for visualization of data with geometric and categorical constraints, respectively. ...
Given an initial graph layout which represents an association of the data, another set of constraints is applied to the graph to represent a second association on the same dataset to obtain the final layout ...
The authors are grateful to a TeraGrid Resource Provider Grant for funding and the Visualization & Data Analysis Group, TACC for supporting this work. ...
doi:10.2312/localchapterevents/tpcg/tpcg09/065-068
dblp:conf/tpcg/XuS09
fatcat:dg6l3zyiq5gqjc2ucfbh7k5rqm
A hybrid space-filling and force-directed layout method for visualizing multiple-category graphs
2009
2009 IEEE Pacific Visualization Symposium
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The technique firstly constructs hierarchical clusters of the nodes based on both connectivity and categories. ...
Many graphs used in real-world applications consist of nodes belonging to more than one category. We call such graph "multiplecategory graphs". ...
Also, we thank members of the VIDI Research Group and reviewers for helping us improve this paper. ...
doi:10.1109/pacificvis.2009.4906846
dblp:conf/apvis/ItohMMS09
fatcat:bel6w5ykk5eaxnwtei6zvkfzwu
Interactive Graph Layout of a Million Nodes
2016
Informatics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The complexity of traditional repulsive force computation is reduced by approximating calculations based on the hierarchical structure of multi-level clustered graphs. ...
In this paper, we tackle the scalability problem of interactive layout of large graphs, and contribute a new GPU-based force-directed layout algorithm that exploits graph topology. ...
Conflicts of Interest: The authors declare no conflict of interest. ...
doi:10.3390/informatics3040023
fatcat:4qednfchtrcdhepmtlmkc4seou
An energy-based model to optimize cluster visualization
2014
2014 IEEE Eighth International Conference on Research Challenges in Information Science (RCIS)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We propose an energy-based model for graph drawing that produces an esthetic drawing that ensures each cluster will occupy a separate zone within the visualization layout. ...
Graphs capture the structure and thus help modeling a wide range of complex real-life data in various domains. Moreover graphs are especially suitable for information visualization. ...
Eades [17] popularized one of the most used general drawing strategies -namely energy-based layout. ...
doi:10.1109/rcis.2014.6861028
dblp:conf/rcis/DkakiM14
fatcat:nuva5ejjlvf2vigzsnrcjsccfy
graphTPP: A multivariate based method for interactive graph layout and analysis
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The aim of this research was to investigate the use of node-attributes for graph layout in order to improve the analysis process and to give further insight into the graph over purely topological layouts ...
In this article we present graphTPP, a graph based extension to targeted projection pursuit (TPP) --- an interactive, linear, dimension reduction technique --- as a method for graph layout and subsequent ...
However, layout is restricted to using only two attribute dimensions or a force-based layout. ...
arXiv:1712.05644v1
fatcat:pgcjvmevkfdu5oraelgfima24m
Multivariate Network Exploration with JauntyNets
2013
2013 17th International Conference on Information Visualisation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present a novel approach that extends traditional force-based graph layouts to create an attribute-driven layout. ...
They help us to understand the structure (topology) of the relational data. However in many real world data sets, additional (often multidimensional) attributes are attached to the network elements. ...
Our main contribution is the extension of a force-based graph layout approach to act as an attribute-based layout system. ...
doi:10.1109/iv.2013.3
dblp:conf/iv/JusufiKZ13
fatcat:ebnchi5fkncr7nrenvivluzfae
Scalable Visualization of Semantic Nets using Power-Law Graphs
2014
Applied Mathematics & Information Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The core concept is to partition the node set of a graph into power and non-power nodes and to apply a modified force-directed method that emphasizes the power nodes which results in establishing local ...
A visualization tool, NavigOWL, is developed by using this technique which has been ported as a plug-in for Protege, a famous ontology editor. ...
They partitioned the graph into multiple layers based upon out-degrees. The graph layout is being adjust by using Fruchterman-Reingold (FR) Force Directed Algorithm [13] . ...
doi:10.12785/amis/080145
fatcat:qddxmvxvhvbunai4lgr6vzjl3a
Interactive visual clustering
2007
Proceedings of the 12th international conference on Intelligent user interfaces - IUI '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
IVC combines spring-embedded graph layout with user interaction and constrained clustering. ...
Interactive Visual Clustering (IVC) is a novel method that allows a user to explore relational data sets interactively, in order to produce a clustering that satisfies their objectives. ...
ACKNOWLEDGEMENTS Thanks to Adam Anthony, Blaz Bulka, Donald MacGlashan, and Penny Rheingans for their assistance and inputs. ...
doi:10.1145/1216295.1216367
dblp:conf/iui/desJardinsMF07
fatcat:t626we2gcfarljocwj3ckyge4q
A survey of two-dimensional graph layout techniques for information visualisation
2012
Information Visualization
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Methods developed specifically for graph visualisation often make use of node-attributes and are categorised based on whether the attributes are used to introduce constraints to the layout, provide a clustered ...
There then follows a discussion of a range of techniques developed specifically for graph visualisations. ...
As with multi-level techniques, constraint-based methods often make use of force-directed algo- The biology community is a particular driving-force behind the use of node-attribute data for constrained ...
doi:10.1177/1473871612455749
fatcat:pxkmhvfyzbclfmhueeudtugu2e
FragViz: visualization of fragmented networks
2010
BMC Bioinformatics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our layout optimization technique FragViz meets these requirements and specifically addresses the visualization of fragmented networks, for which standard algorithms do not consider similarities between ...
Researchers in systems biology use network visualization to summarize the results of their analysis. ...
Clustered graphs, for one, include groups of vertices that are related to each other. ...
doi:10.1186/1471-2105-11-475
pmid:20860802
pmcid:PMC2955700
fatcat:fxxruswzlfbh7fgg7isy3tc2e4
An Evaluation of the use of Clustering Coefficient as a Heuristic for the Visualisation of Small World Graphs
[article]
2010
Computer Graphics and Visual Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Once the clustering is performed we lay out the graph using a force directed approach for each clustering individually. ...
While current layout algorithms are capable of displaying two dimensional node-link visualisations of large data sets, the results for dense small world graphs can be aesthetically unpleasant and difficult ...
An in-depth review of clustering methods is available from [Sch07] .
Layout Force directed layout algorithms are one of the most common approaches to graph layout. ...
doi:10.2312/localchapterevents/tpcg/tpcg10/167-174
dblp:conf/tpcg/McGeeD10
fatcat:ydwnopsvxfa4xirddzn6yxlx44
A Treemap Based Method for Rapid Layout of Large Graphs
2008
2008 IEEE Pacific Visualization Symposium
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
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 ...
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. ...
Department of Energy through the SciDAC program with Agreement No. DE-FC02-06ER25777. ...
doi:10.1109/pacificvis.2008.4475481
dblp:conf/apvis/MuelderM08
fatcat:bljbtcvbcnegji7djxp6ewiyh4
Perceptual Organization in User-Generated Graph Layouts
2008
IEEE Transactions on Visualization and Computer Graphics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
These results demonstrate the role of perceptual organization in representing graph data and provide concrete recommendations for graph layout algorithms. ...
Based on these measurements we found that observers are able to recover cluster structure, that the distance between clusters is inversely related to the strength of the clustering, and that users exhibit ...
ACKNOWLEDGEMENTS The authors wish to thank the participants in this test for their time and effort spent, as well as Martin Wattenberg, Fernanda Viégas and the anonymous reviewers for insightful comments ...
doi:10.1109/tvcg.2008.155
pmid:18988981
fatcat:7jfq4eywnrbvzgqbbzywsvv7by
Edge bundling in information visualization
2013
Tsinghua Science and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The edge, which can encode relational data in graphs and multidimensional data in parallel coordinates plots, is an important visual primitive for encoding data in information visualization research. ...
Thereafter, we review the cost-based, geometry-based, and image-based edge-bundling methods for graphs, parallel coordinates, and flow maps. ...
Acknowledgements We thank anonymous reviewers for their valuable comments. This work is supported by Foundation for Distinguished Young Talents in Higher Education of Guangdong, China (No. ...
doi:10.1109/tst.2013.6509098
fatcat:g4qnhxvapff25fsd3asz5snioi
Drawing Large Weighted Graphs Using Clustered Force-Directed Algorithm
2014
2014 18th International Conference on Information Visualisation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Force-directed algorithm is a popular approach for laying graphs yet small to medium size datasets due to its slow convergence time. ...
Clustered graph drawing is widely considered as a good method to overcome the scalability problem when visualizing large (or huge) graphs. ...
METHODS In our experiments, we used clustering method based on edge weight to group vertices for pre-handling; then applied forces within each cluster. ...
doi:10.1109/iv.2014.24
dblp:conf/iv/HuaHN14
fatcat:tus37xx3njfcljtqnf2ylkor4m
« Previous
Showing results 1 — 15 out of 23,370 results