Node-Attribute Graph Layout for Small-World Networks Helen Gibson Principal Supervisor: Dr. Paul Vickers 1 st Supervisor: Dr. Maia Angelova 2 nd Supervisor:

Slides:



Advertisements
Similar presentations
FMRI Methods Lecture 10 – Using natural stimuli. Reductionism Reducing complex things into simpler components Explaining the whole as a sum of its parts.
Advertisements

Presentation at Society of The Query conference, Amsterdam November 13-14, 2009 (original title: Learning from Google: software design as a methodology.
Performance in Decentralized Filesharing Networks Theodore Hong Freenet Project.
Decision Support and Artificial Intelligence Jack G. Zheng May 21 st 2008 MIS Chapter 4.
Decision Support and Artificial Intelligence Jack G. Zheng July 11 th 2005 MIS Chapter 4.
Using storytelling to reach new audiences for data Eileen Capponi ESDS International Conference, 3 December 2007 eileen.capponi.
Improving Accessibility for those with Impaired Mobility (I-AIM) University of Newcastle Upon Tyne (Transport Operations Research Group and Department.
ENV Envisioning Information Lecture 4 – Multivariate Data Exploration Glyphs and other methods Hierarchical approaches Ken Brodlie.
BALANCING 2 AIM: To solve equations with variables on both sides.
K The Common Core State Standards in Mathematics © Copyright 2011 Institute for Mathematics and Education Welcome to a clickable.
Complex Networks Advanced Computer Networks: Part1.
Genome 559: Introduction to Statistical and Computational Genomics Elhanan Borenstein Biological Networks Analysis Introduction and Dijkstras algorithm.
Analysis of High-Throughput Screening Data C371 Fall 2004.
Scale Free Networks.
LG 524 ANALYSIS QUALITATIVE CODING 1. Qualitative Analysis 1. Data Reduction. This refers to the process of selecting, focussing, simplifying, abstracting.
Visualization of Computer Networks By Richard Zschech Supervisors: Dr. Ken Hawick, Dr. Paul Coddington.
Visualization of Computer Networks By Richard Zschech Supervisor: Dr. Paul Coddington, Dr. Ken Hawick.
Maximising the impact of maths in practice Sue Merchant Past president OR Society 1.
Is it Mathematics? Linking to Content Standards. Some questions to ask when looking at student performance Is it academic? – Content referenced: reading,
Technical Guide For Mesh AP – MAP-3120 What’s the difference between Mesh Bridge and AP WDS Bridge?
1 Algorithmic Networks & Optimization Maastricht, November 2008 Ronald L. Westra, Department of Mathematics Maastricht University.
Slides from: Doug Gray, David Poole
Network Visualization by Semantic Substrates Aleks Aris Ben Shneiderman.
DIJKSTRA’s Algorithm. Definition fwd search Find the shortest paths from a given SOURCE node to ALL other nodes, by developing the paths in order of increasing.
The Last Procedure Before First Functional Prototype Grant Boomer, Brett Papineau, Tanis Lopez, Archana Shrestha CS 383.
Visualization and Cluster
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
Identity and search in social networks Presented by Pooja Deodhar Duncan J. Watts, Peter Sheridan Dodds and M. E. J. Newman.
Visual Analytics Research at WPI Dr. Matthew Ward and Dr. Elke Rundensteiner Computer Science Department.
Two Technique Papers on High Dimensionality Allan Rempel December 5, 2005.
Identifying Patterns in Road Networks Topographic Data and Maps Henri Lahtinen Arto Majoinen.
Peer-to-Peer and Grid Computing Exercise Session 3 (TUD Student Use Only) ‏
CSE 222 Systems Programming Graph Theory Basics Dr. Jim Holten.
DEPARTMENT OF COMPUTER SCIENCE SOFTWARE ENGINEERING, GRAPHICS, AND VISUALIZATION RESEARCH GROUP 15th International Conference on Information Visualisation.
14.1 Vis_04 Data Visualization Lecture 14 Information Visualization : Part 2.
Scalable Network Distance Browsing in Spatial Database Samet, H., Sankaranarayanan, J., and Alborzi H. Proceedings of the 2008 ACM SIGMOD international.
Data Mining Techniques
By LaBRI – INRIA Information Visualization Team. Tulip 2010 – version Tulip is an information visualization framework dedicated to the analysis.
Australian Research Council Support ● 3-year ( ) ARC Discovery Project Grant “New Methods for Researching the Existence and Impact of Political.
Graph Theory in Computer Science
Glasgow 02/02/04 NN k networks for content-based image retrieval Daniel Heesch.
Discrete Structures for Computing
es/by-sa/2.0/. Principal Component Analysis & Clustering Prof:Rui Alves Dept Ciencies Mediques.
Social Network Analysis Prof. Dr. Daning Hu Department of Informatics University of Zurich Mar 5th, 2013.
University of Malta CSA3080: Lecture 4 © Chris Staff 1 of 14 CSA3080: Adaptive Hypertext Systems I Dr. Christopher Staff Department.
Attributed Visualization of Collaborative Workspaces Mao Lin Huang, Quang Vinh Nguyen and Tom Hintz Faculty of Information Technology University of Technology,
Data Mining – Intro. Course Overview Spatial Databases Temporal and Spatio-Temporal Databases Multimedia Databases Data Mining.
Introduction to the Internet: “Harnessing the Web” Sponsored by the CAHPERD Communications Task Force 1.
Cluster Sorting, Analysis and 3D-Display For the Mapping of the Dragonfly’s Neuro- Network Advisor: Prof. Hannay Client: Prof. Olberg (Biology )
The Structure of the Web. Getting to knowing the Web How big is the web and how do you measure it? How many people use the web? How many use search engines?
Topics Paths and Circuits (11.2) A B C D E F G.
Presentation Template KwangSoo Yang Florida Atlantic University College of Engineering & Computer Science.
FlowGraph: A Compound Hierarchical Graph for Flow Field Exploration Jun Ma, Chaoli Wang, Ching-Kuang Shene Michigan Technological University Presented.
Machine Learning Saarland University, SS 2007 Holger Bast Marjan Celikik Kevin Chang Stefan Funke Joachim Giesen Max-Planck-Institut für Informatik Saarbrücken,
Analyzing Work: One Approach Problem: What’s missing currently? What does the work aim to understand? Approach: How does the work go about addressing the.
© 2002 IBM Corporation IBM Research 1 Policy Transformation Techniques in Policy- based System Management Mandis Beigi, Seraphin Calo and Dinesh Verma.
Copyright Paula Matuszek Kinds of Machine Learning.
1 Friends and Neighbors on the Web Presentation for Web Information Retrieval Bruno Lepri.
Using Bayesian Networks to Predict Plankton Production from Satellite Data By: Rob Curtis, Richard Fenn, Damon Oberholster Supervisors: Anet Potgieter,
“Niche Work” Graham J Wills, Lucent Technologies (Bell Lab)
Web mining is the use of data mining techniques to automatically discover and extract information from Web documents/services
A Self-organizing Semantic Map for Information Retrieval Xia Lin, Dagobert Soergel, Gary Marchionini presented by Yi-Ting.
Social Networks Some content from Ding-Zhu Du, Lada Adamic, and Eytan Adar.
Graphical Presentation of Mobile networks
Collaboration Spotting: Visualisation of LHCb process data
Grant Number: IIS Institution of PI: WPI PIs: Matthew O
Navi 下一步工作的设想 郑 亮 6.6.
Graph Theory By Amy C. and John M..
Visualization of Content Information in Networks using GlyphNet
(Social) Networks Analysis II
Presentation transcript:

Node-Attribute Graph Layout for Small-World Networks Helen Gibson Principal Supervisor: Dr. Paul Vickers 1 st Supervisor: Dr. Maia Angelova 2 nd Supervisor: Dr. Fouad Khelifi Previous Supervisor: Dr. Joe Faith

What is a Graph? 2 Relationships between concepts Mathematics and Graph Theory Graph Graph Drawing Information Visualisation Network Network Visualisation

Examples 3 Social Networks Biological Networks World Wide Web IP Addresses

What’s the Problem? Yeast interaction network in Gephi 4 It looks nice but is it doing anything useful? Typical complaint: Giant-Hairball Caused by force-directed algorithms Old, but still popular and most commonly used Connected nodes attract, other repel

How Can This Be Solved? 5 Node Attributes Example – Social Network Node = People Links = Friendships Attributes = age, gender, location, games they interact with, pages they had liked etc. Typical Usage – As retinal variables Use to tell us more information about the graph Uses beyond retinal variables?

Research Aims 6 Novel graph layout based on node-attributes Many node attributes -> use a dimension reduction technique Visual analysis of graphs Visual Analytics - the science of analytical reasoning facilitated by interactive visual interfaces. [Thomas and Cook, 2005] To further understand the connectivity and structure of the graph

Node-Attributes to Dimensions 7 Attributes as a second set of links Nodes Attributes Each attribute node is a dimension and existence of a link is a value for that dimension on that node

Dimension Reduction and TPP 8 In visualisation:  Many variables form a high-dimensional space reduce to 2 or 3 dimensions that can be seen on a display.  Linear projections Projection Pursuit:  Finds the most ‘interesting’ projection  Interestingness depends on the data Targeted Projection Pursuit (TPP):  Interactive  Searches for a projection closest to a users desired view  In following case, separation of the clusters as far as possible.

Small-World Networks 9 Networks that are:  Highly clustered  Smaller than average shortest path length An Example:  4 clusters  Small nodes are attributes Clustering – users’ most valued layout feature

Force-Directed Graph+TPP 10 Comparison

What’s Next? 11 ‘How much better is the clustering?’ Real world domain applications What do we learn about the data from the layout? Evaluation

Publications 12 Gibson, H. (2010) Data-driven layout for the visual analysis of networks. GROUP28: The XXVIII International Colloquium on Group-Theoretical Methods in Physics. Newcastle-upon-Tyne, July Poster presentation. Gibson, H., Faith, J. (2011) Node-attribute graph layout for small-world networks. 15 th International Conference on Information Visualisation. London, July 2011