Mapping social media networks (with no coding) using NodeXL

Time: 16:50 on 01 Mar 2012.

Session type: 40 minute presentation

Topics: Visualization & Interface

Description: Maps of the complex connections that form when people link, like, reply, rate, review, favorite, friend, follow, edit, and mention one another can reveal important trends. It is possible to create network maps with free and open tools that identify key people and sub-groups in any social media population with just a few key clicks. Can you make a pie chart? You can now make a network chart.

Abstract: Networks are a data structure common found across all social media services that allow populations to author collections of connections. The Social Media Research Foundation’s (http://www.smrfoundation.org) free and open NodeXL project (http://nodexl.codeplex.com) makes analysis of social media networks accessible to most users of the Excel spreadsheet application. With NodeXL, Networks become as easy to create as pie charts. Applying the tool to a range of social media networks has already revealed the variations present in online social spaces. A review of the tool and images of Twitter, flickr, YouTube, and email networks will be presented.

We now live in a sea of tweets, posts, blogs, and updates coming from a significant fraction of the people in the connected world. Our personal and professional relationships are now made up as much of texts, emails, phone calls, photos, videos, documents, slides, and game play as by face-to-face interactions. Social media can be a bewildering stream of comments, a daunting fire hose of content. With better tools and a few key concepts from the social sciences, the social media swarm of favorites, comments, tags, likes, ratings, and links can be brought into clearer focus to reveal key people, topics and sub-communities. As more social interactions move through machine-readable data sets new insights and illustrations of human relationships and organizations become possible. But new forms of data require new tools to collect, analyze, and communicate insights.

Ines Mergel is my host.  Prof. Mergel is Assistant Professor of Public Administration, Department of Public Administration and International Affairs, and a Senior Research Associate at the Center for Technology and Information Policy at the Maxwell School of Citizenship and Public Affairs, Syracuse University, NY.

I will speak about the patterns we are finding in the data collected and analyzed by NodeXL.

Mastering Social Media 2011 is a workshop scheduled for November 28 and 30 in Cape Town and Johannesburg, South Africa.

My partner, Walter Pike, is a Marketing Maven and Founder of PiKE | New Marketing (www.pike.co.za) and the founder of the Digital Academy www.digitalacademy.co.za
He blogs at walterpike.com.

Mastering Social Media will give you practical tools on how to plan, execute and monitor your social media campaigns. Discussions will lead you through the introduction to social media marketing, understanding community dynamics, mapping social networks and applying network insights to your goals.
Brand Managers, Marketing Managers, Advertising Agencies, Digital Agencies, and PR Agencies are likely to find the day useful.

Venues and Dates

Johannesburg

30 November 2011
Gordon Institute
of Business Science,
Illovo

Pictures:

This map of connections among people who tweeted Teaparty starts on 11/15/2011 14:22 UTC and ends on 11/15/2011 17:23, a total of 3 hours and 1 minute of traffic.

The Teaparty data set contained 1,533 tweets, replies and mentions.
Blue edges are connections created by replies and mentions. Grey lines are follows relationships.

Top most between users:
@ronpaul
@michellemalkin
@christopherhull
@theteaparty_net
@capaction
@thedailyedge
@bill1phd
@dbargen
@gulagbound
@rightcandidates

Graph Metric: Value
Graph Type: Directed
Vertices: 659
Unique Edges: 8808
Edges With Duplicates: 1423
Total Edges: 10231
Self-Loops: 1084
Connected Components: 49
Single-Vertex Connected Components: 44
Maximum Vertices in a Connected Component: 606
Maximum Edges in a Connected Component: 10148
Maximum Geodesic Distance (Diameter): 6
Average Geodesic Distance:2.693965
Graph Density: 0.02036797
NodeXL Version: 1.0.1.193

The major clusters are composed of teaparty supporters. The center bottom cluster are teaparty critics.

This map of the connections among people who tweeted Occupywallstreet starts on 11/15/2011 23:08 and ends on 11/15/2011 23:34 UTC, a total of 26 minutes of traffic.

Occupywallstreet 1,370 tweets, replies and mentions
Blue edges are connections created by replies and mentions. Grey lines are follows relationships.

Top most between users:
@occupywallst
@mmflint
@nyclu
@allisonkilkenny
@andrewbreitbart
@operationleaks
@occupydenver
@theatlantic
@usgeneralstrike
@rt_com

Graph Metric: Value
Graph Type: Directed
Vertices: 1000
Unique Edges: 3546
Edges With Duplicates: 826
Total Edges: 4372
Self-Loops: 794
Connected Components: 241
Single-Vertex Connected Components: 230
Maximum Vertices in a Connected Component: 747
Maximum Edges in a Connected Component: 3998
Maximum Geodesic Distance (Diameter): 7
Average Geodesic Distance: 2.65438
Graph Density: 0.003246246
NodeXL Version: 1.0.1.194

Some notable contrasts:
Teaparty Graph Density: 0.002652645
Occupywallstreet Graph Density: 0.02036797 – significantly lower levels of interconnection
Teaparty: Single-Vertex Connected Components 44 of 1000
Occupywallstreet: Single-Vertex Connected Components 283 of 1000

Many more “isolates” (Single-Vertex Connected Components) in Occupywallstreet.
Many more hubs, and more retweeting activity in Occupywallstreet.

The difference in duration of these data sets illustrates the relative speed of content creation in the topics. The data sets are commensurable in that they are both the result of a single query against the Twitter search API. So both maps are the results of charting connections among the authors of the last 1500 tweets, how ever long that takes to create.

On November 9th and 10th, 2011 the LocalSocialSummit11 will be held in London.

On Thursday morning, November 10th, Doctor Bernie Hogan from the Oxford Internet Institute and member of the Social Media Research Foundation will speak on the topic:

Insights: Social Network Analysis On Facebook Data, with a local twist

Thursday at 3:45 I will speak at the event on:

Charting Collections Of Connections In Social Media

Following the conference from 5 to 6pm will be a reception for the Social Media Research Foundation.

Please join us for refreshments and a discussion of the ways social media analysis tools can guide your engagement with stakeholders around the world.

The event is held at wallacespace:

22 Duke’s Road, London, WC1H 9PN
t +44(0)20 7395 1265
f +44 (0)20 7836 9591
e ask@wallacespace.com

22 Duke’s Road is only minutes walk away from Euston, St Pancras International, King’s Cross and Russell Square Tube.

Registration form for attending the event is below….

I will speak at the International Symposium on Convergence Technology (ConTech 2011) – Smart & Humane World – on November 3rd in Seoul, South Korea.

Date: 2011 November 3 (Thurs)
Place: COEX Grand Ballroom, Seoul, Korea
Organized by Advanced Institutes of Convergence Technologies (AICT), Seoul National University (SNU)
In Cooperation with Ministry of Knowledge Economy, Ministry of Education, Science and Technology, National Research Foundation of Korea, Graduate School of Convergence Science and Technology (GSCST)
Symposium Chair : Choi, Yanghee (President, AICT)

Program
09:00~09:30 Registration
09:30~10:00 Opening Ceremony
Plenary Session : Smart & Humane World through Convergence
10:00~10:40 Speaker (TBD)
10:50~11:30 Speaker (TBD)
11:30~13:00 Lunch
Session 1 : Bio Convergence (Chair : Prof. Kim, Sunghoon)
Session 2 : IT Convergence (Chair : Dr. Lee, Manjai)
Session 3 : Appropriate Technology (Chair : Prof. Kang, Namjun)
13:00~15:00 Scott A. Strobel (Professor, Yale University)
Speaker Kevin Kim (Professor, University of Illinois)
Speaker Masaru Kitsuregawa (Professor, Tokyo University)
Speaker Haesun Park (Professor, Georgia Institute of Technology)
Speaker Marc Smith (Connected Action)
Speaker Sang-goo Lee (Professor, Seoul National University)
Speaker Haklae Kim (Samsung)
Speaker Raghu Ramakrishnan (Yahoo)

My slides: 20111103 con tech2011-marc smith

I will also visit Professor Han Woo Park at YeungNam University (Wikipedia) in Daegu, South Korea to meet with his students in the Webometrics Institute program.

This will be my second trip to Korea, I was there last year for a related event.  Pictures after the jump:

I presented on social media network analysis on October 20, 2011 in New York City at Predictive Analytics World.

A map of the connections among the people tweeting about the #Pawcon hashtag is below.

Network Maps for End Users: Collect, Analyze, Visualize and Communicate Network Insights with Zero Coding

Abstract: Networks are everywhere except the end user desktop.  NodeXL, the free and open network overview, discovery and exploration add-in for the popular and familiar Excel (2007/2010) spreadsheet allows users who are comfortable making pie charts to now make useful network visualizations.  Developed and released by the Social Media Research Foundation, NodeXL uses Excel as a framework, providing a GUI network browser (a “web browser”?) that novices can use quickly and experts can use to generate sophisticated results.  Data importers provide access to a range of social media network data sources like Twitter, flickr, YouTube, Facebook, email, the WWW, and more through standard file formats (CSV, GraphML, Matrix).  Simple to use tools can automatically analyze, visualize and highlight insights in complex network graphs.  Using NodeXL, researchers have been collecting a wide range of network data sets from various social media services.  These images reveal a range of common social formations in social media and point to people who occupy strategic locations in these graphs.

This is a map of the connections among the people who tweeted the term “PAWCON” on the first day of the event:

These are the connections among the Twitter users who recently tweeted the word #pawcon when queried on October 19, 2011, scaled by numbers of followers (with outliers thresholded). Connections created when users reply, mention or follow one another.

A larger version of the image is here: www.flickr.com/photos/marc_smith/6261006732/sizes/l/in/ph…

Top most between users:
@tapan_patel
@pawcon
@sasanalytics
@deloitteba
@kristinevick
@jamet123
@zementis
@kdnuggets
@tibcospotfire
@saspublishing

Graph Metric: Value
Graph Type: Directed
Vertices: 41
Unique Edges: 233
Edges With Duplicates: 120
Total Edges: 353
Self-Loops: 44
Connected Components: 2
Single-Vertex Connected Components: 1
Maximum Vertices in a Connected Component: 40
Maximum Edges in a Connected Component: 352
Maximum Geodesic Distance (Diameter): 4
Average Geodesic Distance: 1.87133
Graph Density: 0.15304878
NodeXL Version: 1.0.1.179

Here is an example map of the connections among the people who tweeted the term “pawcon” in Twitter on September 14th, a week prior to the event.

Manu Sharma, Principle Research Scientist at LinkedIn gave a great presentation on the patterns found in their data.  Big data, for example, showed that most of the people who previously worked at recently failed banks and financial institutions have updated their profiles to show that they mostly have new jobs at some of the remaining companies in the industry.

The event was held at the New York Hilton: Maps & Directions

Threaded conversations are a major form of social media.  Message boards, email and email lists, twitter, blog comments, text messages, and discussion forums are all social media systems built around the message thread data structure.  As messages are exchanged through these systems, some messages are sent as a reply to a particular previous message.  As messages are sent in reply to prior messages, chains of messages form.  Message chains come in two major forms: branching and non-branching.  Branching threads are those that allow more than one message to reply to a prior message.  Non-branching threads are single chains, like a string of pearls, that allow only one message to reply to a prior message.  Many web based message boards are non-branching.  Many email systems and discussion forums are branching.

ThreadMill requires a minimal set of data elements to generate its reports.  A data table must minimally have a column of information for each message that includes the name of the message board, the forum, the thread, and the author, along with a unique identifier for each message and the date and time it was posted.  Optional data elements include the unique identifier of the message being replied to, the URL of the message, and the URL for a profile photo.

All forms of threaded message exchange can be measured.  Simple measures like the count of the number of messages or the number of authors are obvious and useful.  Other measures can be created from more sophisticated analysis.  For example, the network of connections that forms as different authors reply to one another can be extracted and analyzed using network analysis methods.  It is possible to calculate metrics from these networks of reply that describe the location of each person in the graph.

ThreadMill generates several data sets that can be used to create visualizations of the activity and structure of a message board collection.

A Treemap data set can illustrate the hierarchy of encapsulated authors within threads, threads within fora, fora within boards, and boards within collections.  Treemap visualizations of collections of threaded conversations can quickly highlight the most active or populous discussions.

An AuthorLine visualization takes the form of a double histogram, with bubbles representing each thread active in each time period sized by the volume of messages the author contributed, sorted by size.  Threads that have been initiated by the author are represented as bubbles above the center line.  Messages that the author contributes to threads started by other authors are represented as bubbles stacked below the center line.  AuthorLines quickly reveal the pattern of activity an author displays and identifies which of several types of contributors the author is.

A scatter plot visualization represents each author as a bubble in an X-Y space defined by the number of different days the author was active against the average number of messages the author contributes to the threads in which they participate.

A time series line chart reveals the days of maximum and minimum activity along with trends.

A network diagram reveals the overall structure of the discussion space and the people who occupy strategic locations within the network graph.

ThreadMill has received generous assistance from Morningside Analytics.  Bruce Woodson implemented ThreadMill.

These are the connections among the Twitter users who recently tweeted the word #JW11 when queried on October 10, 2011, scaled by numbers of followers (with outliers thresholded). Connections created when users reply, mention or follow one another.

See: www.jivesoftware.com/jiveworld

A larger version of the image is here: www.flickr.com/photos/marc_smith/6234653454/sizes/l/in/ph…

Top most between users:
@jivesoftware
@gialyons
@mikefraietta
@cflanagan
@cosmopolitan_lv
@ginorossi
@kristinhersant
@thebrandbuilder
@alanlepo
@mor_trisha

Graph Metric: Value
Graph Type: Directed
Vertices: 345
Unique Edges: 3606
Edges With Duplicates: 2072
Total Edges: 5678
Self-Loops: 632
Connected Components: 11
Single-Vertex Connected Components: 9
Maximum Vertices in a Connected Component: 334
Maximum Edges in a Connected Component: 5659
Maximum Geodesic Distance (Diameter): 5
Average Geodesic Distance: 2.353001
Graph Density: 0.034184361
NodeXL Version: 1.0.1.179

More NodeXL network visualizations are here: www.flickr.com/photos/marc_smith/sets/72157622437066929/

http://ir12.aoir.org/

These are the  connections among the Twitter users who recently tweeted the word AOIR when queried on October 10, 2011, scaled by numbers of followers (with outliers thresholded). Connections created when users reply, mention or follow one another.

See: ir12.aoir.org/

Top most between users:
@ir12
@barrywellman
@mikemonello
@netcrit
@andresmh
@s_t_e_v_e_jones
@zizip
@kellybergstrom
@katypearce
@guillaumelatzko

Graph Metric: Value
Graph Type: Directed
Vertices: 98
Unique Edges: 119
Edges With Duplicates: 672
Total Edges: 791
Self-Loops: 153
Connected Components: 40
Single-Vertex Connected Components: 35
Maximum Vertices in a Connected Component: 55
Maximum Edges in a Connected Component: 710
Maximum Geodesic Distance (Diameter): 6
Average Geodesic Distance: 2.257477
Graph Density: 0.035766884
NodeXL Version: 1.0.1.179

By expanding the query to include #IR12, the conference hashtag, the network expands to include:

Connections among the Twitter users who recently tweeted the word AOIR OR #IR12 when queried on October 11, 2011, scaled by numbers of followers (with outliers thresholded). Connections created when users reply, mention or follow one another.

Top most between users:
@ir12
@barrywellman
@mikemonello
@netcrit
@andresmh
@s_t_e_v_e_jones
@zizip
@kellybergstrom
@katypearce
@guillaumelatzko

Graph Metric: Value
Graph Type: Directed
Vertices: 231
Unique Edges: 1984
Edges With Duplicates: 2118
Total Edges: 4102
Self-Loops: 586
Connected Components: 46
Single-Vertex Connected Components: 40
Maximum Vertices in a Connected Component: 181
Maximum Edges in a Connected Component: 4012
Maximum Geodesic Distance (Diameter): 5
Average Geodesic Distance: 2.213887
Graph Density: 0.046320346
NodeXL Version: 1.0.1.179

More NodeXL network visualizations are here: www.flickr.com/photos/marc_smith/sets/72157622437066929/

Here is the updated map of connections among people who recently tweeted #occupywallstreet:

These are the connections among the Twitter users who recently tweeted the word OccupyWallStreet when queried on October 10, 2011, scaled by numbers of followers (with outliers thresholded). Connections created when users reply, mention or follow one another.

See: occupywallst.org/

A larger version of the image is here: www.flickr.com/photos/marc_smith/6232030871/sizes/l/in/ph…

Top most between users:
@ajenglish
@anonymousirc
@cnbc
@rawstory
@ryannewyork
@mediabistro
@blogdiva
@brentnhunter
@krenner2
@rebuilddream

Graph Metric: Value
Graph Type: Directed
Vertices: 1000
Unique Edges: 3014
Edges With Duplicates: 720
Total Edges: 3734
Self-Loops: 994
Connected Components: 318
Single-Vertex Connected Components: 300
Maximum Vertices in a Connected Component: 664
Maximum Edges in a Connected Component: 3326
Maximum Geodesic Distance (Diameter): 9
Average Geodesic Distance: 3.508133
Graph Density: 0.002524525
NodeXL Version1.0.1.179

More NodeXL network visualizations are here: www.flickr.com/photos/marc_smith/sets/72157622437066929/

Link: www.flickr.com/photos/marc_smith/6225446144/

Each user is scaled by numbers of followers (with outliers thresholded). Connections created when users reply, mention or follow one another.

See: occupywallst.org/

A larger version of the image is here: www.flickr.com/photos/marc_smith/6225446144/sizes/l/in/ph…

Top most between users:
@maddow
@motherjones
@aclu
@zerohedge
@mmfa
@spread4freedom
@diggrbiii
@angelsavant
@marychastain
@katiepavlich

Graph Metric: Value
Graph Type: Directed
Vertices: 1000
Unique Edges: 3835
Edges With Duplicates: 916
Total Edges: 4751
Self-Loops: 1109
Connected Components: 311
Single-Vertex Connected Components: 301
Maximum Vertices in a Connected Component: 678
Maximum Edges in a Connected Component: 4327
Maximum Geodesic Distance (Diameter): 9
Average Geodesic Distance: 3.283708
Graph Density: 0.003408408
NodeXL Version: 1.0.1.179

More NodeXL network visualizations are here: www.flickr.com/photos/marc_smith/sets/72157622437066929/

The Future of Technology in Education workshop met on 7 October 2011 in London at the University of London Computer Centre (ULCC) to discuss the ways technology is changing the learning experience.

The hashtag for the event is #FOTE11 so I made a NodeXL SNA Map -

The following is a map of the connections among the Twitter users who recently tweeted the word #fote11 when queried on October 7, 2011, scaled by numbers of followers (with outliers thresholded). Connections created when users reply, mention or follow one another.

See: fote-conference.com/wordpress/

Layout using the “Group Layout” composed of tiled bounded regions. Clusters calculated by the Clauset-Newman-Moore algorithm are also encoded by color.

A larger version of the image is here: www.flickr.com/photos/marc_smith/6221247656/sizes/l/in/ph…

Top most between users:
@fotie
@jamesclay
@timbuckteeth
@hopkinsdavid
@dajbelshaw
@eingang
@fredgarnett
@pressfuturist
@grahambm
@eyebeams

Graph Metric: Value
Graph Type: Directed
Vertices: 251
Unique Edges: 2904
Edges With Duplicates: 1908
Total Edges: 4812
Self-Loops: 730
Connected Components: 7
Single-Vertex Connected Components: 6
Maximum Vertices in a Connected Component: 245
Maximum Edges in a Connected Component: 4803
Maximum Geodesic Distance (Diameter): 4
Average Geodesic Distance: 2.246839
Graph Density: 0.052988048
NodeXL Version: 1.0.1.179

The data set for this network is available from the NodeXLGraphGallery.

More NodeXL network visualizations are here: www.flickr.com/photos/marc_smith/sets/72157622437066929/

Orange is a major European telecommunications provider that has been focused on what they call the “porous enterprise” – organizations in which many of the previous boundaries and barriers between businesses and customers are gone.  Social media flows in and out of companies and mixes with public collections of discussions about them. Locked down corporate laptops now are joined by employee owned mobile devices.  Consumer social media products now mingle with enterprise social media.  Corporations now engage directly with customers through public consumer social media services.

For example, Orange has several Twitter accounts.  @Orange provides general product information while @Oranger_Conseil and @OrangeHelpers provide customer support for French and English speaking customers, and @orangeapi offers technical information for developers building applications against services offered by Orange.  There are several other related accounts.

The @Orange account has 2,039 followers and is following 621.  It has 673 tweets.  The pattern of connections among these people emerges into a network that can be clustered into sub-groups:


These are the connections among the Twitter users who follow or are followed by Orange when queried on September 30, 2011, scaled by numbers of followers (with outliers thresholded). Connections created when users follow one another.

A larger version of the image is here: www.flickr.com/photos/marc_smith/6209515710/sizes/l/in/ph…

Top most between users:
@orange
@orangebusiness
@twitter
@ygourven
@pressecitron
@frenchweb
@lionelfumado
@sosh_fr
@lemondefr
@mashable

Graph Metric: Value
Graph Type: Directed
Vertices: 1587
Unique Edges: 18724
Edges With Duplicates: 26647
Total Edges: 45371
Self-Loops: 0
Connected Components: 229
Single-Vertex Connected Components: 227
Maximum Vertices in a Connected Component: 1358
Maximum Edges in a Connected Component: 45367
Maximum Geodesic Distance (Diameter): 7
Average Geodesic Distance: 2.625415
Graph Density: 0.012709666
NodeXL Version: 1.0.1.179

The dense follows/follower map is a network that represents potential communication, the links indicate that there is a “follows” relationship between any two people.  The network of activated connections created when people reply or mention one another is more sparse.  For example, the @Oranger_Conseil and @OrangeHelpers accounts get mentioned by a number of other users who interact with them.  The connections among these people creates a network pattern:

This is a map of the connections among the Twitter users who recently tweeted the word Orange conseil OR OrangeHelpers when queried on September 30, 2011, scaled by numbers of followers (with outliers thresholded). Connections created when users reply, mention or follow one another.

It is characterized by a hub and spoke pattern created as customers who have few connections to one another are linked to one of the hub customer service accounts for English and French speakers.

Top most between users:
@orangehelpers
@orange_conseil
@orange
@thomaslegac
@conorfromorange
@orangeripoff
@presseorange
@orangecomplaint
@lisepressac
@poupimali

Graph Metric: Value
Graph Type: Directed
Vertices: 372
Unique Edges: 474
Edges With Duplicates: 3308
Total Edges: 3782
Self-Loops: 73
Connected Components: 2
Single-Vertex Connected Components: 1
Maximum Vertices in a Connected Component: 371
Maximum Edges in a Connected Component: 3781
Maximum Geodesic Distance (Diameter): 4
Average Geodesic Distance: 2.356011
Graph Density: 0.008361592
NodeXL Version: 1.0.1.179

Mentions of these accounts are good indications that the topic is the Orange Telecom company and not the many other Orange entities (like Orange County, the fruit, and the color, among others).  Searching for the term “Orange” or even “#Orange will likely bring back a large amount of these “name-space collisions” – overlapping uses of the term “Orange”.

These are the connections among the Twitter users who recently tweeted the word #Orange when queried on October 3, 2011, scaled by numbers of followers (with outliers thresholded). Connections created when users reply, mention or follow one another.

This network of connections among the population of people who tweeted the term “#Orange has many “isolates” – users who do not follow, reply or mention any other person in the network.  These people all tweeted “#Orange” but they lack any connection to anyone else who did so.

The large cluster of connected users is a group of people discussing the Orange Telecom company, while the other clusters involve people discussing the colors of Autumn (Pumpkins!).

Top most between users:
@bluetouff
@laouffir
@fbrahimi
@presseorange
@damiendouani
@gregfromparis
@eogez
@thomaslegac
@isabellespanu
@challenges

Graph Metric: Value
Graph Type: Directed
Vertices: 1000
Unique Edges: 2282
Edges With Duplicates: 960
Total Edges: 3242
Self-Loops: 1170
Connected Components: 584
Single-Vertex Connected Components: 515
Maximum Vertices in a Connected Component: 155
Maximum Edges in a Connected Component: 1123
Maximum Geodesic Distance (Diameter): 8
Average Geodesic Distance: 2.787863
Graph Density: 0.001827828
NodeXL Version: 1.0.1.179

More NodeXL network visualizations are here: www.flickr.com/photos/marc_smith/sets/72157622437066929/

At the end of the conference on October 5th, the network of connections among the people who tweeted about Wikisym looked like this:

These are the connections among the Twitter users who recently tweeted the word wikisym when queried on October 5, 2011, scaled by numbers of followers (with outliers thresholded). Connections are created when users reply, mention or follow one another.

See: www.wikisym.org/

Top most between users:
@edchi
@jfelipe
@phauly
@readermeter
@hfordsa
@wikisym
@clifflampe
@staeiou
@geoplace
@wikimedia

Graph Metric: Value
Graph Type: Directed
Vertices: 170
Unique Edges: 1163
Edges With Duplicates: 2165
Total Edges: 3328
Self-Loops: 658
Connected Components: 5
Single-Vertex Connected Components: 3
Maximum Vertices in a Connected Component: 165
Maximum Edges in a Connected Component: 3319
Maximum Geodesic Distance (Diameter): 6
Average Geodesic Distance: 2.385502
Graph Density: 0.052941176
NodeXL Version: 1.0.1.179

In contrast, a few days earlier, these are the connections among the Twitter users who recently tweeted the word wikisym when queried on October 3, 2011, scaled by numbers of followers (with outliers thresholded). Connections created when users reply, mention or follow one another.

Top most between users:
@wikisym
@jfelipe
@andicat
@geoplace
@staeiou
@dirkriehle
@wikimedia
@edchi
@bkeegan
@hfordsa

Graph Metric: Value
Graph Type: Directed
Vertices: 78
Unique Edges: 459
Edges With Duplicates: 354
Total Edges: 813
Self-Loops: 132
Connected Components: 10
Single-Vertex Connected Components: 8
Maximum Vertices in a Connected Component: 68
Maximum Edges in a Connected Component: 800
Maximum Geodesic Distance (Diameter): 5
Average Geodesic Distance: 2.207506
Graph Density: 0.086913087
NodeXL Version: 1.0.1.179

More NodeXL network visualizations are here: www.flickr.com/photos/marc_smith/sets/72157622437066929/

NodeXL is free and open and available from www.codeplex.com/nodexl

NodeXL is developed by the Social Media Research Foundation (www.smrfoundation.org) – which is dedicated to open tools, open data, and open scholarship.

The book, Analyzing social media networks with NodeXL: Insights from a connected world, is available from Morgan Kaufmann and from Amazon.

Marc Smith on Twitter.

I have enjoyed and been educated by my previous visits to South Africa and the Mobile Web in Africa conference, now in its 3rd year.

MWA gathers the many parts of the picture of mobile technologies in play across the African continent.

I will speak again at this year’s event, focusing on social media networks.  My partner is Walter Pike, a marketing professional with a specialty in digital media.

Here is the agenda for the workshop on Friday, November 25th.

Photos from the prior two years of Mobile Web Africa after the jump:

2010

2009

The recent Strata Conference in New York City gathered many leaders in big data, data mining, and information visualization.

Link: www.flickr.com/photos/marc_smith/6203313170

Connections among the Twitter users who recently tweeted the word Strata when queried on September 20, 2011, scaled by numbers of followers (with outliers thresholded). Connections created when users reply, mention or follow one another.

See: strataconf.com/summit2011

Layout using the “Group Layout” composed of tiled bounded regions. Clusters calculated by the Clauset-Newman-Moore algorithm are also encoded by color.

A larger version of the image is here: www.flickr.com/photos/marc_smith/6203313170/sizes/l/in/ph…

Betweenness Centrality is defined here: en.wikipedia.org/wiki/Centrality#Betweenness_centrality

Clauset-Newman-Moore algorithm is defined here: pre.aps.org/abstract/PRE/v70/i6/e066111

Top most between users:
@timoreilly
@strataconf
@doctorow
@acroll
@ticbeat
@datacenter
@hnshah
@oreillymedia
@markmadsen
@unglobalpulse

Graph Metric: Value
Graph Type: Directed
Vertices: 1118
Unique Edges: 5813
Edges With Duplicates: 6522
Total Edges: 12335
Self-Loops: 1010
Connected Components: 9
Single-Vertex Connected Components: 8
Maximum Vertices in a Connected Component: 1110
Maximum Edges in a Connected Component: 12327
Maximum Geodesic Distance (Diameter): 6
Average Geodesic Distance: 2.575622
Graph Density: 0.00647018
NodeXL Version: 1.0.1.177

More NodeXL network visualizations are here: www.flickr.com/photos/marc_smith/sets/72157622437066929/
NodeXL is free and open and available from www.codeplex.com/nodexl
NodeXL is developed by the Social Media Research Foundation (www.smrfoundation.org) – which is dedicated to open tools, open data, and open scholarship.
The book, Analyzing social media networks with NodeXL: Insights from a connected world, is available from Morgan Kaufmann and from Amazon.

This is a map of the connections among the Twitter users who recently tweeted the word HealthTap when queried on September 28, 2011, scaled by numbers of followers (with outliers thresholded). Connections created when users reply, mention or follow one another.

See: healthtap.com/

Layout using the “Group Layout” composed of tiled bounded regions. Clusters calculated by the Clauset-Newman-Moore algorithm are also encoded by color.

A larger version of the image is here: www.flickr.com/photos/marc_smith/6198785341/sizes/l/in/ph…

Betweenness Centrality is defined here: en.wikipedia.org/wiki/Centrality#Betweenness_centrality

Clauset-Newman-Moore algorithm is defined here: pre.aps.org/abstract/PRE/v70/i6/e066111

Top most between users:
@lifehacker
@healthtap
@drpam4women
@androidandme
@drpam
@amazonwireless
@jonmrich
@etseng
@mobilehealth
@doctor_v

Graph Metric: Value
Graph Type: Directed
Vertices: 638
Unique Edges: 3630
Edges With Duplicates: 1337
Total Edges: 4967
Self-Loops: 865
Connected Components: 183
Single-Vertex Connected Components: 167
Maximum Vertices in a Connected Component: 426
Maximum Edges in a Connected Component: 4677
Maximum Geodesic Distance (Diameter): 11
Average Geodesic Distance: 3.098025
Graph Density: 0.008715423
NodeXL Version: 1.0.1.177

More NodeXL network visualizations are here: www.flickr.com/photos/marc_smith/sets/72157622437066929/

NodeXL is free and open and available from www.codeplex.com/nodexl
NodeXL is developed by the Social Media Research Foundation (www.smrfoundation.org) – which is dedicated to open tools, open data, and open scholarship.
The book, Analyzing social media networks with NodeXL: Insights from a connected world, is available from Morgan Kaufmann and from Amazon.

I will speak at Purdue University on September 22 and 23, 2011 about mapping social media networks.

My host is Sorin Matei, professor of Communications, who has been researching the social structure of social media networks.

I will also speak at Professor Matei’s class: COM 63200 On-line Interaction and Facilitation

Here is an example map of the connections among the people who tweeted the word “Purdue” on September 16th, 2011:

Connections among the Twitter users who recently tweeted the word Purdue when queried on September 16, 2011, scaled by numbers of tweets (with outliers thresholded). Connections created when users reply, mention or follow one another.

See: www.purdue.edu/

Layout using the “Group Layout” composed of tiled bounded regions. Clusters calculated by the Clauset-Newman-Moore algorithm are also encoded by color.

(Edges connecting users are bundled and curved with recent features added to NodeXL v.177.)

A larger version of the image is here: www.flickr.com/photos/marc_smith/6155750905/sizes/o/in/ph…

Betweenness Centrality is defined here: en.wikipedia.org/wiki/Centrality#Betweenness_centrality

Clauset-Newman-Moore algorithm is defined here: pre.aps.org/abstract/PRE/v70/i6/e066111

Top most between users:
@lifeatpurdue
@jajuanjohnson
@stfu_gabby
@purdueexponent
@charliienosheen
@mbrister2
@boilerfootball
@purduesports
@hipandresanbo
@cheesebrrrrr

Graph Metric: Value
Graph Type: Directed
Vertices: 1000
Unique Edges: 4045
Edges With Duplicates: 706
Total Edges: 4751
Self-Loops: 977
Connected Components: 429
Single-Vertex Connected Components: 395
Maximum Vertices in a Connected Component: 528
Maximum Edges in a Connected Component: 4134
Maximum Geodesic Distance (Diameter): 12
Average Geodesic Distance: 3.517707
Graph Density: 0.003507508
NodeXL Version: 1.0.1.177

More NodeXL network visualizations are here: www.flickr.com/photos/marc_smith/sets/72157622437066929/

NodeXL is free and open and available from www.codeplex.com/nodexl

NodeXL is developed by the Social Media Research Foundation (www.smrfoundation.org) – which is dedicated to open tools, open data, and open scholarship.

The book, Analyzing social media networks with NodeXL: Insights from a connected world, is available from Morgan Kaufmann and from Amazon.

 

Please vote on our SxSW 2012 panel:

Thanks for your vote for our SxSW panel!

A detailed outline of all the topics covered is available:

The help file will be updated as new features are added.

NodeXL Excel Template Help File:

An Overview of Network Graphs
A Quick Tour of the NodeXL Workbook
The NodeXL Worksheets
The Graph Pane
The NodeXL Ribbon Tab
Creating a Simple Graph
Directed vs. Undirected Graphs
Graphs with Isolated Vertices
Zooming, Moving Around and Scaling the Graph
Zooming the Graph
Moving Around the Graph
Scaling the Graph
Selecting Graph Elements
Selecting Vertices
Selecting Edges
Changing How the Graph Looks
Default Visual Properties: Graph Options
Setting Visual Properties for Individual Edges, Vertices or Groups
Automatically Calculating Visual Properties for All Edges, Vertices or Groups
Labeling Edges and Vertices
Changing How the Graph is Laid Out
Layout Algorithms
Selectively Laying Out Parts of the Graph Again
Snapping Vertices to a Grid
Layout Options
Saving an Image of the Graph
Analyzing the Graph
Calculating Graph Metrics
Creating Subgraph Images
Using Dynamic Filters
Working with Options
Using the Current Workbook’s Options for New Workbooks
Exporting and Importing Options
Resetting All Options
Working with Groups
Creating Groups
Creating Groups by Vertex Attribute
Creating Groups by Connected Component
Creating Groups by Cluster
Manually Creating Groups
Understanding the Group Worksheets
How Groups Are Shown in the Graph Pane
Selecting Groups
Collapsing and Expanding Groups
Removing Groups
Showing and Hiding Workbook Columns
Showing and Hiding Graph Elements
Importing Graph Data
Importing Graph Data from Other Programs
Importing Graph Data from Another Workbook
Importing Graph Data from Email
Importing Graph Data from Online Social Networks
Exporting Graph Data
Exporting Graph Data to Other Programs
Exporting Graph Data to Another Workbook
Merging Duplicate Edges
Automating Common Tasks
The NodeXL Network Server
Where to Go for More Information

This is a map of the connections among the people who tweeted the terms “FOCAS11″ or “Aspen Institute” on August 2, 2011.

Connections among the Twitter users who recently tweeted the word Aspeninstitute OR FOCAS11 when queried on August 2, 2011, scaled by numbers of followers (with outliers thresholded). Connections created when users reply, mention or follow one another.

See: www.aspeninstitute.org/policy-work/communications-society…

Layout using the “Group Layout” composed of tiled bounded regions. Clusters calculated by the Clauset-Newman-Moore algorithm are also encoded by color.

A larger version of the image is here: www.flickr.com/photos/marc_smith/6001893675/sizes/o/

Betweenness Centrality is defined here: en.wikipedia.org/wiki/Centrality#Betweenness_centrality

Top most between users:
@aspeninstitute
@lancearmstrong
@emptywheel
@knightfdn
@pkedrosky
@bostonreview
@josefjohann
@kgosztola
@utknightcenter
@sowers

Graph Metric: Value
Graph Type: Directed
Vertices: 324
Unique Edges: 649
Edges With Duplicates: 743
Total Edges: 1392
Self-Loops: 339
Connected Components: 81
Single-Vertex Connected Components: 76
Maximum Vertices in a Connected Component: 240
Maximum Edges in a Connected Component: 1284
Maximum Geodesic Distance (Diameter): 7
Average Geodesic Distance: 2.67739
Graph Density: 0.007023277
NodeXL Version: 1.0.1.173

More NodeXL network visualizations are here: www.flickr.com/photos/marc_smith/sets/72157622437066929/

NodeXL is free and open and available from www.codeplex.com/nodexl

NodeXL is developed by the Social Media Research Foundation (www.smrfoundation.org) – which is dedicated to open tools, open data, and open scholarship.

The book, Analyzing social media networks with NodeXL: Insights from a connected world, is available from Morgan Kaufmann and from Amazon.

Here is a map of the connections among the people who tweeted the term “AEJMC” on August 7, 2011:

The top most between people in this network are:@aejmc, @jlab, @karenrussell, @terryflynn, @natcomm, @tmccorkindale, @derigansilver, @tkell, @aejmconlineads, and @jeremyhl:

I will present a Workshop on Social Media Network Analysis and NodeXL at the 9 August 2011 – Association for Education in Journalism and Mass Communication (http://www.aejmc.com) in St. Louis, Missouri along with my colleague Professor Hernando Rojas, from the School of Journalism & Mass Communication, University of Wisconsin – Madison.

See: http://www.aejmc.com/home/events/annual-convention/

The Association for Education in Journalism and Mass Communication (AEJMC) is a nonprofit, educational association of journalism and mass communication educators, students and media professionals. The Association’s mission is to promote the highest possible standards for journalism and mass communication education, to cultivate the widest possible range of communication research, to encourage the implementation of a multi-cultural society in the classroom and curriculum, and to defend and maintain freedom of communication in an effort to achieve better professional practice and a better informed public.

Our session is:

Using NodeXL for Social Network Analysis
Tuesday — 2 pm to 5 pm
Presented by Communication Theory and Methodology Division
This pre-conference workshop examines social network analysis. Social network analysis can be used to examine message boards, blogs, and friend networks (amongmany other phenomena). Participants will learn to use the NodeXL program to conduct a network analysis. For information, contact Michel M. Haigh, Pennsylvania State University at mmh25@psu.edu.

A new NodeXL data provider (“spigot“) is now available to extract these social networks from Exchange servers.

This is the Exchange Spigot for NodeXL a configurable interface for defining and executing a query against a Microsoft Exchange email server designed to be used with NodeXL.

NodeXL is an easy to use add-in for the familiar Excel spreadsheet that adds support for network overview, discovery and exploration. The free and open NodeXL project has several import data providers that extract and display networks from popular social media network repositories like Twitter, Flickr, YouTube, the WWW and more.

By adding an Exchange Spigot to your installation of NodeXL you gain a simple way to extract networks from your own email stored on an Exchange server. With appropriate permissions and in compliance with local and legal requirements, the Exchange Spigot can access email and extract social network data across multiple email user accounts.

If available, Active Directory metadata is integrated with email data extracted from the Exchange server. Profile metadata is added to the network workbook when available (typically only for email from other employees, not people from outside your company or division).

The Exchange Spigot for NodeXL is one of several related projects to provide a connection between valuable sources of network data structures and the easy-to-use network browser, NodeXL. Additional projects have implemented connections to web crawlers, Facebook, and soon, SharePoint.

The Exchange Spigot for NodeXL project team includes: Luka Potkonjak, Milos Lazarevic, Ivan Vujic, Natasa Milic-Frayling, and Marc Smith.

The Exchange Spigot for NodeXL project is coordinated by the Social Media Research Foundation (http://www.smrfoundation.org) and receives generous support from Microsoft Research.

The ACM CHI 2011 Conference is taking place in Vancouver, BC.

May 10, 2011

May 8, 2011

These are the connections among the Twitter users who recently tweeted the word chi2011 when queried on May 8, 2011, scaled by numbers of followers (with outliers thresholded). Connections created when users reply, mention or follow one another.

Layout using the “Group Layout” composed of tiled bounded regions. Clusters calculated by the Clauset-Newman-Moore algorithm are also encoded by color.

A larger version of the network map is here: www.flickr.com/photos/marc_smith/5701022497/sizes/o/in/ph…

Top most between users:
@chi2011
@msftresearch
@edchi
@jeffbigham
@landay
@evanmpeck
@acagamic
@clifflampe
@yardi
@eytanadar

Graph Metric: Value
Graph Type: Directed
Vertices: 421
Unique Edges: 3849
Edges With Duplicates: 324
Total Edges: 4173
Self-Loops: 0
Connected Components: 32
Single-Vertex Connected Components: 29
Maximum Vertices in a Connected Component: 384
Maximum Edges in a Connected Component: 4146
Maximum Geodesic Distance (Diameter): 6
Average Geodesic Distance: 2.553249
Graph Density: 0.022587943

NodeXL Version1.0.1.167

Data set in NodeXL format.

NodeXL is free and open and available from www.codeplex.com/nodexl

NodeXL is developed by the Social Media Research Foundation (www.smrfoundation.org) – which is dedicated to open tools, open data, and open scholarship.

29 June – 2 July 2011
Queensland University of Technology

Tweet with the hashtag #ct2011

http://ct2011.urbaninformatics.net/

C&T 2011 OVERVIEW

The biennial Communities and Technologies (C&T) conference is the premier international forum for stimulating scholarly debate and disseminating research on the complex connections between communities – both physical and virtual – and information and communication technologies.

C&T 2011 welcomes participation from researchers, designers, educators, industry, and students from the many disciplines and perspectives bearing on the interaction between community and technology, including architecture, arts, business, design, economics, education, engineering, ergonomics, information technology, geography, health, humanities, law, media and communication studies, and social sciences. The conference program will include competitively selected, peer-reviewed papers, as well as pre-conference workshops, a doctoral consortium, and invited keynote and panel speakers.

Marcus Foth
Conference Chair

IMPORTANT DATES
30 April 2011: Workshop papers, Doctoral Consortium and Student Volunteer applications due
29 June 2011: Pre-conference workshops and Doctoral Consortium
30 June – 2 July 2011: C&T 2011 conference at QUT, Brisbane, Australia

CONFERENCE TOPICS

C&T 2011 welcomes contributions in all areas of community and technology research, design and development. In addition, we particularly invite authors to address any of the following topics:

Augmented Reality
Civic Intelligence
Context and Location Awareness
Community-centred Design and Evaluation Methodologies
Community Engagement
E-research with Communities
E-government and E-governance
Participation
Smart Community Services
Sustainability
Universal Usability and Accessibility
Urban Informatics
Tangible Interfaces for Community Interaction
Technologies of Scale Making
Visualisation Techniques
Working across Cultures

http://ct2011.urbaninformatics.net/

#ct2011

This is a map of the connections among the Twitter users who recently tweeted the words #rw2011 when queried on April 28, 2011, scaled by numbers of followers (with outliers thresholded), connected by replying, mentioning and following.

Layout using the “Group Layout” composed of tiled bounded regions. Clusters calculated by the Clauset-Newman-Moore algorithm are also encoded by color.

A larger version of the network map is here: www.flickr.com/photos/marc_smith/5666637994/sizes/o/

A detailed list of top most between users is here: www.flickr.com/photos/marc_smith/5666069249/

Top most between users: @nytimes, @skynews, @peoplemag, @royalweddingcnn, @itv_news, @katewilliam2011, @julieetchitv, @abc, @cbsnews, @abcroyals

Graph Metric: Value
Graph Type: Directed
Vertices: 1000
Unique Edges: 1735
Edges With Duplicates: 531
Total Edges: 2266
Self-Loops: 0
Connected Components: 271
Single-Vertex Connected Components: 246
Maximum Vertices in a Connected Component: 701
Maximum Edges in a Connected Component: 2199
Maximum Geodesic Distance (Diameter): 11
Average Geodesic Distance: 3.892905
Graph Density: 0.001984985
NodeXL Version: 1.0.1.166

NodeXL is free and open and available from www.codeplex.com/nodexl

NodeXL is developed by the Social Media Research Foundation (www.smrfoundation.org) – which is dedicated to open tools, open data, and open scholarship.

The book, Analyzing social media networks with NodeXL: Insights from a connected world, is available from Morgan Kaufmann and from Amazon.

I will be speaking at the Oxford Internet Institute on July 13 and 14, 2011 as part of the Summer Doctoral Program.

I will speak about the use of social network analysis and visualization techniques to analyze and understand social media.

The Summer Doctoral Program is designed to

…bring together advanced doctoral students engaged in dissertation research relating to the Internet and other ICTs. By sharing their work and learning from leading academics in the field, students can enhance the quality and significance of their thesis research and create a peer network of excellent young researchers.

The 2011 Summer Doctoral Programme will draw substantially upon the OII’s research strengths and will involve participation from many of our faculty, together with colleagues from other partner institutions. It will emphasise methodological innovation and good practice in research design, and will expose students to the benefits of discussing their research in a multi-disciplinary teaching environment.”

http://www.ischools.org/iConference11/2011index/

Our paper, Finding Social Roles in Wikipedia,  about the variety of  roles people perform in Wikis received the best paper award (along with 4 others) in a field of 86 papers.   The 2011 iConference accepted 86 papers, and had about 550 attendees.

The paper is authored by: Howard T. Welser at Ohio University, Austin Lin at Cornell University and Microsoft, Dan Cosley, Fedor Dokshin, Gueorgi Kossinets and Geri Gay at  Cornell University, and Marc Smith from Connected Action.

The paper pdf pre-print is available here: http://oak.cats.ohiou.edu/~welser/Welser.Cosley.plus.Wiki.Roles.pdf

The link to the ACM abstract and pdf: http://portal.acm.org/citation.cfm?id=1940778&CFID=9933318&CFTOKEN=58981138

Abstract: This paper investigates some of the social roles people play in the online community of Wikipedia. We start from qualitative comments posted on community oriented pages, wiki project memberships, and user talk pages in order to identify a sample of editors who represent four key roles: substantive experts, technical editors, vandal fighters, and social networkers. Patterns in edit histories and egocentric network visualizations suggest potential “structural signatures” that could be used as quantitative indicators of role adoption. Using simple metrics based on edit histories we compare two samples of Wikipedians: a collection of long term dedicated editors, and a cohort of editors from a one month window of new arrivals. According to these metrics, we find that the proportions of editor types in the new cohort are similar those observed in the sample of dedicated contributors. The number of new editors playing helpful roles in a single month’s cohort nearly equal the number found in the dedicated sample. This suggests that informal socialization has the potential provide sufficient role related labor despite growth and change in Wikipedia. These results are preliminary, and we describe several ways that the method can be improved, including the expansion and refinement of role signatures and identification of other important social roles.

Web Science Doctoral Summer School 2011

I will be attending and speaking at the upcoming 2011 Web Science Trust Graduate Summer School tobe held at DERI, NUI Galway Ireland from July 6th to July 13th, 2011.  I will speak about social media network analysis and run a workshop on using NodeXL.  There is a packed schedule featuring a great group of researchers who are gathering at the event, including:

* Prof. Wendy Hall is Professor of Computer Science at the University of Southampton, UK, and Dean of the Faculty of Physical and Applied Sciences.
* Prof. Nigel Shadbolt is Professor of Artificial Intelligence (AI) and Deputy Head (Research) of the School of Electronics and Computer Science at the University of Southampton.
* Prof. Stefan Decker is a professor at the National University of Ireland, Galway, and director of the Digital Enterprise Research Institute.
* Dr. Harith Alani is a senior lecturer at the Knowledge Media Institute, where he is heading a group specialising in Social Semantics.
* Dr. Bernie Hogan is a Research Fellow at the Oxford Internet Institute. He specializes in novel methods for online data capture and analysis, especially via social media.
* Prof. Scott Kirkpatrick has a background in physics (AB Princeton, PhD Harvard) and 15 years of developing new technologies at IBM’s TJ Watson Research Center before coming to the Hebrew University in 2000.
* Prof. Enric Plaza holds a Ph.D. in Computer Science by the Technical University of Catalonia (UPC) and is Research Professor of the Spanish Council for Scientific Research (CSIC).
* Prof. Steffen Staab is the director of Institute WeST – Web Science and Technologies and of the Institute for Computer Science of the University of Koblenz-Landau, Germany.
* Dr. Derek Greene is a Research Fellow at the School of Computer Science and Informatics, University College Dublin. As part of the Clique Research Cluster, his focus is on network analysis and community finding, with a particular emphasis on dynamic mobile and social media networks.
* Dr. Michael Hausenblas is a Research Fellow at DERI, NUI Galway, where he leads the Linked Data Research Centre.
* Dr. Daniele Quercia is Horizon researcher at the University of Cambridge (UK). he is interested in computational social science, web science, and social computing.
* Dr. Markus Strohmaier is an Assistant Professor at the Knowledge Management Institute, Faculty of Computer Science at Graz University of Technology.

The event is focused on the methods and theories needed to grasp the nature of the social implications of the rapid changes in the technologies of communication and computation:

“The Web is the largest technological artefact in existence, comprising a global network of information sites and services. It is a social machine, delivering information between people and communities, embedded in almost all processes of human society: education, medicine, science and technology, commerce, entertainment and social activity. It is often simply supposed that the Web is a neutral technology, a stable computing platform for the delivery of information and services. What is overlooked is that the Web is changing constantly in response to the demands of human society. Incremental innovations leads to changes in how people use the Web and in turn how Web technology responds to changed human interaction. Small technological decisions influence how individuals use the Web and ripple out to have unanticipated macro-effects. Sometimes these effects are beneficial such as the emergence of Web 2.0 technologies. Other technologies such as the rise of spam bots or ‘blackhat’ search engine optimisation techniques clutter the Web with irrelevant, distracting information. While influential corporations such as Google, Facebook and Microsoft generate huge revenues from the Web, the Web itself is owned by everyone and no-one. We need to fully understand the demands placed on the Web by human society, so that its fate does not lead to a ‘tragedy of the commons’ but to a sustainable technological resource for the future.”

http://webscience.deri.ie/index.html

Read More

Lists are a recent feature of Twitter which enable users to compile collections of users to follow in a single tweet stream.  People can add up to 500 people to follow on a single list.    People on a list may be connected to one another if one follows the other.

Some people on a list may have many connections.  Some have only a few or even no connections to others on the list.

In version 161 of NodeXL you may now create maps of the connections among a list of Twitter users.

There are two options in this feature.  One makes use of the List functions in Twitter.  If you request the map for a single twitter list, NodeXL will build a map of the connections among all the people Twitter reports as being on the list.  You can create and manage the people on a list using the Twitter list features, or select an existing Twitter list created by other users.

A second option in this feature accepts a list of up to 10,000 twitter user names pasted into the query text box.  If you have a list of users and want a map of how they are connected, and the list is not already in Twitter, just paste them here and get a map.

Either way, a connection will be created for every two users if one follows the other.

Here is an example of the network map of the Twitter list of social network analysis people maintained by Valdis Krebs: valdiskrebs\network-analysts

I will be speaking at the next Predictive Analytics World in San Francisco– March 14-15, 2011 about measuring and mapping social media networks with NodeXL:

Social Data: Advanced Methods – Social (Media) Network Analysis with NodeXL
www.predictiveanalyticsworld.com/sanfrancisco/2011/agenda.php#day2-13a

Networks are the common data structure that unify the otherwise diverse range of social media services. In this session learn how to extract social networks from various social media systems and analyze and visualize the structures found in collections of connections. Learn to use the free and open NodeXL add-in for Excel 2007/2010 to analyze email, twitter, facebook, youtube, www, flickr, and wiki networks.

Here is an example – a map of the connections among the people who recently tweeted the string “#pawcon”.

Connections among the Twitter users who recently mentioned PAWCON when queried on March 14, 2011 including tweets from the period 3/10/2011 15:13 to 3/15/2011 3:51, scaled by numbers of followers.
NodeXL is available from www.codeplex.com/nodexl

The top most between contributors were: @tapan_patel, @jamet123, @zementis, @pawcon, @ibmspss, @sasanalytics, @kristinevick, @waynettetubbs, @dataspora, @inside_r

Institute for Communication Technology Management

http://www.marshall.usc.edu/faculty/centers/ctm/events

On March 10th, 2011 I will speak on a panel at the USC Marshall School of Business Institute for Communication Technology Management Executive Roundtable.

]]> http://www.connectedaction.net/2011/03/05/10-march-2011-usc-marshall-school-of-business-communication-technology-executive-roundtable/feed/ 0 http://www.connectedaction.net/2011/01/20/workshop-january-28th-2011-salinas-ca-mapping-social-media-networks-with-nodexl/?utm_source=rss&utm_medium=rss&utm_campaign=workshop-january-28th-2011-salinas-ca-mapping-social-media-networks-with-nodexl http://www.connectedaction.net/2011/01/20/workshop-january-28th-2011-salinas-ca-mapping-social-media-networks-with-nodexl/#comments Fri, 21 Jan 2011 07:00:41 +0000 Marc Smith http://www.connectedaction.net/?p=3975

Mapping Social Networks with NodeXL:
Finding Direction in a Sea of Connection

The Community Foundation for Monterey County has a Social Network Support project that has already applied network analysis techniques to map networks of nonprofit organizations (http://www.cfmco.org/index.cfm/id/18/Social-Network-Support/). They recognize that awareness and improved methods of working in networks can provide opportunities for new ideas, increase information flow, and help systems change. Mapping networks is one method to assess the structure of communications and work patterns. As a result, the foundation is hosting a workshop on Friday, January 28th, that will focus on improving network effectiveness by creating maps with NodeXL, the free, open-source network mapping tool. The Community Foundation for Monterey County is generously opening the introductory workshop free to the community! The workshop is free but pre-registration is required (http://cfmcmapping.eventbrite.com).  If you do plan to attend, I encourage you to download NodeXL prior to the workshop and bring a Windows laptop as well as any data sets you already have and want to map during the workshop. NodeXL is compatible with Microsoft Office 2007 and 2010 and Windows XP, Vista, and 7. NodeXL is not compatible with Microsoft Office 2003 or Office 2008 for Mac.  It is possible to rent a low cost virtual Windows machines from Amazon and access them on a Mac using remote desktop (see: How to run NodeXL on a connected Mac (or other platform) using Amazon EC2). Of course, you may want to get the companion book: Analyzing social media networks with NodeXL: Insights from a connected world prior to the workshop as well.

If you cannot attend I believe there will be a video recording that will be made available shortly after the event.

This workshop is a hands-on guide to extracting and analyzing a social network graph (with NO programming). Using examples from Twitter, YouTube, Email, flickr, and participant submissions, we will review the steps needed to take a network graph from collection through analysis and visualization to insight. Learn to tell stories about key people and groups with network visualizations. Participants will receive an introduction to social network analysis and NodeXL; be able to import network data; create a network map; and generate an actionable insight from a network map.

NodeXL allows users to generate network maps by importing data from Microsoft Office Excel. Participants are encouraged to download NodeXL prior to the workshop and bring a laptop and data sets when they attend to use during the workshop.

NodeXL is available from: http://nodexl.codeplex.com/ and is a project managed by the Social Media Research Foundation with generous support from the Microsoft Research External Research Projects Group.

Friday, January 28, 2011
9:00 AM to 5:00 PM
Hartnell College
411 Central Ave
CALL 208 (Center for Assessment and Lifelong Learning)
Salinas, CA

An agenda is below and full workshop description is available at:

http://www.cfmco.org/index.cfm/id/111/Workshops-Professional-Development/

The workshop is free; however space is limited to 60.

A continental breakfast will be provided.

Participants are responsible for purchasing $1.00 Hartnell College parking permit.

The CALL Building is near the parking structure on Central Avenue near Villa Street.
http://www.hartnell.edu/about/hartnell_campus.html

Agenda

Morning session:

Introduction to social network analysis, examples and use of social network maps, intro to NodeXL.

Introduction to the history of social network analysis – how to “think link“.

Core vocabulary: node/vertex, link/tie/relationship, degree, centrality, core/periphery, bridge, hole, density.

Thinking by seeing.- Visualizing networks: pictures of collections of connections.

Networks are everywhere: biological, commercial, social, technical. How to extract the networks around you: how to build your own “edge list”.

Living in a sea of tweets, links, likes, views, reads, ratings, reviews, comments, connections, tags, ties, edits, plays, check-ins, contacts, friends, follows, favorites, Networks are newly self-documenting: machine readable connections now comprise the majority of our connections with one another, making our social worlds more available to analysis than ever before.

Introduction to NodeXL: mechanics of getting a graph open, analyzed and visualized.

Hands-on: how to analyze a social graph. Using examples from Twitter, YouTube, Email, flickr, and participant submissions, we take a graph from collection through analysis and visualization. Telling stories about key people and groups with network visualizations.

Afternoon session:

Extracting networks that matter to your organization: defining the nature of the nodes and edges in a graph is the fundamental question in network analysis. Who are the people, organizations, processes, entities that matter to you and how are they tied, connected, or linked? How to query your existing logs and data sets to extract useful network graphs.

Decorating network graphs: using size, color, transparency, visibility, images, and location to better tell a story with a network graph.

Filtering a network: revealing key structures and nodes. Use dynamic filters to remove edges and nodes from the graph to reveal only those who meet specific criteria. Use a range of attributes to limit the graph to remove clutter and occlusion.

Scheduling regular data collection with NodeXL. A guide to using the free and open data collector to schedule the creation of network data sets on a regular automatic basis.

Future directions for NodeXL: time series and graph comparison, additional data sources, web interfaces.

Here are some NodeXL generated maps of recent  discussions around Wikileaks, pdfleaks, and cablegate in Twitter:

These are the connections among the people who tweeted the term “wikileaks” on 11 December 2010. The “wikileaks” account is at the center of the inner circle.  It is surrounded by a collection of very lightly interconnected people (there is a low clustering coefficient) who retweet messages from the wikileaks account.  This ring is surrounded by a thinner ring of 2nd order retweets.  This is a very common pattern for a successful “brand” or broadcast account, getting lots of retweets and, even more impressive, retweets of retweets.

The most between people who tweeted the term “wikileaks” on 11 December 2010.  The top ten: @wikileaks, @melhoresfrases, @ukelectionnews, @nonradical, @nelsonbocaranda, @linuxmall, @dominiofeminino, @resermarca, @crazy_dymnd, @rodolfomoros

Here is the data file: 20101209-NodeXL-Twitter-wikileaks

These are the connections among people who recently tweeted “pdfleaks” in Twitter on 11 December 2010.  It shares the brand/broadcast structure of the wikileaks account shown above.  After the wikileaks account itself, the second most between participant is @jeffjarvis who uniquely bridged to many people who would otherwise not be connected in this graph.

The most between people who tweeted the term pdfleaks“ on 11 December 2010.

Here is the data set: 20101211-NodeXL-Twitter-pdfleaks

The most between people who tweeted the term “cablegate” on 11 December 2010.  The cablegate discussion is more multipolar, with several high betweenness hubs connecting to otherwise separate communities.  El Pais, for example, is reaching a mostly Spanish language community.  The top ten: @anonops, @el_pais, @mparent77772, @wllawyer, @wikileaks_pp, @gdncables, @milenio, @evgenymorozov, @muschelschloss, @saladeprensa.

Here is the data set:

Here is a recent collection of NodeXL related activity and commentary:

Here is a great review of Analyzing social media networks with NodeXL: Insights from a connected world by Gerd Waloszek, SAP User Experience book reviewer:

http://www.sapdesignguild.org/community/
book_people/review_ana_sm_nw.asp

Several  reviews of the book Analyzing Social Media Networks with NodeXL: Insights from a connected world have appeared on the Amazon page:

http://www.amazon.com/Analyzing-Social-Media-Networks-NodeXL/dp/0123822297

Here is the blog review of Analyzing social media networks with NodeXL: Insights from a connected world that is the source of the second review:

http://www.durantlaw.info/analyzing-social-media-networks-with-nodexl

The book has now entered the used market: you can find it on eBay, oddly at the same price as Amazon sells it new!

http://cgi.ebay.com/Analyzing-Social-Media-
Networks-with-NodeXL-Insights-f_
W0QQitemZ280582030204QQcmdZ
ViewItemQQssPageNameZRSS:B:SRCH:US:102

Great video demo of Cytoscape Venn and Euler diagrams of network graphs:

http://www.youtube.com/watch?v=UtoW0nVwOV4

Even better, a video Demo of MSR work on Euler diagrams:

http://research.microsoft.com/en-us/um/people/nath/EulerDiagrams/

Review of recent NodeXL demo at the Social Tech 2010 conference.

http://www.b2bvoices.com/2010/10/
how-well-do-you-know-your-social-network-probably-poorly/

NodeXL mentioned in a blog:

http://theinsideoutblog.com/2010/10/26/days-6-7-the-pressures-illing-me/

AT&T Research blog post on the value of network visualizations:

http://www.research.att.com/articles/featured_stories/2009/
200910_more_than_just_a_picture.html

You should really watch this video: it is the future! If you watch it, you will get +10 points!

http://g4tv.com/videos/44277/dice-2010-design-outside-the-box-presentation/

Translated from Czech: Identification of communities around the Twitter account

http://ttgoogle.blogspot.com/2010/10/identifikace-komunity-kolem-twitteru.html

Animators of Life – Why information visualization matters! Network visualization is even harder! > 3D Worth a look.

http://nyti.ms/buob7w

NodeXL used to map Conan O’Brien (US TV Talk Show Host)

http://verkostoanatomia.wordpress.com/2010/11/09/conan-obrien-communities-visualized-teamcocos-everywhere/

“Using NodeXL to collect the data and Gephi to visualize the networks of the Youtube videos mentioning “teamcoco” and collecting the tweets containing hashtag #conanreturns.”

Have a look at LateralData’s Relationship analyzer:

http://www.lateraldata.com/technology/relationship-analyzer/

]]> http://www.connectedaction.net/2010/12/01/recent-links-to-nodexl-related-commentary-and-reviews/feed/ 1 http://www.connectedaction.net/2010/11/06/november-8-2010-seoul-korea-3rd-international-conference-on-digital-culture/?utm_source=rss&utm_medium=rss&utm_campaign=november-8-2010-seoul-korea-3rd-international-conference-on-digital-culture http://www.connectedaction.net/2010/11/06/november-8-2010-seoul-korea-3rd-international-conference-on-digital-culture/#comments Sat, 06 Nov 2010 23:56:12 +0000 Marc Smith http://www.connectedaction.net/?p=3726

On November 8th, 2010 I spoke in Seoul, Korea at the 3rd International Conference on Digital Culture on the topic of “Smart Society and Civic Culture“.

Several of my colleagues also spoke at the event, including Leslie Tkach-Kawasaki from the University of Tsukuba, Japan, Han Woo Park from YeoungNam University, Korea, George Barnett from the University of California, Davis and Robert Ackland from The Australian National University, AU.

Robert Ackland from The Australian National University, AU

George Barnett from the University of California, Davis

Han Woo Park from YeoungNam University, Korea

Leslie Tkach-Kawasaki from the University of Tsukuba, Japan

Marc Smith, Connected Action Consulting Group

Han Woo Park‘s research team from YeoungNam University, Korea