Data Visualization through Graph Drawing
Computational StatisticsPublished 1 September 2001
George Michailidis, Jan de Leeuw
Citations23
SJR quartileQ2
SJR score0.75
SNIP1.28
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A general graph drawing framework is introduced, the corresponding mathematical problem defined and an algorithmic approach for solving the necessary optimization problem discussed.
Abstract
Summary In this paper the problem of visualizing categorical multivariate data sets is considered. By representing the data as the adjacency matrix of an appropriately defined bipartite graph, the problem is transformed to one of graph drawing. A general graph drawing framework is introduced, the corresponding mathematical problem defined and an algorithmic approach for solving the necessary optimization problem discussed. The new approach is illustrated through several examples.
Keywords
Computer Science
Graph Drawing: Algorithms for the Visualization of Graphs
1,996 Citations1998Giuseppe Di Battista, Peter Eades +2 more
IEEE Transactions on Visualization and Computer GraphicsGraph visualization and navigation in information visualization: A survey
1,543 Citations2000Iván Herman, Guy Mélançon +1 more
This is a survey on graph visualization and navigation techniques, as used in information visualization, which approaches the results of traditional graph drawing from a different perspective.
Wiley Interdisciplinary Reviews Computational StatisticsJournal of Computational and Graphical Statistics
1,426 Citations2014Richard A. Levine, Eric Sampson +1 more
The history and highlights of the Journal of Computational and Graphical Statistics (JCGS) are discussed as the journal approaches its 25th anniversary.
IEEE Transactions on Systems Man and CyberneticsMethods for Visual Understanding of Hierarchical System Structures
1,234 Citations1981Kozo Sugiyama, Shojiro Tagawa +1 more
Two kinds of new methods are developed to obtain effective representations of hierarchies automatically: theoretical and heuristic methods that determine the positions of vertices in two steps to improve the readability of drawings.
Springer series in statisticsModern Multidimensional Scaling
817 Citations1997Ingwer Borg, Patrick J. F. Groenen
Journal of Computational and Graphical StatisticsOptimization Transfer Using Surrogate Objective Functions
725 Citations2000Kenneth Lange, David R. Hunter +1 more
Because optimization transfer algorithms often exhibit the slow convergence of EM algorithms, two methods of accelerating optimization transfer are discussed and evaluated in the context of specific problems.
Journal of the American Statistical AssociationHyperdimensional Data Analysis Using Parallel Coordinates
661 Citations1990Edward J. Wegman
The basic algorithm for parallel coordinates is laid out and a discussion of its properties as a projective transformation is given, and several duality results are discussed along with their interpretations as data analysis tools.
Statistical ScienceThe Gifi system of descriptive multivariate analysis
258 Citations1998George Michailidis, Jan de Leeuw
Studies in classification, data analysis, and knowledge organizationBlock-relaxation Algorithms in Statistics
211 Citations1994Jan de Leeuw
This paper discusses a single class of algorithms, and it is shown how some well-known classes of statistical algorithms fit in this common class.
Lecture notes in computer scienceValidating graph drawing aesthetics
194 Citations1996Helen C. Purchase, Robert Cohen +1 more
The aim of this paper is to validate graph drawing algorithms and systems claims by performing empirical studies of human understanding of graphs drawn using various layout aesthetics, which helps indicate to algorithm and system designers what are the aesthetic qualities most important to aid understanding, and consequently to build more effective systems.
Journal of Computational and Graphical StatisticsNicheWorks—Interactive Visualization of Very Large Graphs
133 Citations1999Graham Wills
Lecture notes in computer scienceA bayesian paradigm for dynamic graph layout
103 Citations1997Ulrik Brandes, Dorothea Wagner
Dynamic graph layout refers to the layout of graphs that change over time, which should adhere to constraints and criteria that have been specified to improve meaning and readability of a drawing.
Software Practice and ExperienceAesthetics‐based Graph Layout for Human Consumption
83 Citations1996Michael K. Coleman, D. Stott Parker
Convergent Computation by Iterative Majorization: Theory and Applications in Multidimensional Data Analysis
73 Citations1995Willem J. Heiser
Lecture notes in computer scienceNicheWorks — Interactive visualization of very large graphs
67 Citations1997Graham Wills
A tool is described that addresses the needs of investigating and exploring large, complex data sets and is able to display both graph structure and node and edge attributes so that patterns and information hidden in the data can be seen.
Software Practice and ExperienceAesthetics-based Graph Layout for Human Consumption
56 Citations1996Michael K. Coleman, D. Stott Parker
This work seeks an algorithm that produces graph layouts of high aesthetic quality not only for general graphs, but also for specific classes of graphs, such as trees and directed acyclic graphs.
EurographicsGraph Visualisation and Navigation in Information Visualisation
31 Citations1999Iván Herman, Guy Mélançon +1 more
This survey approaches the results of traditional graph drawing from a different perspective than the traditional surveys; as such it is a useful complementary survey to those.
Lecture notes in computer scienceThe Vertex-Exchange Graph: A New Concept for Multi-level Crossing Minimisation
31 Citations1999Patrick Healy, Ago Kuusik
A new abstraction is introduced that is called a vertex-exchange graph that can be used to solve the problems of testing a multi-level graph for planarity and laying out amulti- level graph when planar.
Computational Statistics & Data AnalysisMultilevel homogeneity analysis with differential weighting
20 Citations2000George Michailidis, Jan de Leeuw
This paper extends the technique of homogeneity analysis and nonlinear principal components analysis to a multilevel sampling design framework and proposes a model that differentially weights the groups of objects, and thus allows for within- and between-groups comparisons.
Lecture notes-monograph seriesGraph layout techniques and multidimensional data analysis
17 Citations2000Jan de Leeuw, George Michailidis
TUbilio (Technical University of Darmstadt)Symbolic objects in formal concept analysis
11 Citations1997Susanne Prediger
eScholarship (California Digital Library)Majorization Methods in Statistics
4 Citations2011Jan de Leeuw, George Michailides
The usual derivations of the EM algorithm tend to be somewhat mysterious, because they confound statistics and numerical analysis, but the engine that drives EM is majorization based on Jensen’s inequality.