DOCSLIB.ORG

Tutorial Layouts Gephi Tutorial * Introduction * Install Plugins * Import File Layouts * Run * Choice * Forceatlas Welcome to This Advanced Tutorial

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Tutorial Layouts Gephi Tutorial * Introduction * Install Plugins * Import File Layouts * Run * Choice * Forceatlas Welcome to This Advanced Tutorial Tutorial Layouts Gephi Tutorial * Introduction * Install plugins * Import file Layouts * Run * Choice * ForceAtlas Welcome to this advanced tutorial. It will teach you the fine art of network * Fruchterman-Reingold layout in Gephi: how to use algorithms that place the nodes inside the graphic space. * YifanHu Multilevel * OpenOrd Gephi version 0.8alpha was used to do this tutorial. * ForceAtlas 2 * Circular Layout Get Gephi * Radial Axis Layout * Geographic map * Node overlapping * Geometric transform * Save * Conclusion Last updated June 13th, 2011 Tutorial Layouts Install layout plugins * Introduction We need to install additional plugins. * Install plugins * Import file * Run • Go to the Tools menu and then Plugins. * Choice * ForceAtlas • In the Available Plugins tab check: - OpenOrdLayout * Fruchterman-Reingold - CircularLayout * YifanHu Multilevel - GeoLayout * OpenOrd - Geometric Transformation * ForceAtlas 2 - NoverlapLayout * Circular Layout * Radial Axis Layout • Click on Install. The plugins are installed * Geographic map and you are asked to reboot Gephi. Click * Node overlapping OK. * Geometric transform * Save * Conclusion Tutorial Layouts Open Graph File * Introduction • Download the file LesMiserables.gexf * Install plugins * Import file • In the menubar, go to File Menu and Open... * Run * Choice • When your file is opened, the report sums up data found and any issues. * ForceAtlas - Number of nodes * Fruchterman-Reingold - Number of edges * YifanHu Multilevel - Type of graph * OpenOrd • Click on OK to validate and see the graph. * ForceAtlas 2 * Circular Layout * Radial Axis Layout * Geographic map * Node overlapping * Geometric transform * Save Graph Format * Conclusion - GEXF - Tulip TLP - GraphML - CSV - Pajek NET - Netdraw VNA - GDF - Compressed ZIP/GZ - GML Tutorial Layouts You should now see a graph * Introduction We imported the “Les Miserables” dataset1. This is a coappearance weighted network of * Install plugins characters in the novel “Les Miserables” from Victor Hugo. * Import file * Run * Choice * ForceAtlas * Fruchterman-Reingold * YifanHu Multilevel * OpenOrd * ForceAtlas 2 * Circular Layout * Radial Axis Layout * Geographic map * Node overlapping * Geometric transform Node position is random at first, so you may see a slighty different representation. * Save * Conclusion 1 D. E. Knuth, The Stanford GraphBase: A Platform for Combinatorial Computing, Addison-Wesley, Reading, MA (1993). Tutorial Layouts Run a layout * Introduction Layout algorithms set the graph shape, it is the most essential operation. * Install plugins * Import file • Locate the Layout module, on the left panel. * Run * Choice • Choose “Force Atlas” * ForceAtlas * Fruchterman-Reingold You can see the layout properties below, leave default * YifanHu Multilevel values. * OpenOrd * ForceAtlas 2 • Click on to launch the algorithm. * Circular Layout * Radial Axis Layout * Geographic map • You see now the positions of nodes changing in real time. * Node overlapping * Geometric transform * Save * Conclusion Layout algorithms Graphs are usually laid out with “Force-based” algorithms. They follow a simple principle: linked nodes attract each other and non-linked nodes are pushed apart. Tutorial Layouts Control the layout * Introduction The purpose of Layout Properties is to let you control the algorithm in order to make a * Install plugins readable representation. * Import file * Run • Set the “Repulsion strengh” at 10 000 to expand * Choice the graph. * ForceAtlas * Fruchterman-Reingold • Type “Enter” to validate the changed value. * YifanHu Multilevel * OpenOrd * ForceAtlas 2 * Circular Layout * Radial Axis Layout * Geographic map • And now the algorithm. * Node overlapping * Geometric transform * Save * Conclusion Tips Click on the icon “Center on Graph” on the bottom left of the Visualization panel if you don’t see the graph anymore. Tutorial Layouts You should now see a graph with the layout applied * Introduction * Install plugins * Import file * Run * Choice * ForceAtlas * Fruchterman-Reingold * YifanHu Multilevel * OpenOrd * ForceAtlas 2 * Circular Layout * Radial Axis Layout * Geographic map * Node overlapping * Geometric transform * Save * Conclusion Tutorial Layouts Play against the algorithm! * Introduction Run the layout again and drag the nodes to stress it. * Install plugins * Import file • Locate Dragging action, in the top left of the * Run Visualization panel. * Choice * ForceAtlas • Ajust the selection diameter in the panel or by using the shortcut “Ctrl + Mouse Wheel”. * Fruchterman-Reingold * YifanHu Multilevel * OpenOrd Increase the “Autostab strength” in the Layout Properties to 100 000, then drag the * ForceAtlas 2 nodes. The graph becomes less deformed. * Circular Layout * Radial Axis Layout • And now the algorithm. * Geographic map * Node overlapping * Geometric transform * Save * Conclusion Tutorial Layouts Various layouts exist * Introduction Gephi implements various layout algorithms. They set the shape of the graph. * Install plugins * Import file OpenOrd ForceAtlas 2 * Run * Choice * ForceAtlas * Fruchterman-Reingold * YifanHu Multilevel * OpenOrd * ForceAtlas 2 * Circular Layout * Radial Axis Layout * Geographic map Radial Axis GeoLayout * Node overlapping * Geometric transform * Save * Conclusion Airlines sample dataset: http://gephi.org/datasets/airlines-sample.gexf Tutorial Layouts So how to choose a layout? * Introduction In general, select one according to the feature of the topology you want to highlight: * Install plugins * Import file * Run * Choice emphasis emphasis * ForceAtlas * Fruchterman-Reingold DIVISIONS COMPLEMENTARITIES ForceAtlas, Yifan Hu, * YifanHu Multilevel OpenOrd Frushterman-Reingold * OpenOrd * ForceAtlas 2 * Circular Layout * Radial Axis Layout emphasis * Geographic map emphasis * Node overlapping GEOGRAPHIC * Geometric transform RANKING REPARTITION * Save Circular, Radial Axis GeoLayout * Conclusion Graphic Adjustements - Label Adjust - Expansion - Noverlap - Contraction Tutorial Layouts ForceAtlas layout * Introduction Home-brew layout of Gephi, it is made to spatialize Small-World / Scale-free networks. * Install plugins It is focused on quality (meaning “being useful to explore real data”) to allow a rigor- * Import file ous interpretation of the graph (e.g. in SNA) with the fewest biases possible, and a good * Run readability even if it is slow. * Choice Author: Mathieu Jacomy * ForceAtlas Date: 2007 * Fruchterman-Reingold Kind: Force-directed * YifanHu Multilevel Complexity: O(N²) * OpenOrd Graph size: 1 to 10 000 nodes * ForceAtlas 2 Use edge weight: Yes * Circular Layout * Radial Axis Layout * Geographic map * Node overlapping * Geometric transform * Save * Conclusion Tutorial Layouts Run ForceAtlas * Introduction the layout by applying the following settings step by step: * Install plugins * Import file • Autostab strength = 2 000 Increase to move the nodes slowly. * Run * Choice • Repulsion strength = 1 000 How strongly does each node reject others. * ForceAtlas * Fruchterman-Reingold • Attraction strength = 1 How strongly each pair of connected nodes at- * YifanHu Multilevel tract each other. * OpenOrd * ForceAtlas 2 • Gravity = 100 Attract all nodes to the center to avoid disper- * Circular Layout sion of disconnected components. * Radial Axis Layout * Geographic map • Attraction Distrib. = checked Push hubs (high number of output links) at the * Node overlapping periphery and put authorities (high number of in- put links) more central. * Geometric transform * Save And now the algorithm. * Conclusion Adjust by Sizes This option avoids node overlapping, depending on the size of each node. Tutorial Layouts Fruchterman-Reingold layout * Introduction It simulates the graph as a system of mass particles. The nodes are the mass particles and * Install plugins the edges are springs between the particles. The algorithms try to minimize the energy * Import file of this physical system. It has become a standard but remains very slow. * Run * Choice Author: Thomas Fruchterman & Edward Reingold1 * ForceAtlas Date: 1991 * Fruchterman-Reingold Kind: Force-directed * YifanHu Multilevel Complexity: O(N²) * OpenOrd Graph size: 1 to 1 000 nodes * ForceAtlas 2 Use edge weight: No * Circular Layout * Radial Axis Layout * Geographic map * Node overlapping * Geometric transform * Save * Conclusion 1 Fruchterman, T. M. J., & Reingold, E. M. (1991). Graph Drawing by Force-Directed Placement. Software: Practice and Experience, 21(11). Tutorial Layouts Run Fruchterman-Reingold * Introduction the layout by applying the following settings step by step: * Install plugins * Import file * Run • Area = 100 Graph size area. * Choice • Area = 100 000 * ForceAtlas * Fruchterman-Reingold * YifanHu Multilevel • Gravity = 1 000 Attract all nodes to the center to avoid dispersion * OpenOrd • Gravity = 100 of disconnected components. * ForceAtlas 2 * Circular Layout * Radial Axis Layout * Geographic map * Node overlapping And now the algorithm. * Geometric transform * Save * Conclusion Unstable nodes position! Sometimes the algorithm does not converge, resulting in an unstable graph. Reduce the “Speed” setting to gain precision. Tutorial Layouts Yifan Hu Multilevel layout * Introduction It is a very fast algorithm with a good quality on large graphs. It combines a force-directed * Install plugins model with a graph coarsening technique (multilevel algorithm) to reduce the complex- * Import file ity. The repulsive forces on one node from a cluster of distant nodes are approximated by * Run a Barnes-Hut
Load more

