■ Journal
Papers
1.
Takayoshi
Shoudai and Takashi Yamada, A Polynomial Time Pattern Matching Algorithm
on Graph Patterns of Bounded Treewidth, IEICE
Transactions on Fundamentals of Electronics, Communications and Computer
Sciences, Special Issue on Discrete Mathematics and Its Applications, to
appear, 2017.
2.
Takayoshi
Shoudai, Kazuhide Aikoh,
Yusuke Suzuki, Satoshi Matsumoto, Tetsuhiro Miyahara,
Tomoyuki Uchida, Polynomial Time Inductive Inference of Languages of Ordered
Term Tree Patterns with Height-Constrained Variables from Positive Data, IEICE
Transactions on Fundamentals of Electronics, Communications and Computer
Sciences, Vol.E100-A, No.3, pp.785-802, 2017.
3.
Takayoshi
Shoudai, Hikarui Murai, and
Atsushi Okamoto, A Semi-Supervised Data Screening for Network Traffic Data
Using Graph Min-Cuts, IPSJ Transactions on Mathematical Modeling and its
Applications, Vol.9, No.2, pp.49-60, 2016.
4.
Yusuke
Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, and Tetsuhiro
Miyahara, An Efficient Pattern Matching Algorithm for Ordered Term Tree
Patterns, IEICE Transactions on Fundamentals of Electronics, Communications and
Computer Sciences, Vol.E98-A, No.6, pp.1197-1211, 2015.
5.
Yasuhiro
Okamoto and Takayoshi Shoudai, Hard Optimization Problems in Learning Tree
Contraction Patterns, Applied Computing and Information Technology, Springer,
Studies in Computational Intelligence, Vol.553, pp.77-90, 2014.
6.
Hisashi Tsuruta, Takayoshi
Shoudai, and Jun'ichi Takeuchi, Network Traffic
Screening Using Frequent Sequential Patterns, Intelligent Control and
Innovative Computing, Springer, Lecture Notes in Electrical Engineering,
Vol.110, pp.363-375, 2012.
7.
Takashi
Yamada and Takayoshi Shoudai, Efficient Pattern Matching on Graph Patterns of
Bounded Treewidth, Electronic Notes in Discrete
Mathematics, Vol.37, pp.117-122, 2011.
8.
Hitoshi
Yamasaki, Takashi Yamada, and Takayoshi Shoudai, Graph Pattern Matching with
Expressive Outerplanar Graph Patterns, Intelligent
Control and Computer Engineering, Springer, Lecture Notes in Electrical
Engineering, Vol.70, pp.231-243, 2010.
9.
Yuko
Itokawa, Koichiro Katoh,
Tomoyuki Uchida, and Takayoshi Shoudai, Algorithm Using Expanded LZ Compression
Scheme for Compressing Tree Structured Data, Intelligent Automation and
Computer Engineering, Springer, Lecture Notes in Electrical Engineering,
Vol.52, pp.333-346, 2010.
10.
Satoshi
Matsumoto, Yusuke Suzuki, Takayoshi Shoudai, Tetsuhiro
Miyahara, and Tomoyuki Uchida, Learning of Finite Unions of Tree Patterns with
Repeated Internal Structured Variables from Queries, IPSJ Transactions on
Mathematical Modeling and its Applications, Vol.2, No.3, pp.127-137, 2009.
11.
Hitoshi
Yamasaki, Yosuke Sasaki, Takayoshi Shoudai, Tomoyuki Uchida, and Yusuke Suzuki,
Learning block-preserving graph patterns and its
application to data mining, Machine Learning, Vol.76, No.1, pp.137-173, 2009.
12.
Ryoji Takami, Yusuke
Suzuki, Tomoyuki Uchida, and Takayoshi Shoudai, Polynomial Time Inductive Inference
of TTSP Graph Languages from Positive Data, IEICE Transactions on Information
and Systems, Vol.E92-D, No.2, pp.181-190, 2009.
13.
Hitoshi
Yamasaki and Takayoshi Shoudai, A Polynomial Time Algorithm for Finding a
Minimally Generalized Linear Interval Graph Pattern, IEICE Transactions on
Information and Systems, Vol.E92-D, No.2, pp.120-129, 2009.
14.
Satoshi
Matsumoto, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro
Miyahara, and Yusuke Suzuki, Learning of Finite Unions of Tree Patterns with
Internal Structured Variables from Queries, IEICE Transactions on Information
and Systems, Vol.E91-D, No.2, pp.222-230, 2008.
15.
Yusuke
Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, and Tetsuhiro
Miyahara, Ordered term tree languages which are
polynomial time inductively inferable from positive data, Theoretical Computer
Science, Vol.350, No.1, pp.63-90, 2006.
16.
Akira
Suganuma, Tsunenori Mine,
Takayoshi Shoudai, Automatic Exercise Generating System That Dynamically Evaluates
both Students' and Questions' Levels (in Japanese), IPSJ Journal, Vol.46, No.7,
pp.1810-1818, 2005.
17.
Tetsuhiro Miyahara, Tomoyuki Uchida, Takayoshi
Shoudai, Tetsuji Kuboyama,
Kenichi Takahashi, and Hiroaki Ueda, Discovering Knowledge from Graph Structured
Data by Using Refutably Inductive Inference of Formal Graph Systems, IEICE
Transactions on Information and Systems, Vol.E84-D, No.1, pp.48-56, 2001.
18.
Naohiro Furukawa, Satoshi Matsumoto, Ayumi Shinohara, Takayoshi Shoudai, and Satoru Miyano, HAKKE: A Multi-Strategy Prediction System for
Sequences, Genome Informatics 7, pp.98-107, 1996.
19.
Takayoshi
Shoudai and Satoru Miyano, Using
maximal independent sets to solve problems in parallel, Theoretical Computer
Science, Vol.148, pp.57-65, 1995.
20.
Yasuo Kawahara, Satoru Kumamoto, Yoshihiro Mizoguchi, Masaya Nohmi, Hiroshi Ohtsuka, and Takayoshi Shoudai, Period lengths of cellular
automata on square lattices with rule 90, Journal of Mathematical Physics,
Vol.36, pp.1435-1456, 1995.
21.
Tomoyuki
Uchida, Takayoshi Shoudai, and Satoru Miyano,
Parallel algorithms for refutation tree problem on formal graph systems, IEICE
Transactions on Information and Systems, Vol.E78-D, pp.99-112, 1995.
22.
Tomoyuki
Uchida, Takayoshi Shoudai, and Satoru Miyano,
Polynomial time algorithm solving the refutation tree problem for formal graph
systems, Bulletin of Informatics and Cybernetic, Vol.26, pp.55-74, 1994.
23.
Takayoshi
Shoudai and Satoru Miyano, A Parallel Algorithm for
the Maximal Co-Hitting Set Problem, IEICE Transactions on Information and
Systems, Vol.E76-D, No.2, pp.296-298, 1993.
24.
Takayoshi
Shoudai, A P-complete language describable with iterated shuffle, Information
Processing Letters, Vol.41, No.5, pp.233-238, 1992.
25.
Takayoshi
Shoudai, The lexicographically first topological order
problem is NLOG-complete, Information Processing Letters, Vol.33, No.3,
pp.121-124, 1989.
Takayoshi Shoudai
shoudai
(at) isb.kiu.ac.jp