danyel fisher and joshua o'madadhain -...
TRANSCRIPT
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
flexibleflexibleflexible
visualizationvisualizationvisualization
programmableprogrammable
librarylibrarylibrary
Okwms Zafryql
xuflallzBplxa Zaawa
Vnump Jpasdfrbhue
nukakal
tvhjatpm.bzqqsg
Eaymi Ymmwtxrg
Eayi Mvopsy
Naglz Ymmnj
Nauo Hlzpwaz
fmaxjxpx
Djavquabn Wqrajpai
Tvhzjt E. Egghautfe
jthrj.zqpsdybbsyKafo Sbzawaffi
nawxnaz.ncmvbfcijgg
Dnhmiyvv Bzzazs Sgmygdl Ce Uryea djumx.oqwnd
Tjuidaz Mydtv
tyw
ltlwHnrvna Uabv
uaoiw, rrvwXaqha Wzade
Sqeiwzv Bswha Uyczh
tmv eaymi.wqwowxr
Ftlr Hyamxpd
Xabrj Sccdpdf
adksw
kqqaynsu
atymsjr
JUNG: the Java Universal Networks/Graph APIDanyel Fisher and Joshua O'Madadhain
http://jung.sourceforge.net{danyelf, jmadden}@ics.uci.edu
open source, available under a BSD licensemake networks a component of any projectjoin an active user and developer community
run common network analyses write your own algorithms and toolsincorporate existing 3rd party libraries and codeautomate complex analyses
annotate vertices, edges, and graphs with arbitrary dataread and write common file formatsbuild graphs, trees, hypergraphs, k-partite graphs with directed and undirected, parallel, weighted edges
build interactive toolseasily configurable rendererlayouts: spring-embedder, Kamada-Kawaii, or roll your own
A visualization of the LiveJournal "friends" network. Pink sample nodes are sized by the ratio of in-degree to out-degree.(Courtesy S. Abrams)
Various shortest paths (in blue and red) on a randomly-generated unweighted, undirected graph (in gray).
Part of an email network from one user's perspective. Edges between names (gray rectangles) represent carbon-copied messages. Both nodes and edges are colored by the most recent contact; lighter is more recent.
Danyel Fisher is an Informatics PhD candidate with an interest in computer-supported collaborative work; Joshua O'Madadhain is a PhD student in Artificial Intelligence with an interest in machine learning.
Both use social network analysis in their research.
JUNG was co-created with Scott White and Yan-Biao Boey.
JUNG is supported in part by the National Science Foundation under Grant Nos. IIS-0083489 and IIS-0133749 and by the Knowledge Discovery and Dissemination (KD-D) Program.
structural equivalence n PageRank n betweenness clustering n shortest path n centrality measures n max flow n HITS n small world n power law n scale-free n graph folding
A screenshot from the KDD Netsight tool shows co-publication links around a central node (in blue). Larger nodes indicate greater PageRank.
HelpWindowAlgorithmsFiltersGraphFile
M Pazzani
M Fernandez
O Mangasarian
M Hearst
M Jordan
C Lai
T Richardson
C Meek
C Glymour
P Sabes
J Frank
P Cheeseman
J Stutz
M Wellman
D Cohn
A Smith
B Draper
J Erickson
C Brodley
P Smyth
J Weber
J Malik
D Heckerman
A Jones
E Knill
B BollobasG Das
D Gunopulos
H Mannila
S Teng
D Mitchell
R Khardon
D Roth
A Raftery
D MadiganJ Hoeting
M Kersten
O MiglinoK Nafasi
C Taylor
D Wolpert
W Macready
A Hill
T Cootes
Z Ghahramani
S Dumais
P Chan
S Soatto
P Perona
R FrezzaG Picci
M Mitchell
T Jaakkola
D Haussler
P Orponen
K Murphy
H GreenspanS Belongie
R Goodman
M Holsheimer
J Matousek
L Xu
M Paterson
M KlemettinenH Toivonen
A Weigend
S Jung
J Boulicaut
S CasadeiS Mitter
J Adam s
J Kosecka
R Paul
A Farquhar
R Kohavi
M Jaeger
J Ostrowski
K Bennett
A Ng
P Ronkainen
L Guibas
B Dom
M Saham i
J Bouguet
J Rice
D Dobkin
D Eppstein
T Hastie
P Agarwal
E Ukkonen
G Overton
J AaronsonJ Haas
Z Wang
D Hart
G Gottlob
P Stolorz
F Yao
A Robertson
E Horvitz
S Singh
B Fischer
T Leung
H AhonenO Heinonen
P Kilpelainen
M Atkinson
D Peel
G Miller
S Russell
W Buntine
J Fortes
L Saul
M Dillencourt
Y Weiss
C Volinsky
R Kronmal
A Gray
S Hanks
V TsaoussidisH Badr
D Kriegman
T Lane
J Gilbert
P Debevec
J Kivinen
J Crowcroft
R Beigel
A Mayer
B MacLennan
G Edwards
C Matheus
G Piatetsky-Sh
D McNeill
P Utgoff
R Fikes
R Jacobs
M Weber
J GavrinK Chang
D Hirschberg
E Hunt
S MacDonell
Z Galil
E Weydert
D Thomas
M Henzinger
M Burl
M Bern
P Sozou
J Graham
E Demaine
M Demaine
S Spence
D Geiger
M Friedl
T Eiter
E Alpaydin
S SollowayC HutchinsonJ Waterton
D Cooper
A Barto
E Nikunen
E Dimauro
G LindenA Verkam o
I Verkam o
L GoncalvesG Cooper
A Newton
R Kraft
J Breese
N Amenta
I Cadez
C McLaren
G McLachlan
G Barequet
M Meila
Q Morris
Y Song
S Andersson
M Perlman
P BradleyU Fayyad
D Wolf
G Italiano
K Tumer
E Keogh
E BernardoE Ursella
C Triggs
D Sornette
E Friedman
L Daynes
T Printezis
T Pressburger
B Tuttle
J HaslamG Page
C Jackson
C Bishop
D Pavlov
M Dickerson
N de Freitas
C Stauss
R Kilgour R Manduchi
G Graefe
R Shachter
K MosurskiR Almond
D Young
A Lapedes
R Blasi
D Chickering
R Giancarlo
K Wheeler
A Lanitis
P Prado
X Ge
S Payandeh
M Ghil
K Ide
H King
I Dryden
B Thiesson
D Pregibon
A KorholaH Olander
W Pratt
R Engelmore
A Brett
C Sayers
J Mao
M Salmenkivi
A Mamdani
J Iv
M Welling
B KanefskyW Taylor
C Strauss
K Walker
M Faghihi
E Di Bernardo
P Kube
K Rommelse
D Rumelhart
S Gaffney
C Reina
S Chaudhuiri
P Sallis
K Laakso
B LevidowD Donnell
M Tartagni
M VanterN Lawrence
C FowlkesJ Roden
G Ridgeway
E Kuo
L Su
M Munich
D GolinelliG Consonni
D Cunliffe
D PsaltisG Steckman
P Courtier
M Latif
I Sim
L CorderoL Ugarte
K Pentikousis
N Kapadia
J seck
F Lott
D Chudova
P Yiou
W Einhauser
P VetterS GoodbodyM Kawato
P Hrensen
M Levitz
Graph loaded: 286 vertices / 554 edges
The well-known "Southern Women" dataset shows a bipartite graph of (blue) parties and (red) women who attended them.
On the left is the bipartite graph. On the right is a graph that connects women who attended the same parties. Note that all women are connected to each other.
By interactively removing some parties (x), we see a very different connection graph: two tight clusters.
Myra_Liddell
Eleanor_Nye
27-Jun
Charlotte_McDowd
2-Mar
26-Sep
10-Jun
Flora_Price
12-Apr
3-Aug
16-Sep
Nora_Fayette
8-Apr
Theresa_AndersonOlivia_Carleton
Ruth_DeSand
7-Apr
Laura_Mandeville
Helen_Lloyd
Verne_Sanderson Brenda_Rogers
Frances_Anderson
21-Nov
Katherine_Rogers
19-May
23-Feb
Sylvia_Avondale
Dorothy_Murchison
15-Mar
Pearl_Oglethorpe
Evelyn_Jefferson
Myra_Liddell
Eleanor_Nye
27-Jun
Charlotte_McDowd
2-Mar
26-Sep
10-Jun
Flora_Price
12-Apr
3-Aug
16-Sep
Nora_Fayette
8-Apr
Theresa_AndersonOlivia_Carleton
Ruth_DeSand
7-Apr
Laura_Mandeville
Helen_Lloyd
Verne_Sanderson Brenda_Rogers
Frances_Anderson
21-Nov
Katherine_Rogers
19-May
23-Feb
Sylvia_Avondale
Dorothy_Murchison
15-Mar
Pearl_Oglethorpe
Evelyn_Jefferson
Myra_Liddell
Eleano
Laura_Mandeville
Helen_Lloyd
Verne_Sanderson
Brenda_RogersCharlotte_McDowd
Frances_Anderson
Katherine_Rogers
Flora_Price
Sylvia_AvondaleNora_Fayette
Dorothy_Murchison
Theresa_Anderson
Olivia_Carleton
Evelyn_Jefferson
Pearl_Ogleth
Ruth_DeSand