• No results found

Exploratory Facebook Social Network Analysis

N/A
N/A
Protected

Academic year: 2021

Share "Exploratory Facebook Social Network Analysis"

Copied!
18
0
0

Loading.... (view fulltext now)

Full text

(1)

Exploratory Facebook Social

Network Analysis

with Gephi

Thomas Plotkowiak

(2)

Process

1. Import Data with Netviz 2. Gephi 1. Open 2. Layout 3. Ranking (Degree) 4. Statistics 5. Ranking (Betweenness) 6. Layout (Size Adjust)

7. Labels 8. Community detection 9. Filter 10. Label Adjust 11. Preview 12. Export

(3)

Netvizz

1. Sign in to your Facebook account 2. Search for netvizz application

3. Choose parameters you would like to include in the data (e.g. gender, wall posts count, interface language)

4. Analyze either

– Your personal friend network  today

– [OR] one of your groups listed at the bottom

5. Wait for the application to create the .gdf file and download it (right click, save as)

(4)

Gephi

• Gephi is an open-source network analysis and visualization

software package.

• Envisioned as providing "easy and broad access to network

data", it's advertised as being "Like Photoshop for graphs."

• Gephi has been used in a number of research projects in the

university, journalism and elsewhere.

• The Gephi Team: Mathieu Bastian, Sebastien Heymann, Julian

(5)

Gephi: 1. Open

• From File menu select

Open and then select the .gdf file you saved from Netvizz

• At first it looks like a big

hairball, so we'll change the layout to make some sense of the connections

(6)

Gephi: 2. Layout

• From the Layout module on

the left side chose Force Atlas* from the Dropdown Menu, then click run

– Force atlas makes connected

nodes attract each other, while unconnected nodes are

pushed towards the periphery

• Click stop when it seems

that the layout has

converged towards a stable state

(7)

Gephi: 3. Ranking (Degree)

1. Chose the Ranking-Nodes Tab in the top left module and chose Degree from the dropdown menu

– Degree = number of

connections

2. Hover your mouse over the gradient bar, then double click on each triangle to choose a color for each side of the range

– Try to use bright colors for the

highest degree and dark for lowest

(8)

Gephi: 4. Statistics

• Click the Statistics tab in the

top right module

• Click Run next to Average

path length

– Chose directed from Popup

Menu

• Click close when the graph

(9)

Gephi: 5. Rank (Betweeness)

• Return to Ranking in the

top left module and click Chose a rank parameter from the dropdown

– Chose Betweeness Centrality

from the dropdown menu

• Click on the icon for size,

instead of color

– Set min size to 10 and max

size to 50 (experiment a little)

(10)

Gephi: 6. Layout

• To keep the larger nodes

from overlapping smaller ones, go to the Layout tab and check the Adjust by sizes box

(11)

Gephi: 7. Labels

• Click the bold black T in

the toolabar at the bottom of the window to turn

labels on

• Click the black letter A in

the same toolbar to select the Size Mode for the

labels, and choose the node size option

• Use the slider on the right

to adjust the size

• You can also change the

font style by clicking next to the slider

(12)

Gephi: 8. Community Detection

• Go back to the statistics tab

on the right and click Run next to Modularity

– Check randomize and click OK

• Go to the partition tab in the

top left module and click the refresh arrow

• Choose modularity class

from the dropdown menu

– Right click to randomize colors

(13)

Gephi: 9. Filter

• Go to Filters in the top right

module and open the Topology Folder

– Drag the degree range to the

box below ("Drag filter here")

• Click on Degree Range to

open the Parameters

– Click on the "0" and change it to

a slightly higher value

– This removes the nodes that are

not connected to many other nodes

(14)

Gephi: 10. Label Adjust

1. Go to the Layout module on the left

2. Chose label Adjust layout to make the labels not overlapping

(15)

Gephi: 11. Preview

1. At the very top click on the Preview tab

2. Under Node, check the box "Show Labels"

3. Click Refresh at the bottom, and choose your label font 4. Play around with the

options until you like your graph (Don't forget to click refresh every time)

(16)

Gephi: 12. Export

• To Export your graph for publication in SVG or PDF

click the Export button

(17)

Gephi: 13. Make sense out of it

Friends from studies at the University of Waterloo Friends from studies at the University of Mannheim Friends from swimming club

Friends from staying in Japan

Friends from school

Roommate & swimming club

Joined me on the exchange to Canada

(18)

Hungry? Need More Data?

• Use NodeXL

• Write own crawlers

(ask me)

• Use existing archives

– http://snap.stanford.edu/ – http://vlado.fmf.uni-lj.si/pub/networks/pajek – http://vlado.fmf.uni-lj.si/pub/networks/data/ ucinet/ucidata.htm • Collect by Surveys

References

Related documents

Representing new series to declare in dataframe constructor from python list of operations over requested axis for the row or duplicate values other object columns with more of

but an be presented as either the union of losed sets or interse tion of

Obtaining Knowledge about HIV and Prevention To understand where counselors obtained their knowl- edge about HIV transmission and prevention, a survey item adapted from the

The purpose of this study is to offer some insight into the life circumstances and experiences of a large group of children affected by maternal addiction, children whose

-Set the Main index for main website (Click Main website on the left side bar, then select Main index from the dropdown list, and Save configuration).. Run data indexing and enjoy

11 See, for example, Jonathan Gruber, “The Cost and Coverage Impact of the President’s Health Insurance Budget Proposals,” Center on Budget and Policy Priorities, February 15,

 Determination Date – the date the student notified the school administration of their intent to terminate enrollment OR the date of the student’s 10 th consecutive absence OR

Firstly, the depth range of the displacement field is limited only by the coherence length of the laser, rather than by the mechanical scan range of the reference arm of