-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathworkshop2010.html
More file actions
152 lines (142 loc) · 8.79 KB
/
workshop2010.html
File metadata and controls
152 lines (142 loc) · 8.79 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1//EN" "http://www.w3.org/TR/xhtml11/DTD/xhtml11.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en"><!-- InstanceBegin template="/Templates/base.dwt" codeOutsideHTMLIsLocked="false" -->
<head>
<meta name="author" content="David A. Bader" />
<meta http-equiv="content-type" content="text/html; charset=utf-8" />
<meta name="description" content="GraphAnalysis.org: High performance computing for solving large-scale graph problems" />
<meta name="keywords" content="Graph Analysis, GraphAnalysis, HPC Graphs, parallel graph problems" />
<link rel="stylesheet" type="text/css" href="style.css" />
<!-- InstanceBeginEditable name="doctitle" -->
<title>GraphAnalysis.org: SIAM AN10 Minisymposium on Analyzing Massive Real-World Graphs</title>
<!-- InstanceEndEditable -->
<!-- InstanceBeginEditable name="head" -->
<style type="text/css">
<!--
.style3 {color: #0000FF}
.style5 {color: #FF0000; font-family: Verdana, Arial, Helvetica, sans-serif; font-weight: bold; font-size: large; }
.style6 {font-size: medium}
.style7 {color: #FF0000; font-family: Verdana, Arial, Helvetica, sans-serif; font-weight: bold; font-size: medium; }
#container #content dl dd em {
color: #00F;
}
-->
</style>
<!-- InstanceEndEditable -->
</head>
<body>
<div id="container">
<div id="top">
<h1><center>HPC Graph Analysis</center></h1>
</div>
<div id="leftnav">
<ul>
<li><a href="index.html">Home</a></li>
<li><a href="news.html">News</a></li>
<li><a href="benchmark/index.html">Benchmark</a></li>
<li><a href="benchmark/results.html">Results</a></li>
<li><a href="workshop2022.html">Workshop 2022</a></li>
<li><a href="workshop2021.html">Workshop 2021</a></li>
<li><a href="workshop2020.html">Workshop 2020</a></li>
<li><a href="workshop2019.html">Workshop 2019</a></li>
<li><a href="workshop2018.html">Workshop 2018</a></li>
<li><a href="workshop-CSE17.html">Workshop @CSE17</a></li>
<li><a href="workshop2017.html">Workshop 2017</a></li>
<li><a href="workshop2016.html">Workshop 2016</a></li>
<li><a href="workshop2015.html">Workshop 2015</a></li>
<li><a href="workshop2014.html">Workshop 2014</a></li>
<li><a href="workshop2013.html">Workshop 2013</a></li>
<li><a href="workshop2012-SC12.html">Workshop @SC12</a></li>
<li><a href="workshop2012.html">Workshop 2012</a></li>
<li><a href="workshop2010.html">Workshop 2010</a></li>
<li><a href="workshop2009.html">Workshop 2009</a></li>
<li><a href="workshop2008.html">Workshop 2008</a></li>
<li><a href="publications.html">Publications</a></li>
<li><a href="people.html">People</a></li>
<li><a href="links.html">Links</a></li>
<li><a href="contact.html">Contact</a></li>
</ul>
</div>
<!-- InstanceBeginEditable name="EditRegion3" -->
<div id="content">
<h3>SIAM AN10 Minisymposium on Analyzing Massive Real-World Graphs <br />
</h3>
<h4 align="center"><strong>David L. Lawrence Convention Center</strong><br />
Pittsburgh, PA<br />
<br />
12-16 July 2010<br />
</h4>
<h3>Scope and Goals:</h3>
<p>Emerging real-world graph problems include detecting community structure in large social networks, improving the resilience of the electric power grid, and detecting and preventing disease in human populations. Unlike traditional applications in computational science and engineering, solving these problems at scale often raises new challenges because of sparsity and the lack of locality in the data, the need for additional research on scalable algorithms and development of frameworks for solving these problems on high performance computers, and the need for improved models that also capture the noise and bias inherent in the torrential data streams. </p>
<h3>Location:</h3>
<p><a href="http://www.siam.org/meetings/an10/"><img src="AN10.gif" alt="AN10 logo" width="186" height="90" hspace="10" vspace="0" border="0" align="left" longdesc="http://www.siam.org/meetings/an10/" /></a>This workshop is co-located with <a href="http://www.siam.org/meetings/an10/">SIAM AN10</a>, held 12-16 July 2010, at the David L. Lawrence Convention Center<br />
in Pittsburgh, PA. Registration information for AN10 can be found at <a href="http://www.siam.org/meetings/an10/reginfo.php">here</a>.</p>
<br />
<h3 align="left"><br />
Program: </h3>
<span class="style7">Monday, July 12</span>
<h4>10:30 AM - 12:30 PM<br />
<em>Room: Spirit of Pittsburgh B - Level 3</em> </h4>
<dl>
<dt><strong>10:30-10:55 <a href="SIAM-AN10/01_Backstrom.pdf">People You May Know</a></strong></dt>
<dd><em>Lars Backstrom</em>, Facebook </dd>
<dd>Facebook's friend recommendation system helps people connect with their friends. Our system, called People You May Know, uses a combination of results from sociology and machine learning to make the best suggestions possible. We will look at some of the challenges involved in building a system that can handle the scale of Facebook and provide high quality recommendations. In this talk I will discuss both the algorithmic and machine learning challenges that we have faced and overcome in building this system. <br />
</dd>
<dt> </dt>
<dt> </dt>
<dt><strong>11:00-11:25 <a href="SIAM-AN10/02_McCloskey.pdf">Modularity and Graph Algorithms</a></strong></dt>
<dd><em> Joe McCloskey</em>, National Security Agency; David A. Bader, Georgia Institute of Technology </dd>
<dd>A number of graph partitioning algorithms are based on the concept of modularity. In particular Clauset, Newman and Moore (CNM) have developed a greedy agglomerative graph partitioning algorithm that scales well but is known to have several flaws. Fortunato and Barthelemy have performed a rigorous analysis of the CNM algorithm that elucidates it problems. More recently Berry, Hendrickson, Laviolette, and Phillips have derived a weighted variant of CNM that performs much better in practice. This talk will focus on a different version of the parent CNM algorithm based on a statistical re-interpretation of CNM that also addresses some of the issues with the original algorithm. <br />
</dd>
<dt><strong>11:30-11:55 <a href="SIAM-AN10/03_Raghavan.pdf">Exploiting Sparsity in the Statistical Analysis of Gene Expression Data</a></strong></dt>
<dd><em> Padma Raghavan</em>, <em>Anirban Chatterjee</em>, and Francesca Chiaromonte, Pennsylvania State University </dd>
<dd> </dd>
<dt><strong> 12:00-12:25 <a href="SIAM-AN10/04_Pinar.pdf">Scalable Methods for Representing, Characterizing, and Generating Large Graphs</a></strong></dt>
<dd><em>Ali Pinar</em>, Sandia National Laboratories </dd>
<dd> </dd>
</dl>
<span class="style7">Monday, July 12</span><br />
<h4>4:00 PM - 6:00 PM<br />
<em>Room: Spirit of Pittsburgh B - Level 3</em> </h4>
<dl>
<dt><strong>4:00-4:25 <a href="SIAM-AN10/05_Madduri.pdf">Hybrid Parallel Programming for Massive Graph Analysis</a></strong></dt>
<dd><em>Kamesh Madduri</em>, Lawrence Berkeley National Laboratory </dd>
<dd> </dd>
<dt><strong> 4:30-4:55 <a href="SIAM-AN10/06_Gilbert.pdf">Tools and Primitives for High-performance Graph Computation </a></strong></dt>
<dd><em>John Gilbert</em>, University of California, Santa Barbara </dd>
<dd> </dd>
<dt><strong> 5:00-5:25 <a href="SIAM-AN10/07_Berry.pdf">Practical Heuristics for Inexact Subgraph Isomorphism </a></strong></dt>
<dd><em>Jon Berry</em>, Sandia National Laboratories </dd>
<dd> </dd>
<dt><strong> 5:30-5:55 <a href="SIAM-AN10/08_Bliss.pdf">Spectral Methods for Subgraph Detection </a></strong></dt>
<dd><em>Nadya Bliss</em> and Benjamin A. Miller, Massachusetts Institute of Technology; Patrick J. Wolfe, Harvard University
</dd>
<dd>We describe a statistical test for subgraph detection and localization using spectral properties of the so-called modularity matrix, a type of residual under the Chung-Lu random graph model. We show that the resultant algorithmic procedure can be applied to very large graphs ($< 10^6$ vertices), with complexity dominated by that of standard sparse eigensolver methods, and can successfully isolate anomalous vertices in real data examples.<br />
</dd>
</dl>
<h3>Workshop Organizer:</h3>
<ul>
<li><strong><a href="http://www.cc.gatech.edu/~bader">David A. Bader</a></strong>, <em>Georgia Institute of Technology</em></li>
<br />
<br />
</li>
</ul>
</div>
<!-- InstanceEndEditable -->
<div id="footer">
<i>
<script language="JavaScript">
<!---//hide script from old browsers
document.write( "Last updated: "+ document.lastModified );
//end hiding contents --->
</script>
</i>
</div>
</div>
<script src="http://www.google-analytics.com/urchin.js" type="text/javascript">
</script>
<script type="text/javascript">
_uacct = "UA-1564202-1";
urchinTracker();
</script>
</body>
<!-- InstanceEnd -->