slides - SNAP - Stanford University
slides - SNAP - Stanford University
slides - SNAP - Stanford University
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Assume we solved the correspondence problem<br />
Calculating<br />
[ICML ’07]<br />
P( G | ) [ , ] ( 1<br />
[ , ])<br />
(<br />
( u, v)<br />
G<br />
k u v<br />
( u,<br />
v)<br />
G<br />
k u v<br />
σ… node labeling<br />
Takes O(N2 ) time<br />
Infeasible for large graphs (N ~ 105 Infeasible for large graphs (N 10 )<br />
0.25 0.10 0.10 0.04<br />
005 0.05 015 0.15 002 0.02 006 0.06<br />
0.05 0.02 0.15 0.06<br />
0.01 0.03 0.03 0.09<br />
Θ kc<br />
σ<br />
P(G|Θ, σ)<br />
11/12/2009 Jure Leskovec, <strong>Stanford</strong> CS322: Network Analysis<br />
1 0 1 1<br />
0 1 0 1<br />
1 0 1 1<br />
0 0 1 1<br />
G<br />
Part 1‐18
Change language