Recommended publications
  • Networkx Tutorial
    5.03.2020 tutorial NetworkX tutorial Source: https://github.com/networkx/notebooks (https://github.com/networkx/notebooks) Minor corrections: JS, 27.02.2019 Creating a graph Create an empty graph with no nodes and no edges. In [1]: import networkx as nx In [2]: G = nx.Graph() By definition, a Graph is a collection of nodes (vertices) along with identified pairs of nodes (called edges, links, etc). In NetworkX, nodes can be any hashable object e.g. a text string, an image, an XML object, another Graph, a customized node object, etc. (Note: Python's None object should not be used as a node as it determines whether optional function arguments have been assigned in many functions.) Nodes The graph G can be grown in several ways. NetworkX includes many graph generator functions and facilities to read and write graphs in many formats. To get started though we'll look at simple manipulations. You can add one node at a time, In [3]: G.add_node(1) add a list of nodes, In [4]: G.add_nodes_from([2, 3]) or add any nbunch of nodes. An nbunch is any iterable container of nodes that is not itself a node in the graph. (e.g. a list, set, graph, file, etc..) In [5]: H = nx.path_graph(10) file:///home/szwabin/Dropbox/Praca/Zajecia/Diffusion/Lectures/1_intro/networkx_tutorial/tutorial.html 1/18 5.03.2020 tutorial In [6]: G.add_nodes_from(H) Note that G now contains the nodes of H as nodes of G. In contrast, you could use the graph H as a node in G.
    [Show full text]
  • Networkx: Network Analysis with Python
    NetworkX: Network Analysis with Python Salvatore Scellato Full tutorial presented at the XXX SunBelt Conference “NetworkX introduction: Hacking social networks using the Python programming language” by Aric Hagberg & Drew Conway Outline 1. Introduction to NetworkX 2. Getting started with Python and NetworkX 3. Basic network analysis 4. Writing your own code 5. You are ready for your project! 1. Introduction to NetworkX. Introduction to NetworkX - network analysis Vast amounts of network data are being generated and collected • Sociology: web pages, mobile phones, social networks • Technology: Internet routers, vehicular flows, power grids How can we analyze this networks? Introduction to NetworkX - Python awesomeness Introduction to NetworkX “Python package for the creation, manipulation and study of the structure, dynamics and functions of complex networks.” • Data structures for representing many types of networks, or graphs • Nodes can be any (hashable) Python object, edges can contain arbitrary data • Flexibility ideal for representing networks found in many different fields • Easy to install on multiple platforms • Online up-to-date documentation • First public release in April 2005 Introduction to NetworkX - design requirements • Tool to study the structure and dynamics of social, biological, and infrastructure networks • Ease-of-use and rapid development in a collaborative, multidisciplinary environment • Easy to learn, easy to teach • Open-source tool base that can easily grow in a multidisciplinary environment with non-expert users
    [Show full text]
  • Graphprism: Compact Visualization of Network Structure
    GraphPrism: Compact Visualization of Network Structure Sanjay Kairam, Diana MacLean, Manolis Savva, Jeffrey Heer Stanford University Computer Science Department {skairam, malcdi, msavva, jheer}@cs.stanford.edu GraphPrism Connectivity ABSTRACT nodeRadius 7.9 strokeWidth 1.12 charge -242 Visual methods for supporting the characterization, com- gravity 0.65 linkDistance 20 parison, and classification of large networks remain an open Transitivity updateGraph Close Controls challenge. Ideally, such techniques should surface useful 0 node(s) selected. structural features { such as effective diameter, small-world properties, and structural holes { not always apparent from Density either summary statistics or typical network visualizations. In this paper, we present GraphPrism, a technique for visu- Conductance ally summarizing arbitrarily large graphs through combina- tions of `facets', each corresponding to a single node- or edge- specific metric (e.g., transitivity). We describe a generalized Jaccard approach for constructing facets by calculating distributions of graph metrics over increasingly large local neighborhoods and representing these as a stacked multi-scale histogram. MeetMin Evaluation with paper prototypes shows that, with minimal training, static GraphPrism diagrams can aid network anal- ysis experts in performing basic analysis tasks with network Created by Sanjay Kairam. Visualization using D3. data. Finally, we contribute the design of an interactive sys- Figure 1: GraphPrism and node-link diagrams for tem using linked selection between GraphPrism overviews the largest component of a co-authorship graph. and node-link detail views. Using a case study of data from a co-authorship network, we illustrate how GraphPrism fa- compactly summarizing networks of arbitrary size. Graph- cilitates interactive exploration of network data.
    [Show full text]
  • Gephi Tools for Network Analysis and Visualization
    Frontiers of Network Science Fall 2018 Class 8: Introduction to Gephi Tools for network analysis and visualization Boleslaw Szymanski CLASS PLAN Main Topics • Overview of tools for network analysis and visualization • Installing and using Gephi • Gephi hands-on labs Frontiers of Network Science: Introduction to Gephi 2018 2 TOOLS OVERVIEW (LISTED ALPHABETICALLY) Tools for network analysis and visualization • Computing model and interface – Desktop GUI applications – API/code libraries, Web services – Web GUI front-ends (cloud, distributed, HPC) • Extensibility model – Only by the original developers – By other users/developers (add-ins, modules, additional packages, etc.) • Source availability model – Open-source – Closed-source • Business model – Free of charge – Commercial Frontiers of Network Science: Introduction to Gephi 2018 3 TOOLS CINET CyberInfrastructure for NETwork science • Accessed via a Web-based portal (http://cinet.vbi.vt.edu/granite/granite.html) • Supported by grants, no charge for end users • Aims to provide researchers, analysts, and educators interested in Network Science with an easy-to-use cyber-environment that is accessible from their desktop and integrates into their daily work • Users can contribute new networks, data, algorithms, hardware, and research results • Primarily for research, teaching, and collaboration • No programming experience is required Frontiers of Network Science: Introduction to Gephi 2018 4 TOOLS Cytoscape Network Data Integration, Analysis, and Visualization • A standalone GUI application
    [Show full text]
  • Graph Simplification and 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 edge Bundling – Definition of Betweenness Centrality • Emergency Management Graph Visualization – Sean Kim’s masters project • Reading for Tuesday & Homework 3 • Graph Interaction Brainstorming Exercise "Lombardi drawings of graphs", Duncan, Eppstein, Goodrich, Kobourov, Nollenberg, Graph Drawing 2010 • Circular arcs • Perfect angular resolution (edges for equal angles at vertices) • Arcs only intersect 2 vertices (at endpoints) • (not required to be crossing free) • Vertices may be constrained to lie on circle or concentric circles • People are more patient with aesthetically pleasing graphs (will spend longer studying to learn/draw conclusions) • What about relaxing the circular arc requirement and allowing Bezier arcs? • How does it scale to larger data? • Long curved arcs can be much harder to follow • Circular layout of nodes is often very good! • Would like more pseudocode Cubic Bézier Curve • 4 control points • Curve passes through first & last control point • Curve is tangent at P0 to (P1-P0) and at P3 to (P3-P2) http://www.e-cartouche.ch/content_reg/carto http://www.webreference.com/dla uche/graphics/en/html/Curves_learningObject b/9902/bezier.html 2.html “Force-directed Lombardi-style graph drawing”, Chernobelskiy et al., Graph Drawing 2011. • Relaxation of the Lombardi Graph requirements • “straight-line segments
    [Show full text]
  • Constraint Graph Drawing
    Constrained Graph Drawing Dissertation zur Erlangung des akademischen Grades des Doktors der Naturwissenschaften vorgelegt von Barbara Pampel, geb. Schlieper an der Universit¨at Konstanz Mathematisch-Naturwissenschaftliche Sektion Fachbereich Informatik und Informationswissenschaft Tag der mundlichen¨ Prufung:¨ 14. Juli 2011 1. Referent: Prof. Dr. Ulrik Brandes 2. Referent: Prof. Dr. Michael Kaufmann II Teile dieser Arbeit basieren auf Ver¨offentlichungen, die aus der Zusammenar- beit mit anderen Wissenschaftlerinnen und Wissenschaftlern entstanden sind. Zu allen diesen Inhalten wurden wesentliche Beitr¨age geleistet. Kapitel 3 (Bachmaier, Brandes, and Schlieper, 2005; Brandes and Schlieper, 2009) Kapitel 4 (Brandes and Pampel, 2009) Kapitel 6 (Brandes, Cornelsen, Pampel, and Sallaberry, 2010b) Zusammenfassung Netzwerke werden in den unterschiedlichsten Forschungsgebieten zur Repr¨asenta- tion relationaler Daten genutzt. Durch geeignete mathematische Methoden kann man diese Netzwerke als Graphen darstellen. Ein Graph ist ein Gebilde aus Kno- ten und Kanten, welche die Knoten verbinden. Hierbei k¨onnen sowohl die Kan- ten als auch die Knoten weitere Informationen beinhalten. Diese Informationen k¨onnen den einzelnen Elementen zugeordnet sein, sich aber auch aus Anordnung und Verteilung der Elemente ergeben. Mit Algorithmen (strukturierten Reihen von Arbeitsanweisungen) aus dem Gebiet des Graphenzeichnens kann man die unterschiedlichsten Informationen aus verschiedenen Forschungsbereichen visualisieren. Graphische Darstellungen k¨onnen das
    [Show full text]
  • Chapter 18 Spectral Graph Drawing
    Chapter 18 Spectral Graph Drawing 18.1 Graph Drawing and Energy Minimization Let G =(V,E)besomeundirectedgraph.Itisoftende- sirable to draw a graph, usually in the plane but possibly in 3D, and it turns out that the graph Laplacian can be used to design surprisingly good methods. n Say V = m.Theideaistoassignapoint⇢(vi)inR to the vertex| | v V ,foreveryv V ,andtodrawaline i 2 i 2 segment between the points ⇢(vi)and⇢(vj). Thus, a graph drawing is a function ⇢: V Rn. ! 821 822 CHAPTER 18. SPECTRAL GRAPH DRAWING We define the matrix of a graph drawing ⇢ (in Rn) as a m n matrix R whose ith row consists of the row vector ⇥ n ⇢(vi)correspondingtothepointrepresentingvi in R . Typically, we want n<m;infactn should be much smaller than m. Arepresentationisbalanced i↵the sum of the entries of every column is zero, that is, 1>R =0. If a representation is not balanced, it can be made bal- anced by a suitable translation. We may also assume that the columns of R are linearly independent, since any basis of the column space also determines the drawing. Thus, from now on, we may assume that n m. 18.1. GRAPH DRAWING AND ENERGY MINIMIZATION 823 Remark: Agraphdrawing⇢: V Rn is not required to be injective, which may result in! degenerate drawings where distinct vertices are drawn as the same point. For this reason, we prefer not to use the terminology graph embedding,whichisoftenusedintheliterature. This is because in di↵erential geometry, an embedding always refers to an injective map. The term graph immersion would be more appropriate.
    [Show full text]
  • Performing Knowledge Requirements Analysis for Public Organisations in a Virtual Learning Environment: a Social Network Analysis
    chnology Te & n S o o ti ft a w a m r r e Fontenele et al., J Inform Tech Softw Eng 2014, 4:2 o f E Journal of n n I g f i o n DOI: 10.4172/2165-7866.1000134 l e a e n r r i n u g o J ISSN: 2165-7866 Information Technology & Software Engineering Research Article Open Access Performing Knowledge Requirements Analysis for Public Organisations in a Virtual Learning Environment: A Social Network Analysis Approach Fontenele MP1*, Sampaio RB2, da Silva AIB2, Fernandes JHC2 and Sun L1 1University of Reading, School of Systems Engineering, Whiteknights, Reading, RG6 6AH, United Kingdom 2Universidade de Brasília, Campus Universitário Darcy Ribeiro, Brasília, DF, 70910-900, Brasil Abstract This paper describes an application of Social Network Analysis methods for identification of knowledge demands in public organisations. Affiliation networks established in a postgraduate programme were analysed. The course was ex- ecuted in a distance education mode and its students worked on public agencies. Relations established among course participants were mediated through a virtual learning environment using Moodle. Data available in Moodle may be ex- tracted using knowledge discovery in databases techniques. Potential degrees of closeness existing among different organisations and among researched subjects were assessed. This suggests how organisations could cooperate for knowledge management and also how to identify their common interests. The study points out that closeness among organisations and research topics may be assessed through affiliation networks. This opens up opportunities for ap- plying knowledge management between organisations and creating communities of practice.
    [Show full text]
  • Graph Drawing by Stochastic Gradient Descent
    1 Graph Drawing by Stochastic Gradient Descent Jonathan X. Zheng, Samraat Pawar, Dan F. M. Goodman Abstract—A popular method of force-directed graph drawing is multidimensional scaling using graph-theoretic distances as input. We present an algorithm to minimize its energy function, known as stress, by using stochastic gradient descent (SGD) to move a single pair of vertices at a time. Our results show that SGD can reach lower stress levels faster and more consistently than majorization, without needing help from a good initialization. We then show how the unique properties of SGD make it easier to produce constrained layouts than previous approaches. We also show how SGD can be directly applied within the sparse stress approximation of Ortmann et al. [1], making the algorithm scalable up to large graphs. Index Terms—Graph drawing, multidimensional scaling, constraints, relaxation, stochastic gradient descent F 1 INTRODUCTION RAPHS are a common data structure, used to describe to the shortest path distance between vertices i and j, with w = d−2 G everything from social networks to food webs, from ij ij to offset the extra weight given to longer paths metabolic pathways to internet traffic. Any set of pairwise due to squaring the difference [3]. relationships between entities can be described by a graph, This definition was popularized for graph layout by and the ever increasing amount of data being collected Kamada and Kawai [4] who minimized the function using means that visualizing graphs for exploratory analysis has a localized 2D Newton-Raphson method, while within the become an important task. MDS community Kruskal [5] originally used gradient de- Node-link diagrams are an intuitive representation of scent [6].
    [Show full text]
  • A Comparative Analysis of Large-Scale Network Visualization Tools
    A Comparative Analysis of Large-scale Network Visualization Tools Md Abdul Motaleb Faysal and Shaikh Arifuzzaman Department of Computer Science, University of New Orleans New Orleans, LA 70148, USA. Email: [email protected], [email protected] Abstract—Network (Graph) is a powerful abstraction for scalability for large network analysis. Such study will help a representing underlying relations and structures in large complex person to decide which tool to use for a specific case based systems. Network visualization provides a convenient way to ex- on his need. plore and study such structures and reveal useful insights. There exist several network visualization tools; however, these vary in One such study in [3] compares a couple of tools based on terms of scalability, analytics feature, and user-friendliness. Due scalability. Comparative studies on other visualization metrics to the huge growth of social, biological, and other scientific data, should be conducted to let end users have freedom in choosing the corresponding network data is also large. Visualizing such the specific tool he needs to use. In this paper, we have chosen large network poses another level of difficulty. In this paper, we five widely used visualization tools for an empirical and identify several popular network visualization tools and provide a comparative analysis based on the features and operations comparative analysis. Our comparisons are based on factors these tools support. We demonstrate empirically how those tools such as supported file formats, scalability in visualization scale to large networks. We also provide several case studies of and analysis, interacting capability with the drawn network, visual analytics on large network data and assess performances end user-friendliness (e.g., users with no programming back- of the tools.
    [Show full text]
  • Week 2 - Handling Real-World Network Datasets
    28/12/2017 Social Networks - - Unit 6 - Week 2 - Handling Real-world Network Datasets X [email protected] ▼ Courses » Social Networks Unit 6 - Week Announcements Course Forum Progress Mentor 2 - Handling Real-world Network Datasets Course outline Week2-assignment1 Course Trailer . FAQ 1) Citation Network is which type of network? 1 point Things to Note Directed Accessing the Portal Undirected Week 1 - Introduction Accepted Answers: Week 2 - Handling Real-world Network Directed Datasets 2) Co-authorship Network is which type of network? 1 point Directed Undirected Lecture 14 - Introduction to Datasets Accepted Answers: Undirected 3) What is the full form of CSV? 1 point Computer Systematic Version Comma Separated Version Comma Separated Values Computer Systematic Values Lecture 15 - Ingredients Network Accepted Answers: Comma Separated Values 4) Which of the following is True with respect to the function read_weighted_edgelist() 1 point This function can be used to read a weighted network dataset, however, the weights should only be in string format. Lecture 16 - This function can be used to read a weighted network dataset, however, the weights should only be numeric. Synonymy Network This function can be used to read a weighted network dataset and the weights can be in any format. The statement is wrong; such a function does not exist. Accepted Answers: This function can be used to read a weighted network dataset, however, the weights should only be numeric. Lecture 17 - Web 5) Choose the one that is False out of the following: 1 point Graph GML stands for Graph Modeling Language. https://onlinecourses.nptel.ac.in/noc17_cs41/unit?unit=42&assessment=47 1/4 28/12/2017 Social Networks - - Unit 6 - Week 2 - Handling Real-world Network Datasets GML stores the data in the form of tags just like XML.
    [Show full text]
  • Networkx: Network Analysis with Python
    NetworkX: Network Analysis with Python Dionysis Manousakas (special thanks to Petko Georgiev, Tassos Noulas and Salvatore Scellato) Social and Technological Network Data Analytics Computer Laboratory, University of Cambridge February 2017 Outline 1. Introduction to NetworkX 2. Getting started with Python and NetworkX 3. Basic network analysis 4. Writing your own code 5. Ready for your own analysis! 2 1. Introduction to NetworkX 3 Introduction: networks are everywhere… Social Mobile phone networks Vehicular flows networks Web pages/citations Internet routing How can we analyse these networks? Python + NetworkX 4 Introduction: why Python? Python is an interpreted, general-purpose high-level programming language whose design philosophy emphasises code readability + - Clear syntax, indentation Can be slow Multiple programming paradigms Beware when you are Dynamic typing, late binding analysing very large Multiple data types and structures networks Strong on-line community Rich documentation Numerous libraries Expressive features Fast prototyping 5 Introduction: Python’s Holy Trinity Python’s primary NumPy is an extension to Matplotlib is the library for include primary plotting mathematical and multidimensional arrays library in Python. statistical computing. and matrices. Contains toolboxes Supports 2-D and 3-D for: Both SciPy and NumPy plotting. All plots are • Numeric rely on the C library highly customisable optimization LAPACK for very fast and ready for implementation. professional • Signal processing publication. • Statistics, and more…
    [Show full text]