Home
Call for Papers
Invited Speakers
Submission
Registration
Accepted Papers
Dates
Schedule
Organization
Sponsors
Past Workshops
Contact
Workshop Schedule

The workshop will take place over two days, including keynote speakers, short presentations showcasing accepted papers, a poster session, and a panel discussion.


Saturday, August 20, 2011
8:45 Opening remarks
9:00Mining Structured Data on the Web
Alon Halevy, Google Inc.
Invited Talk
10:00Coffee break
10:30The Physicists' Contribution to Clustering:  Modularity Maximization and Beyond
Michelle Girvan, University of Maryland
Invited Talk
11:25Latent Factor Models for Networks and Relational Arrays
Peter Hoff, Univeristy of Washington
Invited Talk
12:20Lunch
14:00Generating Similar Graphs from Spherical Features
Dalton Lunga and Sergey Kirshner
Paper presentation
14:20Integrating Logic Knowledge into Graph Regularization: an application to image tagging
Claudio Sacca, Michelangelo Diligenti, Marco Gori and Marco Maggini
Paper presentation
14:40Bayesian Optimal Active Search on Graphs
Roman Garnett, Yamuna Krishnamurthy, Donghan Wang, Jeff Schneider and Richard Mann
Paper presentation
15:00Coffee break
15:30Beyond link prediction and collaborative filtering: Learning to predict affinity
Charles Elkan, University of California, San Diego
Invited Talk
16:30Poster session
18:30End of day 1

Sunday, August 21, 2011
8:45Extracting insight from large networks: implications of small-scale and large-scale structure
Michael Mahoney, Stanford University
Invited Talk
9:40All-at-once Optimization for Coupled Matrix and Tensor Factorizations
Evrim Acar, Tamara Kolda and Daniel Dunlavy
Paper presentation
10:00Coffee break
10:30Networks spill the beans
Lada Adamic, University of Michigan
Invited Talk
11:25Adaptation of Graph-Based Semi-Supervised Methods to Large-Scale Text Data
Frank Lin and William W. Cohen
Paper presentation
11:45Graph Classification via Topological and Label Attributes
Geng Li, Murat Semerci, Bulent Yener and Mohammed Zaki
12:05Lunch
13:45Learning from Plane Graphs
Thomas Fannes and Jan Ramon
Paper presentation
14:05Efficient graph mining
Karsten Borgwardt, Max Planck Institute
Invited Talk
15:00Coffee break
15:30Learning Relationships Defined by Linear Combinations of Constrained Random Walks
William Cohen, Carnegie Melon University
Invited Talk
16:30Panel Discussion & Closing Remarks
17:30End of workshop