Thu, May 31 AM
10:15 - 13:00 |
| |
10:15-10:20 |
Opening Address ( 5 min. ) |
| (1) |
10:20-10:45 |
Towards a Logical Reconstruction of CF-Induction |
Yoshitaka Yamamoto (Graduate Univ. for Advanced Studies), Oliver Ray (Univ. of Bristol), Katsumi Inoue (NII/Graduate Univ. for Advanced Studies) |
| (2) |
10:45-11:10 |
A Parallel SAT Solver for Multi-Core Processor Environment |
Akihide Takami, Koji Iwanuma, Hidetomo Nabeshima (Univ. of Yamanashi) |
| (3) |
11:10-11:35 |
Collaborative Filtering using Purchase Sequences |
Tomoharu Iwata, Takeshi Yamada, Naonori Ueda (NTT) |
| (4) |
11:35-12:00 |
Personalized Recommendation by Identifying Innovator |
Noriaki Kawamae, Takeshi Yamada, Naonori Ueda (NTT) |
| |
12:00-13:00 |
Lunch Break ( 60 min. ) |
Thu, May 31 PM
13:00 - 15:00 |
| (5) |
13:00-13:50 |
[Invited Talk]
String data compression, pattern matching, and pattern discovery |
Masayuki Takeda (Kyushu Univ.) |
| |
13:50-14:00 |
Break ( 10 min. ) |
| (6) |
14:00-14:50 |
[Invited Talk]
Recent Topics on Data Mining and Knoledge Discovery Using Binary Decision Diagrams |
Shin-ichi Minato (Hokkaido Univ.) |
| |
14:50-15:00 |
Break ( 10 min. ) |
Thu, May 31 PM
15:00 - 16:40 |
| (7) |
15:00-15:25 |
approximate partial string detection technique for multiple documents |
Takaharu Takeda (Sokendai), Atsuhiro Takasu (NII) |
| (8) |
15:25-15:50 |
Finding Common and Freqent Tree Pattern From Semi-Structured Texts Compressed by a Tree Grammar Compression Method |
Seiji Murakami, Koichiro Doi, Akihiro Yamamoto (Kyoto Univ.) |
| (9) |
15:50-16:15 |
An Analysis of Sequential Data with Hierarchical Structure of Time Frame Using Frequent Subtree Mining |
Ryohei Fukuda, Hiroyuki Oono, Hiroshige Inazumi (Aoyama Gakuin Univ.) |
| (10) |
16:15-16:40 |
New Structure Similarity and Graph Clustering in Matching Any Graph Characterized by Subgraph Distributions |
Takahisa Wada, Hiroyuki Oono, Hiroshige Inazumi (Aoyama Gakuin Univ.) |
:ai-
n
