Cited By
View all- Kennedy AKlein KNguyen AWang F(2018)The Graph LandscapeJournal of Visualization10.1007/s12650-016-0374-620:3(417-432)Online publication date: 24-Dec-2018
The Graph Landscape: a Concept for the Visual Analysis of Graph Set Properties
Pages 42 - 51
Abstract
In a variety of research and application areas graphs are an important structure for data modeling and analysis. While graph properties can have a crucial influence on the performance of graph algorithms, and thus on the outcome of experiments, often only basic analysis of the graphs under investigation in an experimental evaluation is performed, and a few characteristics are reported in publications.
We present Graph Landscape, a concept for the visual analysis of graph set properties. The Graph Landscape aims to support researchers to explore graphs and graph sets regarding their properties, in order to allow to select good experimental test sets, analyze newly generated sets, compare sets and assess the validity (or range) of experimental results and corresponding conclusions.
References
[1]
Collection of VRP instances: http://neo.lcc.uma.es/vrp/vrp-instances/.
[2]
Colorbrewer 2.0: http://colorbrewer2.org/.
[3]
Data-driven documents: http://d3js.org/.
[4]
DIMACS challenge: http://dimacs.rutgers.edu/Challenges/.
[5]
The Graph Archive: http://www.graph-archive.org.
[6]
House of Graphs: http://hog.grinvin.org/.
[7]
ROME Graphs: http://www.graphdrawing.org/data/.
[8]
The Graph 500 benchmark: http://www.graph500.org/.
[9]
The Node.js platform: http://www.nodejs.org/.
[10]
C. Bachmaier, F. J. Brandenburg, P. Effinger, C. Gutwenger, J. Katajainen, K. Klein, M. Spönemann, M. Stegmaier, and M. Wybrow. The Open Graph Archive: A Community-Driven Effort. In Graph Drawing, pages 435--440. Springer, 2012.
[11]
V. Batagelj. Social network analysis, large-scale. In R. A. Meyers, editor, Encyclopedia of Complexity and Systems Science, pages 8245--8265. Springer, 2009.
[12]
M. Chimani, C. Gutwenger, M. Jünger, G. W. Klau, K. Klein, and P. Mutzel. The open graph drawing framework (OGDF). pages 543--569, 2011.
[13]
M. Chimani and K. Klein. Algorithm engineering: Concepts and practice. pages 131--158, 2010.
[14]
A. Dionísio, R. Menezes, and D. A. Mendes. Entropy-based independence test. Nonlinear Dynamics, 44(1-4):351--357, 2006.
[15]
N. T. Doncheva, F. S. Assenov, Yassen and-Domingues, and M. Albrecht. Topological analysis and interactive visualization of biological networks and protein structures. Nat. Protocols, 7(4):670--685, 2012.
[16]
G. Dzemyda, V. Marcinkevicius, and V. Medvedev. Large-scale multidimensional data visualization: A web service for data mining. In W. Abramowicz, I. M. Llorente, M. Surridge, A. Zisman, and J. Vayssière, editors, Towards a Service-Based Internet - 4th European Conference, ServiceWave 2011, Poznan, Poland, October 26-28, 2011. Proceedings, volume 6994 of Lecture Notes in Computer Science, pages 14--25. Springer, 2011.
[17]
E. R. Gansner, Y. Hu, and S. C. North. A maxent-stress model for graph layout. IEEE Trans. Vis. Comput. Graph., 19(6):927--940, 2013.
[18]
L. Hakes, J. W. Pinney, D. L. Robertson, and S. C. Lovell. Protein-protein interaction networks and biology -what's the connection? Nat Biotech, 26(1):69--72, 2008.
[19]
J. Hartigan. Printer graphics for clustering. Journal of Statistical Computation and Simulation, 4(3):187--213, 1975.
[20]
J. Heinrich and D. Weiskopf. State of the art of parallel coordinates. In Eurographics 2013-State of the Art Reports, pages 95--116. The Eurographics Association, 2013.
[21]
T. Huang, M. L. Huang, Q. V. Nguyen, and L. Zhao. A space-filling multidimensional visualization (SFMDVis) for exploratory data analysis. In T. Bednarz, W. Huang, Q. V. Nguyen, and Y. Wu, editors, The 7th International Symposium on Visual Information Communication and Interaction, VINCI '14, Sydney, NSW, Australia, August 5-8, 2014, page 19. ACM, 2014.
[22]
A. Inselberg. The plane with parallel coordinates. The Visual Computer, 1(2):69--91, 1985.
[23]
M. Klimenta and U. Brandes. Graph drawing by classical multidimensional scaling: New perspectives. In W. Didimo and M. Patrignani, editors, Graph Drawing - 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers, volume 7704 of Lecture Notes in Computer Science, pages 55--66. Springer, 2012.
[24]
S. G. Kobourov. Force-directed drawing algorithms. Handbook of Graph Drawing and Visualization, pages 383--408, 2013.
[25]
Q. V. Nguyen, K. Zhang, and S. Simoff. Unlocking the complexity of port data with visualization. Human-Machine Systems, IEEE Transactions on, 45(2):272--279, April 2015.
[26]
D. T. Nhon and L. Wilkinson. Scagexplorer: Exploring scatterplots by their scagnostics. In I. Fujishiro, U. Brandes, H. Hagen, and S. Takahashi, editors, IEEE Pacific Visualization Symposium, PacificVis 2014, Yokohama, Japan, March 4-7, 2014, pages 73--80. IEEE, 2014.
[27]
K. Nohno, H.-Y. Wu, K. Watanabe, S. Takahashi, and I. Fujishiro. Spectral-based contractible parallel coordinates. In Information Visualisation (IV), 2014 18th International Conference on, pages 7--12, July 2014.
[28]
P. Pagliosa, F. V. Paulovich, R. Minghim, H. Levkowitz, and L. G. Nonato. Projection inspector: Assessment and synthesis of multidimensional projections. Neurocomputing, 150, Part B(0):599--610, 2015. Special Issue on Information Processing and Machine Learning for Applications of Engineering Selected papers from the {IEEE} 17th International Conference on Intelligent Engineering Systems (INES13) Solving Complex Machine Learning Problems with Ensemble Methods Visual Analytics using Multidimensional Projections Selected papers from the Workshop on Visual Analytics using Multidimensional Projections, held at EuroVis 2013.
[29]
D. Pérez, L. Zhang, M. Schaefer, T. Schreck, D. Keim, and I. Díaz. Interactive feature space extension for multidimensional data projection. Neurocomputing, 150:611--626, 2015.
[30]
H. C. Purchase, J. Hamer, M. Nöllenburg, and S. G. Kobourov. On the usability of Lombardi graph drawings. In Graph Drawing, volume 7704 of LNCS, pages 451--462. Springer, 2012.
[31]
L. D. Silvestro, M. Burch, M. Caccamo, D. Weiskopf, F. Beck, and G. Gallo. Visual analysis of time-dependent multivariate data from dairy farming industry. In R. S. Laramee, A. Kerren, and J. Braz, editors, Proceedings of the 5th International Conference on Information Visualization Theory and Applications, IVAPP 2014, Lisbon, Portugal, 5-8 January, 2014., pages 99--106. SciTePress, 2014.
[32]
H. Suematsu, Y. Zheng, T. Itoh, R. Fujimaki, S. Morinaga, and Y. Kawahara. Arrangement of low-dimensional parallel coordinate plots for high-dimensional data visualization. In E. Banissi, H. Azzag, M. W. M. Bannatyne, S. Bertschi, F. Bouali, R. Burkhard, J. Counsell, A. Cuzzocrea, M. J. Eppler, B. Hammer, M. Lebbah, F. T. Marchese, M. Sarfraz, A. Ursyn, G. Venturini, and T. G. Wyeld, editors, 17th International Conference on Information Visualisation, IV 2013, London, United Kingdom, July 16-18, 2013, pages 59--65. IEEE, 2013.
[33]
M. ten Caat, N. M. Maurits, and J. B. T. M. Roerdink. Tiled parallel coordinates for the visualization of time-varying multichannel EEG data. In K. Brodlie, D. J. Duke, and K. I. Joy, editors, EuroVis05: Joint Eurographics - IEEE VGTC Symposium on Visualization, Leeds, United Kingdom, 1-3 June 2005, pages 61--68. Eurographics Association, 2005.
[34]
W. S. Torgerson. Multidimensional scaling: I. theory and method. Psychometrika, 30(17):401--419, 1952.
[35]
K. Wakita, T. Masanori, and H. Hosobe. Interactive high-dimensional visualization of social graphs. In Pacific Visualization Symposium (PacificVis), 2015 IEEE. IEEE, 2015.
[36]
K. Xu, B. Ivona, B. Leonid, and V. Y. Soojin. Path lengths in protein-protein interaction networks and biological complexity. proteomics, 11:1857--1867, 2011.
[37]
Y. Zheng, H. Suematsu, T. Itoh, R. Fujimaki, S. Morinaga, and Y. Kawahara. Scatterplot layout for high-dimensional data visualization. J. Visualization, 18(1):111--119, 2015.
Index Terms
- The Graph Landscape: a Concept for the Visual Analysis of Graph Set Properties
Recommendations
Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
Let $\cal C$ be a family of cliques of a graph G=(V,E). Suppose that each clique C of $\cal C$ is associated with an integer r(C)$, where $r(C) \ge 0$. A vertex v r-dominates a clique C of G if $d(v,x) \le r(C)$ for all $x \in C$, where d(v,x) is the ...
A Characterization of $K_{2,4}$-Minor-Free Graphs
We provide a complete structural characterization of $K_{2,4}$-minor-free graphs. The 3-connected $K_{2,4}$-minor-free graphs consist of nine small graphs on at most eight vertices, together with a family of planar graphs that contains $2n-8$ ...
Overlaying a hypergraph with a graph with bounded maximum degree
AbstractLet G and H be respectively a graph and a hypergraph defined on a same set of vertices, and let F be a fixed graph. We say that G F-overlays a hyperedge S of H if F is a spanning subgraph of the subgraph of G induced by S,...
Comments
Information & Contributors
Information
Published In
August 2015
185 pages
ISBN:9781450334822
DOI:10.1145/2801040
- General Chair:
- Takayuki Itoh,
- Program Chairs:
- Paolo Bottoni,
- Shigeo Takahashi
Copyright © 2015 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 24 August 2015
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Funding Sources
Conference
VINCI '15
VINCI '15: The 8th International Symposium on Visual Information Communication and Interaction
August 24 - 26, 2015
AA, Tokyo, Japan
Acceptance Rates
VINCI '15 Paper Acceptance Rate 12 of 32 submissions, 38%;
Overall Acceptance Rate 71 of 193 submissions, 37%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 151Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)2
Reflects downloads up to 15 Oct 2024
Other Metrics
Citations
Cited By
View all- Kennedy AKlein KNguyen AWang F(2018)The Graph LandscapeJournal of Visualization10.1007/s12650-016-0374-620:3(417-432)Online publication date: 24-Dec-2018
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in