Registration and Welcome: 8:30am-9:00am

Session 1: 9:00am-11:20am

• Masashi Sugiyama (Tokyo Institute of Technology)
  Recent Advances in Divergence Estimation: Theory, Algorithm, and Application
• Shanfeng Zhu (Fudan University)
  Efficient Semi-Supervised MEDLINE Document Clustering
• Masayuki Karasuyama (Kyoto University)
  Label Propagation through Graph-based Feature Reconstruction
• Timothy Hancock (Kyoto University)
  Imposing Network Structures on Feature Selection on Experimental Data

Lunch Break: 11:20am-2:00pm

Session 2: 2:00pm-3:45pm

• Hisashi Kashima (The University of Tokyo)
  Link Prediction Methods for Bioinformatics
• Canh Hao Nguyen (Kyoto University)
  Latent Feature Kernels for Link Prediction
• Motoki Shiga (Toyohashi University of Technology)
  Efficient Semi-Supervised Learning on Multiple Graphs

Break: 3:45pm-4:00pm

Session 3: 4:00pm-5:45pm

• Jean-Philippe Vert (Mines ParisTech)
  Structured Feature Selection for Genomic Data
• Ichigaku Takigawa (Hokkaido University)
  Learning Sparse Linear Models over Subgraph Indicators
• Yasuo Tabei (JST ERATO)
  Space-Efficient Multibit Tree for Large-Scale Chemical Fingerprint Searches

Group Photo: 5:45pm-

Banquet: 6:30pm- (Pre-registration REQUIRED)

Session 1: 9:00am-11:20am

• Jun Sese (Tokyo Institute of Technology)
  Gene Expression Analysis in Polyploid Species using Next-Generation Sequencer
• Yuichi Shiraishi (The University of Tokyo)
  An Empirical Bayesian Framework for Mutation Detection from Cancer Genome Sequencing Data
• Hiroto Saigo (Kyushu Institute of Technology)
  Learning from Treatment History to Predict Response to Anti-HIV therapy
• Yoshihiro Yamanishi (Kyushu University)
  Machine Learning Methods to Analyze and Infer Drug-Target Interaction Networks

Lunch Break: 11:20am-2:00pm

Session 2: 2:00pm-3:45pm

• Satoshi Morinaga (NEC)
  Factorized Asymptotic Bayesian Inference for Learning Latent Variable Models
• Marco Cuturi (Kyoto University)
  Distances and Kernels on Discrete Structures
• Hiroki Arimura (Hokkaido University)
  Efficient Enumeration of Bounded-Size Subtrees in a Tree and Its Application to Tree Mining with Proximity Constraint

Break: 3:45pm-4:00pm

Session 3: 4:00pm-5:45pm

• Koji Tsuda (AIST)
  Fast Similarity Search with Succinct Trees
• Kengo Sato (Keio University)
  Simultaneous Aligning and Folding of RNA Sequences via Dual Decomposition
• Atsuyoshi Nakamura (Hokkaido University)
  Frequent Pattern Mining for Families of Dispersed Repeats in DNA Sequences

Closing: 5:45pm-