Graph/Network Visualization
|
|
- August Nicholson
- 5 years ago
- Views:
Transcription
1 Graph/Network Visualization Data model: graph structures (relations, knowledge) and networks. Applications: Telecommunication systems, Internet and WWW, Retailers distribution networks knowledge representation Trade Collaborations literature citations, etc. 1 What is a Graph? Vertices (nodes) Edges (links) Adjacency list : 2 2: 1, 3 3: Adjacency matrix Drawing 2 1
2 Graph Terminology Graphs can have cycles Graph edges can be directed or undirected The degree of a vertex is the number of edges connected to it In-degree and out-degree for directed graphs Graph edges can have values (weights) on them (nominal, ordinal or quantitative) 3 Trees are Different Subcase of general graph No cycles Typically directed edges Special designated root vertex 4 2
3 Issues in Graph visualization Graph drawing Layout and positioning Scale: large scale graphs are difficult Navigation: changing focus and scale 5 Vertex Issues Shape Color Size Location Label 6 3
4 Edge Issues Color Size Label Form Polyline, straight line, orthogonal, grid, curved, planar, upward/downward,... 7 Aesthetic Considerations Crossings -- minimize number of edge crossings Total Edge Length -- minimize total length Area -- minimize towards efficiency Maximum Edge Length -- minimize longest edge Uniform Edge Lengths -- minimize variances Total Bends -- minimize orthogonal towards straight-line 8 4
5 Graph drawing optimization 3D-Graph Drawing 5
6 Graph visualization techniques Node-link approach Layered graph drawing (Sugiyama) Force-directed layout Multi-dimensional scaling (MDS) Adjacency Matrix 11 Sugiyama (layered) method Suitable for directed graphs with natural hierarchies: All edges are oriented in a consistent direction and no pairs of edges cross 6
7 Sugiyama : Building Hierarchy Assign layers according to the longest path of each vertex Dummy vertices are used to avoid path across multiple layers. Vertex permutation within a layer to reduce edge crossing. Exact optimization is NP-hard need heuristics. Sugiyama : Building Hierarchy 7
8 Force directed graph layout No natural hierarchy or order Based on principles of physics The Spring Model Using springs to represent node-node relations. Minimizing energy function to reach energy equilibrium. Initial layout is important Local minimal problem 8
9 Spring Layout 17 Energy Function 18 9
10 Network of character co-occurrence in Les Misérables 10
11 Multi-dimensional Scaling Dimension reduction to 2D Graph distance of two nodes are as close to 2D Euclidean distance as possible MDS is a global approach Distance between two nodes: shortest path (classical scaling). Weighted distances (,, w,,, MDS for graph layout 11
12 Other Node-Link Methods Orthogonal layout Suitable for UML graph Radial graph Often used in social networks Nested graph layout Apply graph layout hierarchically Suitable for graphs with hierarchy Arc Diagrams Arc Diagram Les Misérables character relations 12
13 Arc Diagram EU Financial Crisis: 13
14 Summary: Node-Link Pros Intuitive Good for global structure Flexible, with variations Cons Complexity >O(N 2 ) Not suitable for large graphs Adjacency Matrix matrix, for a graph with N nodes. (i, j) position represent the relationship of the ith node and jth node. 14
15 Adjacency Matrix Edge weight Directional edges Sorting: node order Path searching and path tracking? 30 15
16 Node Order Path Tracking 16
17 Adjacency matrix summary Avoid edge crossing, suitable for dense graphs Visually more scalable Visualization is not intuitive Hard to track a path MatLink 17
18 Hybrid Layout Using adjacency matrix to represent small communities Node-link for relationships between communities NodeTrix 18
19 GMap Visualizing graphs and clusters as geographic maps to represent node relations (geographic neighbors) Topological graph simplification Reducing amount of data Reducing nodes: clustering Reducing edges: minimal spanning tree Edge bundling Problems: Loss of data 19
20 Clustering Edge Bundling 20
21 Force Directed Edge Bundling Edges are modeled as flexible springs that are able to attract each other. Geometry Based Edge Bundling Edges clusters are found based on a geometric control mesh. 21
22 Multilevel Agglomerative Edge Bundling Bottom-up merging approach, similar to hierarchical clustering Minimize amount of ink used to render a graph. Skeleton-based Edge Bundling Skeletons: medial axes of edges which are similar in terms of positions information. Iteratively attracting edges towards the skeletons. 22
23 Comparison Interaction Viewing Pan, Zoom, Rotate Interacting with graph nodes and edges Pick, highlight, delete, move Structural interaction Local re-order and re-layout Focus+Context Roll-up & Drill-down 23
24 Fisheye Focus+Context; Overviews + details-on-demand Distortion to magnify areas of interest: zoom factors of 3-5 Multi-scale spaces: Zoom in/out & Pan left/right Interaction with Social Networks Need to consider the social factors and behaviors related to nodes and edges 24
25 50 25
26 Graph Visualization Tools Prefuse (Java) Pajek UCINET / NetDraw Sentinel Visualizer JUNG (Java Universal Network/Graph framework) Graphviz Gephi TouchGraph D3 26
27 Pajek Sentinel Visualizer Link Analysis, Data Visualization, Geospatial Mapping, and Social Network Analysis (SNA) UCINET / NetDraw Analysis and visualization of networks and graphs 27
28 Example: trade 55 Example: traffic 56 28
29 Example: Subway map 57 Web page connections 58 29
30 Communication Networks Hypergraphs 30
31 Definition A hypergraph is a generalization of a graph, where an edge can connect any number of vertices. A hypergraph H is a pair H = (V,E)whereV is a set of nodes/vertices, and E is a set of non-empty subsets of V called hyperedges/links. The Hypergraph H = (V,E) where V = (1,2,3,4,5) and E = {(1,2) (2,3,5) (1,3), (5,4) (2,3)} 31
32 Applications Data Mining Biological Interactions Social Networks Circuit Diagrams Graph Representations 32
33 Edge Nodes: Representative Graph 33
Graphs and Networks 1
Graphs and Networks 1 CS 4460 Intro. to Information Visualization November 6, 2017 John Stasko Learning Objectives Define network concepts vertex, edge, cycle, degree, direction Describe different node-link
More informationGraphs and Networks 1
Topic Notes Graphs and Networks 1 CS 7450 - Information Visualization November 1, 2011 John Stasko Connections Connections throughout our lives and the world Circle of friends Delta s flight plans Model
More informationGraphs and Networks 1
Topic Notes Graphs and Networks 1 CS 7450 - Information Visualization March 8, 2011 John Stasko Connections Connections throughout our lives and the world Circle of friends Delta s flight plans Model connected
More informationGraphs and Networks. CS Information Visualization March 2, 2004 John Stasko
Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Connections Spence s chapter 8 is called Connectivity Connections throughout our lives and the world Circle of friends
More information6. Graphs and Networks visualizing relations
6. Graphs and Networks visualizing relations Vorlesung Informationsvisualisierung Prof. Dr. Andreas Butz, WS 2011/12 Konzept und Basis für n: Thorsten Büring 1 Outline Graph overview Terminology Networks
More information6. Graphs & Networks. Visualizing relations. Dr. Thorsten Büring, 29. November 2007, Vorlesung Wintersemester 2007/08
6. Graphs & Networks Visualizing relations Dr. Thorsten Büring, 29. November 2007, Vorlesung Wintersemester 2007/08 Slide 1 / 46 Outline Graph overview Terminology Networks and trees Data structures Graph
More information6. Graphs and Networks visualizing relations
6. Graphs and Networks visualizing relations Vorlesung Informationsvisualisierung Prof. Dr. Andreas Butz, WS 2009/10 Konzept und Basis für n: Thorsten Büring 1 Outline Graph overview Terminology Networks
More informationInformation Visualization. Jing Yang Spring Graph Visualization
Information Visualization Jing Yang Spring 2007 1 Graph Visualization 2 1 When? Ask the question: Is there an inherent relation among the data elements to be visualized? If yes -> data: nodes relations:
More informationLarge Scale Information Visualization. Jing Yang Fall Graph Visualization
Large Scale Information Visualization Jing Yang Fall 2007 1 Graph Visualization 2 1 When? Ask the question: Is there an inherent relation among the data elements to be visualized? If yes -> data: nodes
More informationcs6964 March TREES & GRAPHS Miriah Meyer University of Utah
cs6964 March 1 2012 TREES & GRAPHS Miriah Meyer University of Utah cs6964 March 1 2012 TREES & GRAPHS Miriah Meyer University of Utah slide acknowledgements: Hanspeter Pfister, Harvard University Jeff
More information1.2 Graph Drawing Techniques
1.2 Graph Drawing Techniques Graph drawing is the automated layout of graphs We shall overview a number of graph drawing techniques For general graphs: Force Directed Spring Embedder Barycentre based Multicriteria
More informationNetwork visualization techniques and evaluation
Network visualization techniques and evaluation The Charlotte Visualization Center University of North Carolina, Charlotte March 15th 2007 Outline 1 Definition and motivation of Infovis 2 3 4 Outline 1
More informationIAT 355 Intro to Visual Analytics Graphs, trees and networks 2. Lyn Bartram
IAT 355 Intro to Visual Analytics Graphs, trees and networks 2 Lyn Bartram Graphs and Trees: Connected Data Graph Vertex/node with one or more edges connecting it to another node Cyclic or acyclic Edge
More informationGraph and Tree Layout
CS8B :: Nov Graph and Tree Layout Topics Graph and Tree Visualization Tree Layout Graph Layout Jeffrey Heer Stanford University Goals Overview of layout approaches and their strengths and weaknesses Insight
More informationGraphs and Networks. CS 4460/ Information Visualization March 24, 2009 John Stasko. Connections throughout our lives and the world
Graphs and Networks CS 4460/7450 - Information Visualization March 24, 2009 John Stasko Connections Connections throughout our lives and the world Circle of friends Delta s flight plans Model connected
More informationCS4800: Algorithms & Data Jonathan Ullman
CS4800: Algorithms & Data Jonathan Ullman Lecture 11: Graphs Graph Traversals: BFS Feb 16, 2018 What s Next What s Next Graph Algorithms: Graphs: Key Definitions, Properties, Representations Exploring
More informationi-vis Information Visualization Research Group
version 1.0 BILKENT UNIVERSITY i-vis Information Visualization Research Group Chisio User s Guide B I L K E N T I - V I S R E S E A R C H G R O U P Chisio User s Guide i-vis Research Group Computer Engineering
More informationNavigating Clustered Graphs
Navigating Clustered Graphs by Wanchun Li Bachelor Engineering, 1992 A thesis submitted to The School of Information Technologies The University of Sydney for the degree of MASTER OF SCIENCE January, 2005
More informationGraph and Tree Layout
CS8B :: Nov Graph and Tree Layout Topics Graph and Tree Visualization Tree Layout Graph Layout Goals Overview of layout approaches and their strengths and weaknesses Insight into implementation techniques
More informationGlyphs. Presentation Overview. What is a Glyph!? Cont. What is a Glyph!? Glyph Fundamentals. Goal of Paper. Presented by Bertrand Low
Presentation Overview Glyphs Presented by Bertrand Low A Taxonomy of Glyph Placement Strategies for Multidimensional Data Visualization Matthew O. Ward, Information Visualization Journal, Palmgrave,, Volume
More informationBig Data Management and NoSQL Databases
NDBI040 Big Data Management and NoSQL Databases Lecture 10. Graph databases Doc. RNDr. Irena Holubova, Ph.D. holubova@ksi.mff.cuni.cz http://www.ksi.mff.cuni.cz/~holubova/ndbi040/ Graph Databases Basic
More informationIntroduction to Graphs. CS2110, Spring 2011 Cornell University
Introduction to Graphs CS2110, Spring 2011 Cornell University A graph is a data structure for representing relationships. Each graph is a set of nodes connected by edges. Synonym Graph Hostile Slick Icy
More informationThe ILP approach to the layered graph drawing. Ago Kuusik
The ILP approach to the layered graph drawing Ago Kuusik Veskisilla Teooriapäevad 1-3.10.2004 1 Outline Introduction Hierarchical drawing & Sugiyama algorithm Linear Programming (LP) and Integer Linear
More informationGraphs and Networks 2
Topic Notes Graphs and Networks 2 CS 7450 - Information Visualization October 23, 2013 John Stasko Review Last time we looked at graph layout aesthetics and algorithms, as well as some example applications
More informationStarting guide for using graph layout with JViews Diagrammer
Starting guide for using graph layout with JViews Diagrammer Question Do you have a starting guide that list those layouts, and describe the main parameters to use them? Answer IBM ILOG JViews Diagrammer
More information2 E6885 Network Science Lecture 4: Network Visualization
E 6885 Topics in Signal Processing -- Network Science E6885 Network Science Lecture 4: Network Visualization Ching-Yung Lin, Dept. of Electrical Engineering, Columbia University October 3rd, 2011 Course
More informationCSE 6242 A / CS 4803 DVA. Feb 12, Dimension Reduction. Guest Lecturer: Jaegul Choo
CSE 6242 A / CS 4803 DVA Feb 12, 2013 Dimension Reduction Guest Lecturer: Jaegul Choo CSE 6242 A / CS 4803 DVA Feb 12, 2013 Dimension Reduction Guest Lecturer: Jaegul Choo Data is Too Big To Do Something..
More informationvisone Analysis and Visualization of Social Networks
visone Analysis and Visualization of Social Networks Jürgen Lerner University of Konstanz Egoredes Summer Course Barcelona, 6. 10. July, 2009 Outline 1. v isone people, purpose, history. 2. v isone basics.
More informationData Clustering Hierarchical Clustering, Density based clustering Grid based clustering
Data Clustering Hierarchical Clustering, Density based clustering Grid based clustering Team 2 Prof. Anita Wasilewska CSE 634 Data Mining All Sources Used for the Presentation Olson CF. Parallel algorithms
More informationHierarchies and Trees 1 (Node-link) CS Information Visualization November 12, 2012 John Stasko
Topic Notes Hierarchies and Trees 1 (Node-link) CS 7450 - Information Visualization November 12, 2012 John Stasko Hierarchies Definition Data repository in which cases are related to subcases Can be thought
More informationBDVA 2016 Workshop Visual Analytics for Relational Data Dr. Quang Vinh Nguyen
BDVA 2016 Workshop Visual Analytics for Relational Data Dr. Quang Vinh Nguyen Q.Nguyen@WesternSydney.edu.au Dr. Quang Vinh Nguyen. Email: q.nguyen@westernsydney.edu.au 1 Relational Data Graphs (as a general
More informationLecture 13: Visualization and navigation of graphs Graph Layout
MTTTS17 Dimensionality Reduction and Visualization Spring 2018 Jaakko Peltonen Lecture 13: Visualization and navigation of graphs Graph Layout Slides originally by Francesco Corona and Manuel J.A. Eugster
More informationApplications. Oversampled 3D scan data. ~150k triangles ~80k triangles
Mesh Simplification Applications Oversampled 3D scan data ~150k triangles ~80k triangles 2 Applications Overtessellation: E.g. iso-surface extraction 3 Applications Multi-resolution hierarchies for efficient
More informationInteractive, Tree-Based Graph Visualization
Interactive, Tree-Based Graph Visualization Andy Pavlo March 17, 2006 Abstract We introduce an interactive graph visualization scheme that allows users to explore graphs by viewing them as a sequence of
More informationDrawing Problem. Possible properties Minimum number of edge crossings Small area Straight or short edges Good representation of graph structure...
Graph Drawing Embedding Embedding For a given graph G = (V, E), an embedding (into R 2 ) assigns each vertex a coordinate and each edge a (not necessarily straight) line connecting the corresponding coordinates.
More informationClustering in Data Mining
Clustering in Data Mining Classification Vs Clustering When the distribution is based on a single parameter and that parameter is known for each object, it is called classification. E.g. Children, young,
More informationAlgorithms for GIS. Spatial data: Models and representation (part I) Laura Toma. Bowdoin College
Algorithms for GIS Spatial data: Models and representation (part I) Laura Toma Bowdoin College Outline Spatial data in GIS applications Point data Networks Terrains Planar maps and meshes Data structures
More informationLecture 13: Graphs/Trees
Lecture 13: Graphs/Trees Information Visualization CPSC 533C, Fall 2009 Tamara Munzner UBC Computer Science Mon, 31 October 2011 1 / 41 Readings Covered Graph Visualisation in Information Visualisation:
More informationAd hoc and Sensor Networks Topology control
Ad hoc and Sensor Networks Topology control Goals of this chapter Networks can be too dense too many nodes in close (radio) vicinity This chapter looks at methods to deal with such networks by Reducing/controlling
More informationAutomatic Drawing for Tokyo Metro Map
Automatic Drawing for Tokyo Metro Map Masahiro Onda 1, Masaki Moriguchi 2, and Keiko Imai 3 1 Graduate School of Science and Engineering, Chuo University monda@imai-lab.ise.chuo-u.ac.jp 2 Meiji Institute
More informationExploring the Structure of Data at Scale. Rudy Agovic, PhD CEO & Chief Data Scientist at Reliancy January 16, 2019
Exploring the Structure of Data at Scale Rudy Agovic, PhD CEO & Chief Data Scientist at Reliancy January 16, 2019 Outline Why exploration of large datasets matters Challenges in working with large data
More informationClustering Part 4 DBSCAN
Clustering Part 4 Dr. Sanjay Ranka Professor Computer and Information Science and Engineering University of Florida, Gainesville DBSCAN DBSCAN is a density based clustering algorithm Density = number of
More informationEvgeny Maksakov Advantages and disadvantages: Advantages and disadvantages: Advantages and disadvantages: Advantages and disadvantages:
Today Problems with visualizing high dimensional data Problem Overview Direct Visualization Approaches High dimensionality Visual cluttering Clarity of representation Visualization is time consuming Dimensional
More informationAnalysis and visualization with v isone
Analysis and visualization with v isone Jürgen Lerner University of Konstanz Egoredes Summerschool Barcelona, 21. 25. June, 2010 About v isone. Visone is the Italian word for mink. In Spanish visón. visone
More informationComputational Discrete Mathematics
Computational Discrete Mathematics Combinatorics and Graph Theory with Mathematica SRIRAM PEMMARAJU The University of Iowa STEVEN SKIENA SUNY at Stony Brook CAMBRIDGE UNIVERSITY PRESS Table of Contents
More informationWeb Structure Mining Community Detection and Evaluation
Web Structure Mining Community Detection and Evaluation 1 Community Community. It is formed by individuals such that those within a group interact with each other more frequently than with those outside
More informationCSE 6242 A / CX 4242 DVA. March 6, Dimension Reduction. Guest Lecturer: Jaegul Choo
CSE 6242 A / CX 4242 DVA March 6, 2014 Dimension Reduction Guest Lecturer: Jaegul Choo Data is Too Big To Analyze! Limited memory size! Data may not be fitted to the memory of your machine! Slow computation!
More informationAutomated Network Drawing Using Self-Organizing Map
Automated Network Drawing Using Self-Organizing Map Xiangjun Xu Mladen Kezunovic* Electrical Engineering Department, Texas A&M University College Station, TX 77843-3128, USA (Phone) 979-845-7509, (Fax)
More informationWireless Sensor Networks 22nd Lecture
Wireless Sensor Networks 22nd Lecture 24.01.2007 Christian Schindelhauer schindel@informatik.uni-freiburg.de 1 Options for topology control Topology control Control node activity deliberately turn on/off
More informationFree-Form Deformation and Other Deformation Techniques
Free-Form Deformation and Other Deformation Techniques Deformation Deformation Basic Definition Deformation: A transformation/mapping of the positions of every particle in the original object to those
More informationHierarchies and Trees 1 (Node-link) CS 4460/ Information Visualization March 10, 2009 John Stasko
Hierarchies and Trees 1 (Node-link) CS 4460/7450 - Information Visualization March 10, 2009 John Stasko Hierarchies Definition Data repository in which cases are related to subcases Can be thought of as
More informationThe Algorithm Design Manual
Steven S. Skiena The Algorithm Design Manual With 72 Figures Includes CD-ROM THE ELECTRONIC LIBRARY OF SCIENCE Contents Preface vii I TECHNIQUES 1 1.1 1.2 1.3 1.4 1.5 1.6 1.7 1.8 1.9 1.10 2 2.1 2.2 2.3
More informationMesh Decimation. Mark Pauly
Mesh Decimation Mark Pauly Applications Oversampled 3D scan data ~150k triangles ~80k triangles Mark Pauly - ETH Zurich 280 Applications Overtessellation: E.g. iso-surface extraction Mark Pauly - ETH Zurich
More informationCS 5220: Parallel Graph Algorithms. David Bindel
CS 5220: Parallel Graph Algorithms David Bindel 2017-11-14 1 Graphs Mathematically: G = (V, E) where E V V Convention: V = n and E = m May be directed or undirected May have weights w V : V R or w E :
More informationGraph Clarity, Simplification, & Interaction
Graph Clarity, Simplification, & Interaction http://i.imgur.com/cw19ibr.jpg https://www.reddit.com/r/cablemanagement/ Today Today s Reading: Lombardi Graphs Bezier Curves Today s Reading: Clustering/Hierarchical
More informationRINGS : A Technique for Visualizing Large Hierarchies
RINGS : A Technique for Visualizing Large Hierarchies Soon Tee Teoh and Kwan-Liu Ma Computer Science Department, University of California, Davis {teoh, ma}@cs.ucdavis.edu Abstract. We present RINGS, a
More informationHigres Visualization System for Clustered Graphs and Graph Algorithms
Higres Visualization System for Clustered Graphs and Graph Algorithms Ivan A. Lisitsyn and Victor N. Kasyanov A. P. Ershov s Institute of Informatics Systems, Lavrentiev av. 6, 630090, Novosibirsk, Russia
More informationLecture 9 Graph Traversal
Lecture 9 Graph Traversal Euiseong Seo (euiseong@skku.edu) SWE00: Principles in Programming Spring 0 Euiseong Seo (euiseong@skku.edu) Need for Graphs One of unifying themes of computer science Closely
More informationCSE 255 Lecture 6. Data Mining and Predictive Analytics. Community Detection
CSE 255 Lecture 6 Data Mining and Predictive Analytics Community Detection Dimensionality reduction Goal: take high-dimensional data, and describe it compactly using a small number of dimensions Assumption:
More informationLecture 12: Graphs/Trees
Lecture 12: Graphs/Trees Information Visualization CPSC 533C, Fall 2009 Tamara Munzner UBC Computer Science Mon, 26 October 2009 1 / 37 Proposal Writeup Expectations project title (not just 533 Proposal
More informationUniversity of Florida CISE department Gator Engineering. Clustering Part 4
Clustering Part 4 Dr. Sanjay Ranka Professor Computer and Information Science and Engineering University of Florida, Gainesville DBSCAN DBSCAN is a density based clustering algorithm Density = number of
More informationVisualizing Weighted Edges in Graphs
Visualizing Weighted Edges in Graphs Peter Rodgers and Paul Mutton University of Kent, UK P.J.Rodgers@kent.ac.uk, pjm2@kent.ac.uk Abstract This paper introduces a new edge length heuristic that finds a
More informationDimension reduction : PCA and Clustering
Dimension reduction : PCA and Clustering By Hanne Jarmer Slides by Christopher Workman Center for Biological Sequence Analysis DTU The DNA Array Analysis Pipeline Array design Probe design Question Experimental
More informationThe Topology of Bendless Orthogonal Three-Dimensional Graph Drawing. David Eppstein Computer Science Dept. Univ. of California, Irvine
The Topology of Bendless Orthogonal Three-Dimensional Graph Drawing David Eppstein Computer Science Dept. Univ. of California, Irvine Graph drawing: visual display of symbolic information Vertices and
More informationVisual Representations for Machine Learning
Visual Representations for Machine Learning Spectral Clustering and Channel Representations Lecture 1 Spectral Clustering: introduction and confusion Michael Felsberg Klas Nordberg The Spectral Clustering
More informationChapter DM:II. II. Cluster Analysis
Chapter DM:II II. Cluster Analysis Cluster Analysis Basics Hierarchical Cluster Analysis Iterative Cluster Analysis Density-Based Cluster Analysis Cluster Evaluation Constrained Cluster Analysis DM:II-1
More informationAn Exploratory Journey Into Network Analysis A Gentle Introduction to Network Science and Graph Visualization
An Exploratory Journey Into Network Analysis A Gentle Introduction to Network Science and Graph Visualization Pedro Ribeiro (DCC/FCUP & CRACS/INESC-TEC) Part 1 Motivation and emergence of Network Science
More informationGraph Partitioning for High-Performance Scientific Simulations. Advanced Topics Spring 2008 Prof. Robert van Engelen
Graph Partitioning for High-Performance Scientific Simulations Advanced Topics Spring 2008 Prof. Robert van Engelen Overview Challenges for irregular meshes Modeling mesh-based computations as graphs Static
More informationIntroduc)on to Informa)on Visualiza)on
Introduc)on to Informa)on Visualiza)on Seeing the Science with Visualiza)on Raw Data 01001101011001 11001010010101 00101010100110 11101101011011 00110010111010 Visualiza(on Applica(on Visualiza)on on
More informationGraphs - I CS 2110, Spring 2016
Graphs - I CS 2110, Spring 2016 Announcements Reading: Chapter 28: Graphs Chapter 29: Graph Implementations These aren t the graphs we re interested in These aren t the graphs we re interested in This
More informationCluster Analysis. Mu-Chun Su. Department of Computer Science and Information Engineering National Central University 2003/3/11 1
Cluster Analysis Mu-Chun Su Department of Computer Science and Information Engineering National Central University 2003/3/11 1 Introduction Cluster analysis is the formal study of algorithms and methods
More informationDynamic Parameter Spring Model for Automatic Graph Layout. Xuejun Liu. (Doctoral Program in Computer Science) Advised by Jiro Tanaka
Dynamic Parameter Spring Model for Automatic Graph Layout Xuejun Liu (Doctoral Program in Computer Science) Advised by Jiro Tanaka Submitted to the Graduate School of Systems and Information Engineering
More informationData Warehousing and Machine Learning
Data Warehousing and Machine Learning Preprocessing Thomas D. Nielsen Aalborg University Department of Computer Science Spring 2008 DWML Spring 2008 1 / 35 Preprocessing Before you can start on the actual
More informationParallel Computation of Spherical Parameterizations for Mesh Analysis. Th. Athanasiadis and I. Fudos University of Ioannina, Greece
Parallel Computation of Spherical Parameterizations for Mesh Analysis Th. Athanasiadis and I. Fudos, Greece Introduction Mesh parameterization is a powerful geometry processing tool Applications Remeshing
More informationServer-Side Graphics
Server-Side Graphics SET09103 Advanced Web Technologies School of Computing Napier University, Edinburgh, UK Module Leader: Uta Priss 2008 Copyright Napier University Graphics Slide 1/16 Outline Graphics
More informationMesh Repairing and Simplification. Gianpaolo Palma
Mesh Repairing and Simplification Gianpaolo Palma Mesh Repairing Removal of artifacts from geometric model such that it becomes suitable for further processing Input: a generic 3D model Output: (hopefully)a
More informationCommunity Detection. Community
Community Detection Community In social sciences: Community is formed by individuals such that those within a group interact with each other more frequently than with those outside the group a.k.a. group,
More informationTable Of Contents: xix Foreword to Second Edition
Data Mining : Concepts and Techniques Table Of Contents: Foreword xix Foreword to Second Edition xxi Preface xxiii Acknowledgments xxxi About the Authors xxxv Chapter 1 Introduction 1 (38) 1.1 Why Data
More informationPreprocessing DWML, /33
Preprocessing DWML, 2007 1/33 Preprocessing Before you can start on the actual data mining, the data may require some preprocessing: Attributes may be redundant. Values may be missing. The data contains
More informationGraph Drawing Contest Report
Graph Drawing Contest Report Christian A. Duncan 1, Carsten Gutwenger 2,LevNachmanson 3, and Georg Sander 4 1 Louisiana Tech University, Ruston, LA 71272, USA duncan@latech.edu 2 University of Dortmund,
More informationIS 709/809: Computational Methods in IS Research. Graph Algorithms: Introduction
IS 709/809: Computational Methods in IS Research Graph Algorithms: Introduction Nirmalya Roy Department of Information Systems University of Maryland Baltimore County www.umbc.edu Motivation Several real-life
More informationSung-Eui Yoon ( 윤성의 )
Path Planning for Point Robots Sung-Eui Yoon ( 윤성의 ) Course URL: http://sglab.kaist.ac.kr/~sungeui/mpa Class Objectives Motion planning framework Classic motion planning approaches 2 3 Configuration Space:
More informationTrees & Graphs. Nathalie Henry Riche, Microsoft Research
Trees & Graphs Nathalie Henry Riche, Microsoft Research About Nathalie Henry Riche nath@microsoft.com Researcher @ Microsoft Research since 2009 Today: - Overview of techniques to visualize trees & graphs
More informationContents. Foreword to Second Edition. Acknowledgments About the Authors
Contents Foreword xix Foreword to Second Edition xxi Preface xxiii Acknowledgments About the Authors xxxi xxxv Chapter 1 Introduction 1 1.1 Why Data Mining? 1 1.1.1 Moving toward the Information Age 1
More informationData Visualization. Fall 2016
Data Visualization Fall 2016 Information Visualization Upon now, we dealt with scientific visualization (scivis) Scivisincludes visualization of physical simulations, engineering, medical imaging, Earth
More informationOptimal Möbius Transformation for Information Visualization and Meshing
Optimal Möbius Transformation for Information Visualization and Meshing Marshall Bern Xerox Palo Alto Research Ctr. David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science
More informationPajek. Chase Christopherson, Heriberto Diaz, Jiyuan Guo
Pajek Chase Christopherson, Heriberto Diaz, Jiyuan Guo Pajek overview Pajek is designed to be used for analyzing large networks. Pajek intends to draw from several sources of machine-readable networks.
More informationEECS 1028 M: Discrete Mathematics for Engineers
EECS 1028 M: Discrete Mathematics for Engineers Suprakash Datta Office: LAS 3043 Course page: http://www.eecs.yorku.ca/course/1028 Also on Moodle S. Datta (York Univ.) EECS 1028 W 18 1 / 15 Graphs: Motivations
More informationApplying the weighted barycentre method to interactive graph visualization
Applying the weighted barycentre method to interactive graph visualization Peter Eades University of Sydney Thanks for some software: Hooman Reisi Dekhordi Patrick Eades Graphs and Graph Drawings What
More informationData visualization. Networks. David Hoksza
Data visualization Networks David Hoksza http://siret.cz/hoksza Application areas Physical networks Power grid, train routes Community modelling Users interaction Information (knowledge) networks Citations,
More informationGeometric Modeling. Mesh Decimation. Mesh Decimation. Applications. Copyright 2010 Gotsman, Pauly Page 1. Oversampled 3D scan data
Applications Oversampled 3D scan data ~150k triangles ~80k triangles 2 Copyright 2010 Gotsman, Pauly Page 1 Applications Overtessellation: E.g. iso-surface extraction 3 Applications Multi-resolution hierarchies
More informationInformation Visualization. SWE 432, Fall 2016 Design and Implementation of Software for the Web
Information Visualization SWE 432, Fall 2016 Design and Implementation of Software for the Web Today What types of information visualization are there? Which one should you choose? What does usability
More informationInteractive Visual Exploration
Interactive Visual Exploration of High Dimensional Datasets Jing Yang Spring 2010 1 Challenges of High Dimensional Datasets High dimensional datasets are common: digital libraries, bioinformatics, simulations,
More informationGRAPHS Lecture 19 CS2110 Spring 2013
GRAPHS Lecture 19 CS2110 Spring 2013 Announcements 2 Prelim 2: Two and a half weeks from now Tuesday, April16, 7:30-9pm, Statler Exam conflicts? We need to hear about them and can arrange a makeup It would
More informationDeforming Objects. Deformation Techniques. Deforming Objects. Examples
Deforming Objects Deformation Techniques CMPT 466 Computer Animation Torsten Möller Non-Uniform Scale Global Deformations Skeletal Deformations Grid Deformations Free-Form Deformations (FFDs) Morphing
More informationGraphs Eulerian and Hamiltonian Applications Graph layout software. Graphs. SET07106 Mathematics for Software Engineering
Graphs SET76 Mathematics for Software Engineering School of Computing Edinburgh Napier University Module Leader: Uta Priss 2 Copyright Edinburgh Napier University Graphs Slide /3 Outline Graphs Eulerian
More informationUnsupervised Learning
Unsupervised Learning Chapter 14: The Elements of Statistical Learning Presented for 540 by Len Tanaka Objectives Introduction Techniques: Association Rules Cluster Analysis Self-Organizing Maps Projective
More informationSome Graph Theory for Network Analysis. CS 249B: Science of Networks Week 01: Thursday, 01/31/08 Daniel Bilar Wellesley College Spring 2008
Some Graph Theory for Network Analysis CS 9B: Science of Networks Week 0: Thursday, 0//08 Daniel Bilar Wellesley College Spring 008 Goals this lecture Introduce you to some jargon what we call things in
More informationMatrix Representation of Graphs
Matrix Representation of Graphs Eva Rott Michael Glatzhofer Dominik Mocher Julian Wolf Institute of Interactive Systems and Data Science (ISDS), Graz University of Technology A-8010 Graz, Austria 18 May
More informationAdvanced Data Management
Advanced Data Management Medha Atre Office: KD-219 atrem@cse.iitk.ac.in Sept 26, 2016 defined Given a graph G(V, E) with V as the set of nodes and E as the set of edges, a reachability query asks does
More information