Presentation is loading. Please wait.

Presentation is loading. Please wait.

Introduction to NodeXL Like MSPaint™ for graphs. — the Community.

Published byGretchen Chamness Modified over 9 years ago

Similar presentations

Presentation on theme: "Introduction to NodeXL Like MSPaint™ for graphs. — the Community."— Presentation transcript:

1 Introduction to NodeXL Like MSPaint™ for graphs. — the Community

2 NodeXL Free/Open Network Analysis add-in for Excel 2007/2010 http://nodexl.codeplex.com

3 Who Uses Network Analysis

4

5 Social media Email, Blogs, YouTube… Facebook, Twitter, LinkedIn… Publications Scientific & Legal citations Science Predator-prey networks Biological pathways Epidemic contagion Business Corporate boards Sales networks International trade

6

7

8

9

10 Vertex (Node) Labels & Attribute values Edge (Link, Tie) Directed/Undirected Labels & Attribute values Cohesive Sub-Groups Components Clique Cluster E D F A C B H G I J L K M Network Definitions & Visualization

11 Vertex (Node) Labels & Attribute values Edge (Link, Tie) Directed/Undirected Labels & Attribute values Cohesive Sub-Groups Components Clique Cluster E D F A C B H G I J L K M

12 Many Structures Are Possible

13 Descriptive Network Measures Individual – Centrality Degree (In, Out, Total) Betweenness Closeness Eigenvector Network characteristics – Density – Hierarchy – Diameter

14 NodeXL creates a list of “vertices” from imported social media edges NodeXL displays subgraph images along with network metadata

15 NodeXL “Autofill columns” simplifies mapping data attributes to display attributes

16 NodeXL enables filtering of networks

17

18 Copyright © 2011, Elsevier Inc. All rights Reserved FIGURE 7.11 Chapter 7 Lobbying Coalition network connecting organizations (vertices) that have jointly filed comments on U.S. Federal Communications Commission policies (edges). Vertex size represents number of filings and color represents eigenvector centrality (pink higher). Darker edges connect organizations with many joint filings. Vertices were originally positioned using Fruchterman- Reingold and handpositioned to respect clusters identified by NodeXL’s Find Clusters algorithm.

19 Diane has high degree Heather has high betweenness Example A minimal network can illustrate the ways different locations have different values for centrality and degree

20 http://nodexl.codeplex.com

21 Elizabeth Schwarz, UCRiverside, eschw001@ucr.edu

22

Download ppt "Introduction to NodeXL Like MSPaint™ for graphs. — the Community."

Similar presentations

1 Copyright © 2011, Elsevier Inc. All rights Reserved Chapter 15 Wiki Networks Connections of Creativity and Collaboration Analyzing Social Media Networks.

1 Copyright © 2011, Elsevier Inc. All rights Reserved Chapter 15 Wiki Networks Connections of Creativity and Collaboration Analyzing Social Media Networks.
Network Overview Discovery and Exploration for Excel (NodeXl) Hands On Exercise Presented by: Samer Al-khateeb Class: Social Media Mining and Analytics.

Network Overview Discovery and Exploration for Excel (NodeXl) Hands On Exercise Presented by: Samer Al-khateeb Class: Social Media Mining and Analytics.
Telligent Social Analytics Research & Tools Marc A. Smith Chief Social Scientist Telligent Systems.

Telligent Social Analytics Research & Tools Marc A. Smith Chief Social Scientist Telligent Systems.
2 The NodeXL Project Team About Me Introductions Marc A. Smith Chief Social Scientist Connected Action Consulting Group

2 The NodeXL Project Team About Me Introductions Marc A. Smith Chief Social Scientist Connected Action Consulting Group
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.

Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
Group-In-a-Box Layout for Multi-faceted Analysis of Communities Eduarda Rodrigues, Natasa Milic-Frayling, Marc A. Smith, Ben Shneiderman & Derek Hansen.

Group-In-a-Box Layout for Multi-faceted Analysis of Communities Eduarda Rodrigues, Natasa Milic-Frayling, Marc A. Smith, Ben Shneiderman & Derek Hansen.
Graph Algorithms: Minimum Spanning Tree 1 2 3 4 6 5 10 1 5 4 3 2 6 1 1 8 We are given a weighted, undirected graph G = (V, E), with weight function w:

Graph Algorithms: Minimum Spanning Tree We are given a weighted, undirected graph G = (V, E), with weight function w:
Enabling citizen mapping of government networks with NodeXL Derek Hansen and Marc Smith.

Enabling citizen mapping of government networks with NodeXL Derek Hansen and Marc Smith.
CSE 222 Systems Programming Graph Theory Basics Dr. Jim Holten.

CSE 222 Systems Programming Graph Theory Basics Dr. Jim Holten.
Introduction to Algorithms Second Edition by Cormen, Leiserson, Rivest & Stein Appendix B.

Introduction to Algorithms Second Edition by Cormen, Leiserson, Rivest & Stein Appendix B.
Graphs Chapter 28 Copyright ©2012 by Pearson Education, Inc. All rights reserved.

Graphs Chapter 28 Copyright ©2012 by Pearson Education, Inc. All rights reserved.
Analyzing Social Media Networks with NodeXL

Analyzing Social Media Networks with NodeXL
SOCIAL NETWORK ANALYSIS basic concepts and techniques.

SOCIAL NETWORK ANALYSIS basic concepts and techniques.
Course Overview & Introduction to Social Network Analysis How to analyse social networks?

Course Overview & Introduction to Social Network Analysis How to analyse social networks?
7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.

7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.
Charting Collections of Connections in Social Media: Creating Visualizations with NodeXL Cody Dunne Philip Merrill College of Journalism.

Charting Collections of Connections in Social Media: Creating Visualizations with NodeXL Cody Dunne Philip Merrill College of Journalism.
Spectral Analysis based on the Adjacency Matrix of Network Data Leting Wu Fall 2009.

Spectral Analysis based on the Adjacency Matrix of Network Data Leting Wu Fall 2009.
How to Analyse Social Network?

How to Analyse Social Network?
A project from the Social Media Research Foundation: Finding direction in a sea of connection:

A project from the Social Media Research Foundation: Finding direction in a sea of connection:
Topics Paths and Circuits (11.2) A B C D E F G.

Topics Paths and Circuits (11.2) A B C D E F G.

Similar presentations

Ads by Google