| 2009 |
|---|
| 13 | EE | Taku Aratsu,
Kouichi Hirata,
Tetsuji Kuboyama:
Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes.
SOFSEM 2009: 93-104 |
| 12 | EE | Kilho Shin,
Tetsuji Kuboyama:
Polynomial summaries of positive semidefinite kernels.
Theor. Comput. Sci. 410(19): 1847-1862 (2009) |
| 2008 |
|---|
| 11 | EE | Kilho Shin,
Tetsuji Kuboyama:
Kernels Based on Distributions of Agreement Subtrees.
Australasian Conference on Artificial Intelligence 2008: 236-246 |
| 10 | EE | Masatoshi Nagamine,
Tetsuhiro Miyahara,
Tetsuji Kuboyama,
Hiroaki Ueda,
Kenichi Takahashi:
Evolution of Multiple Tree Structured Patterns from Tree-Structured Data Using Clustering.
Australasian Conference on Artificial Intelligence 2008: 500-511 |
| 9 | EE | Kilho Shin,
Tetsuji Kuboyama:
A generalization of Haussler's convolution kernel: mapping kernel.
ICML 2008: 944-951 |
| 8 | EE | Tetsuji Kuboyama,
Kouichi Hirata,
Kiyoko F. Aoki-Kinoshita:
An Efficient Unordered Tree Kernel and Its Application to Glycan Classification.
PAKDD 2008: 184-195 |
| 7 | EE | Taku Aratsu,
Kouichi Hirata,
Tetsuji Kuboyama:
Sibling Distance for Rooted Labeled Trees.
PAKDD Workshops 2008: 99-110 |
| 2007 |
|---|
| 6 | EE | Kilho Shin,
Tetsuji Kuboyama:
Polynomial Summaries of Positive Semidefinite Kernels.
ALT 2007: 313-327 |
| 5 | EE | Masatoshi Nagamine,
Tetsuhiro Miyahara,
Tetsuji Kuboyama,
Hiroaki Ueda,
Kenichi Takahashi:
A Genetic Programming Approach to Extraction of Glycan Motifs Using Tree Structured Patterns.
Australian Conference on Artificial Intelligence 2007: 150-159 |
| 2005 |
|---|
| 4 | EE | Nobuhito Ohkura,
Kouichi Hirata,
Tetsuji Kuboyama,
Masateru Harao:
The q-Gram Distance for Ordered Unlabeled Trees.
Discovery Science 2005: 189-202 |
| 3 | EE | Tetsuji Kuboyama,
Kilho Shin,
Tetsuhiro Miyahara,
Hiroshi Yasuda:
A Theoretical Analysis of Alignment and Edit Problems for Trees.
ICTCS 2005: 323-337 |
| 1999 |
|---|
| 2 | EE | Tetsuhiro Miyahara,
Takayoshi Shoudai,
Tomoyuki Uchida,
Tetsuji Kuboyama,
Kenichi Takahashi,
Hiroaki Ueda:
Discovering New Knowledge from Graph Data Using Inductive Logic Programming.
ILP 1999: 222-233 |
| 1 | EE | Tetsuhiro Miyahara,
Tomoyuki Uchida,
Tetsuji Kuboyama,
Tasuya Yamamoto,
Kenichi Takahashi,
Hiroaki Ueda:
KD-FGS: A Knowledge Discovery System from Graph Data Using Formal Graph System.
PAKDD 1999: 438-442 |
