The SCEAS System
Navigation Menu

Search the dblp DataBase


Tetsuji Kuboyama: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nobuhito Ohkura, Kouichi Hirata, Tetsuji Kuboyama, Masateru Harao
    The q-Gram Distance for Ordered Unlabeled Trees. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2005, pp:189-202 [Conf]
  2. Tetsuji Kuboyama, Kilho Shin, Tetsuhiro Miyahara, Hiroshi Yasuda
    A Theoretical Analysis of Alignment and Edit Problems for Trees. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:323-337 [Conf]
  3. Tetsuhiro Miyahara, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuji Kuboyama, Kenichi Takahashi, Hiroaki Ueda
    Discovering New Knowledge from Graph Data Using Inductive Logic Programming. [Citation Graph (0, 0)][DBLP]
    ILP, 1999, pp:222-233 [Conf]
  4. 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. [Citation Graph (0, 0)][DBLP]
    PAKDD, 1999, pp:438-442 [Conf]
  5. Kilho Shin, Tetsuji Kuboyama
    Polynomial Summaries of Positive Semidefinite Kernels. [Citation Graph (0, 0)][DBLP]
    ALT, 2007, pp:313-327 [Conf]

  6. Evolution of Multiple Tree Structured Patterns from Tree-Structured Data Using Clustering. [Citation Graph (, )][DBLP]

  7. Kernels Based on Distributions of Agreement Subtrees. [Citation Graph (, )][DBLP]

  8. A Genetic Programming Approach to Extraction of Glycan Motifs Using Tree Structured Patterns. [Citation Graph (, )][DBLP]

  9. A generalization of Haussler's convolution kernel: mapping kernel. [Citation Graph (, )][DBLP]

  10. Extracting Research Communities by Improved Maximum Flow Algorithm. [Citation Graph (, )][DBLP]

  11. Discovering Networks for Global Propagation of Influenza A (H3N2) Viruses by Clustering. [Citation Graph (, )][DBLP]

  12. An Efficient Unordered Tree Kernel and Its Application to Glycan Classification. [Citation Graph (, )][DBLP]

  13. Sibling Distance for Rooted Labeled Trees. [Citation Graph (, )][DBLP]

  14. Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002