October 18, 2013 Kredible.Net NSF workshop at Stanford University – Study of reputation and social roles on social media

06AugMay 7, 2015 By Marc Smith

This October 18, 2013 an NSF funded workshop called Kredible.Net to be held at Stanford University will bring together researchers studying reputation and social roles in social media.

The workshop will help researchers investigate how social media, especially Wikipedia articles and editors, shape public knowledge. The project aims to build a research community and to propose a research agenda for the study of reputation and authority in informal knowledge markets, such as Wikipedia.

The team is lead by Sorin Adam Matei (PI) of Brian Lamb School of Communication, Elisa Bertino (Cyber Center), Michael Zhu and Chuanhai Liu (Department of Statistics) , and Luo Si (Department of Computer Science).

The KredibleNet project is supported by an international team of researchers including Marc Smith, director of the Social Media Research Foundation and the NodeXL project and by Dr. Luca De Alfaro, from University of California, Santa Cruz, the head of the WikiTrust project. The team also includes researchers Jure Leskovec (Stanford), Bernie Hogan (Oxford Internet Institute), and Ben Shneiderman (University of Maryland).

The KredibleNet grant will fund research and workshops that will reveal how social media leaders gain authority to shape public knowledge.

See: http://kredible.net/in/kredible-net-awarded-nsf-grant-to-study-reputation-and-social-roles-on-social-media/

April 8 and 9, 2013 – NSF workshop: Kredible.Net at Purdue University – Study reputation and social roles on social media

06MarMay 7, 2015 By Marc Smith

This April 8 and 9, 2013 an NSF funded workshop called Kredible.Net to be held at Purdue University will bring together researchers studying reputation and social roles in social media.

The grant will help researchers investigate how social media, especially Wikipedia articles and editors, shape public knowledge. The project aims to build a research community and to propose a research agenda for the study of reputation and authority in informal knowledge markets, such as Wikipedia.

The KredibleNet grant will fund research and workshops that will reveal how social media leaders gain authority to shape public knowledge.

See: http://kredible.net/in/kredible-net-awarded-nsf-grant-to-study-reputation-and-social-roles-on-social-media/
The video from my talk is on YouTube:

September 22-23, 2011: Purdue University – Lecture on Social Media Networks

16SepMay 7, 2015 By Marc Smith

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.

Your Cart