Takayoshi SHOUDAI


A Polynomial Time Pattern Matching Algorithm on Graph Patterns of Bounded Treewidth
Takayoshi SHOUDAI Takashi YAMADA 
Publication:   
Publication Date: 2017/09/01
Vol. E100-A  No. 9  pp. 1764-1772
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
graph pattern matchingpartial k-tree patternbounded treewidthhyperedge replacementpolynomial time algorithm
 Summary | Full Text:PDF(1.2MB)

Polynomial Time Inductive Inference of Languages of Ordered Term Tree Patterns with Height-Constrained Variables from Positive Data
Takayoshi SHOUDAI Kazuhide AIKOH Yusuke SUZUKI Satoshi MATSUMOTO Tetsuhiro MIYAHARA Tomoyuki UCHIDA 
Publication:   
Publication Date: 2017/03/01
Vol. E100-A  No. 3  pp. 785-802
Type of Manuscript:  PAPER
Category: Algorithms and Data Structures
Keyword: 
tree structured patternheight-constrained variablepolynomial time algorithminductive inferencecomputational learning theory
 Summary | Full Text:PDF(2.3MB)

An Efficient Pattern Matching Algorithm for Ordered Term Tree Patterns
Yusuke SUZUKI Takayoshi SHOUDAI Tomoyuki UCHIDA Tetsuhiro MIYAHARA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2015/06/01
Vol. E98-A  No. 6  pp. 1197-1211
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
ordered tree structured patterngraph pattern matching algorithmpolynomial time algorithmNP-completeness
 Summary | Full Text:PDF(2MB)

Polynomial Time Inductive Inference of TTSP Graph Languages from Positive Data
Ryoji TAKAMI Yusuke SUZUKI Tomoyuki UCHIDA Takayoshi SHOUDAI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2009/02/01
Vol. E92-D  No. 2  pp. 181-190
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science)
Category: 
Keyword: 
inductive inferencecomputational learning theoryTTSP graphgraph languages
 Summary | Full Text:PDF(1.2MB)

A Polynomial Time Algorithm for Finding a Minimally Generalized Linear Interval Graph Pattern
Hitoshi YAMASAKI Takayoshi SHOUDAI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2009/02/01
Vol. E92-D  No. 2  pp. 120-129
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science)
Category: 
Keyword: 
interval graphsPQ-treesgraph structured patternsgraph miningcomputational learning theory
 Summary | Full Text:PDF(983.4KB)

Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries
Satoshi MATSUMOTO Takayoshi SHOUDAI Tomoyuki UCHIDA Tetsuhiro MIYAHARA Yusuke SUZUKI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2008/02/01
Vol. E91-D  No. 2  pp. 222-230
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science)
Category: Algorithmic Learning Theory
Keyword: 
exact learningcomputational learning theoryfinite union of tree pattern languages
 Summary | Full Text:PDF(440.2KB)

Discovering Knowledge from Graph Structured Data by Using Refutably Inductive Inference of Formal Graph Systems
Tetsuhiro MIYAHARA Tomoyuki UCHIDA Takayoshi SHOUDAI Tetsuji KUBOYAMA Kenichi TAKAHASHI Hiroaki UEDA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2001/01/01
Vol. E84-D  No. 1  pp. 48-56
Type of Manuscript:  Special Section PAPER (Special Issue on Selected Papers from LA Symposium)
Category: 
Keyword: 
knowledge discoverygraph structured datainductive logic programmingrefutably inductive inference
 Summary | Full Text:PDF(498.5KB)

Parallel Algorithms for Refutation Tree Problem on Formal Graph Systems
Tomoyuki UCHIDA Takayoshi SHOUDAI Satoru MIYANO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1995/02/25
Vol. E78-D  No. 2  pp. 99-112
Type of Manuscript:  PAPER
Category: Algorithm and Computational Complexity
Keyword: 
algorithm and computational complexityformal graph systemrefutation treetwo-terminal series parallel graphouterplanar graph
 Summary | Full Text:PDF(1MB)

A Parallel Algorithm for the Maximal Co-Hitting Set Problem
Takayoshi SHOUDAI Satoru MIYANO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1993/02/25
Vol. E76-D  No. 2  pp. 296-298
Type of Manuscript:  LETTER
Category: Algorithm and Computational Complexity
Keyword: 
algorithm and computational complexityparallel algorithmmaximal co-hitting set problemminimal set cover problemmaximal independent set problem
 Summary | Full Text:PDF(200.5KB)