Ninth Workshop on Mining and Learning with Graphs (MLG 2011)

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:00	Mining Structured Data on the Web Alon Halevy, Google Inc. Invited Talk

10:00	Coffee break

10:30	The Physicists' Contribution to Clustering: Modularity Maximization and Beyond Michelle Girvan, University of Maryland Invited Talk

11:25	Latent Factor Models for Networks and Relational Arrays Peter Hoff, Univeristy of Washington Invited Talk

12:20	Lunch

14:00	Generating Similar Graphs from Spherical Features Dalton Lunga and Sergey Kirshner Paper presentation

14:20	Integrating Logic Knowledge into Graph Regularization: an application to image tagging Claudio Sacca, Michelangelo Diligenti, Marco Gori and Marco Maggini Paper presentation

14:40	Bayesian Optimal Active Search on Graphs Roman Garnett, Yamuna Krishnamurthy, Donghan Wang, Jeff Schneider and Richard Mann Paper presentation

15:00	Coffee break

15:30	Beyond link prediction and collaborative filtering: Learning to predict affinity Charles Elkan, University of California, San Diego Invited Talk

16:30	Poster session

18:30	End of day 1

Sunday, August 21, 2011

8:45	Extracting insight from large networks: implications of small-scale and large-scale structure Michael Mahoney, Stanford University Invited Talk

9:40	All-at-once Optimization for Coupled Matrix and Tensor Factorizations Evrim Acar, Tamara Kolda and Daniel Dunlavy Paper presentation

10:00	Coffee break

10:30	Networks spill the beans Lada Adamic, University of Michigan Invited Talk

11:25	Adaptation of Graph-Based Semi-Supervised Methods to Large-Scale Text Data Frank Lin and William W. Cohen Paper presentation

11:45	Graph Classification via Topological and Label Attributes Geng Li, Murat Semerci, Bulent Yener and Mohammed Zaki

12:05	Lunch

13:45	Learning from Plane Graphs Thomas Fannes and Jan Ramon Paper presentation

14:05	Efficient graph mining Karsten Borgwardt, Max Planck Institute Invited Talk

15:00	Coffee break

15:30	Learning Relationships Defined by Linear Combinations of Constrained Random Walks William Cohen, Carnegie Melon University Invited Talk

16:30	Panel Discussion & Closing Remarks

17:30	End of workshop