Schedule

Wednesday Aug. 1st
8:00 - 8:45     Registration
Session 1. Chair: Paolo Frasconi
8:45 - 9:00     Welcome
9:00 - 10:00Invited talk: Pierre Baldi. Learning and Charting Chemical Space with Strings and Graphs: Challenges and Opportunities for AI and Machine Learning
10:00 - 10:30Efficient Closed Pattern Mining in Strongly Accessible Set Systems
M. Boley, T. Horvath, A. Poigne, S. Wrobel
10:30 - 11:00Coffee Break
11:00 - 11:30Support Vector Machines for Collective Inference
U. Brefeld, T. Klein, T. Scheffer
11:30 - 12:00The Cost of Learning Directed Cuts
T. Gaertner, G. C. Garriga
12:00 - 12:30Speeding Up Graph Edit Distance Computation with a Bipartite Heuristic
K. Riesen, S. Fankhauser, H. Bunke
12:30 - 14:30Lunch
  
Session 2. Chair: Koji Tsuda
14:30 - 15:30Invited talk: Luc De Raedt ProbLog and its Application to Link Mining in Biological Networks
15:30 - 16:00Poster spotlights
Comparative Evaluation of PL languages
M. Jaeger, P. Lidman, J. L. Mateo
Transductive Rademacher Complexities for Learning Over a Graph
K. Pelckmans, J.A.K. Suykens
Graphs, Hypergraphs, and Inductive Logic Programming
H. Blockeel, T. Witsenburg, J. Kok
Web Graph Parameters and the Pagerank Distribution
Y. Volkovich, N. Litvak, D. Donato
Semidefinite Ranking on Graphs
S. Vembu, T. Gaertner, S. Wrobel
Augmenting the Distributed Evaluation of Path Queries on Data-Graphs with Information Granules
D. Bacciu, A. Botta, D. Stefanescu
16:00 - 16:30Coffee Break
16:30 - 18:00Poster session
18:00 - 18:30Business Meeting
Thursday Aug. 2nd
Session 3. Chair: Thomas Gaertner
9:00 - 10:00     Invited talk: Jiawei Han Mining, Indexing, and Searching Graphs in Large Data Sets
10:00 - 10:30Support Computation for Mining Frequent Subgraphs in a Single Graph
M. Fiedler, C. Borgelt
10:30 - 11:00Coffee Break
11:00 - 11:30General Graph Refinement with Polynomial Delay
J. Ramon, S. Nijssen
11:30 - 12:00Improving Frequent Subgraph Mining in the Presence of Symmetry
C. Desrosiers, P. Galinier, P. Hansen, A. Hertz
12:00 - 12:30DIGDAG, a First Algorithm to Mine Closed Frequent Embedded Sub-DAGs
A. Termier, Y. Tamada, K. Numata, S. Imoto, T. Washio, T. Higuchi
12:30 - 14:30Lunch
  
Session 4. Chair: Kristian Kersting
14:30 - 15:30Invited talk: Lise Getoor Graph Identification
15:30 - 16:00Learning and Inference in Massive Social Networks
S. Hill, F. Provost, C. Volinsky
16:00 - 16:30Coffee Break
16:30 - 17:00Abductive Stochastic Logic Programs for Metabolic Network Inhibition Learning
J. Chen, S. Muggleton, J. Santos
17:00 - 17:30 An Efficient Sampling Scheme For Comparison of Large Graphs
K. M. Borgwardt, T. Petri, S.V.N Vishwanathan, H.P. Kriegel
17:30 - 18:00Fast Inference in Infinite Hidden Relational Models
Z. Xu, V.Tresp, S. Yu, K. Yu, H.-P. Kriegel
20:00Banquet
Friday Aug. 3rd
Session 5. Chair: Volker Tresp
9:00 - 10:00     Invited talk: Alex Smola. Learning Graph Matching
10:00 - 10:30Inferring Vertex Properties from Topology in Large Networks
J. Sinkkonen, J. Aukia, S. Kaski
10:30 - 11:00Coffee Break
11:00 - 11:30 A Polynomial-time Metric for Outerplanar Graphs
L. Schietgat, J. Ramon, M. Bruynooghe
11:30 - 12:00Weighted Substructure Mining for Image Analysis
S. Nowozin, K. Tsuda, T. Uno, T. Kudo, G. BakIr
12:00 - 12:30Efficient Kernel Methods fof Graphs
T. Gaertner
12:30 - 13:00A Universal Kernel for Learning Regular Languages
L.Kontorovich
13:00Closing