| 2009 | ||
|---|---|---|
| 44 | Hitoshi Yamasaki, Takayoshi Shoudai: A Polynomial Time Algorithm for Finding a Minimally Generalized Linear Interval Graph Pattern. IEICE Transactions 92-D(2): 120-129 (2009) | |
| 43 | Ryoji Takami, Yusuke Suzuki, Tomoyuki Uchida, Takayoshi Shoudai: Polynomial Time Inductive Inference of TTSP Graph Languages from Positive Data. IEICE Transactions 92-D(2): 181-190 (2009) | |
| 2008 | ||
| 42 | Hitoshi Yamasaki, Yosuke Sasaki, Takayoshi Shoudai, Tomoyuki Uchida, Yusuke Suzuki: Learning Block-Preserving Outerplanar Graph Patterns and Its Application to Data Mining. ILP 2008: 330-347 | |
| 41 | Satoshi Matsumoto, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara, Yusuke Suzuki: Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries. IEICE Transactions 91-D(2): 222-230 (2008) | |
| 2007 | ||
| 40 | Rika Okada, Satoshi Matsumoto, Tomoyuki Uchida, Yusuke Suzuki, Takayoshi Shoudai: Exact Learning of Finite Unions of Graph Patterns from Queries. ALT 2007: 298-312 | |
| 39 | Yosuke Sasaki, Hitoshi Yamasaki, Takayoshi Shoudai, Tomoyuki Uchida: Mining of Frequent Block Preserving Outerplanar Graph Structured Patterns. ILP 2007: 239-253 | |
| 38 | Hitoshi Yamasaki, Takayoshi Shoudai: A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns. TAMC 2007: 67-78 | |
| 2006 | ||
| 37 | Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara: Ordered term tree languages which are polynomial time inductively inferable from positive data. Theor. Comput. Sci. 350(1): 63-90 (2006) | |
| 2005 | ||
| 36 | Kazuhide Aikou, Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara: A Polynomial Time Matching Algorithm of Ordered Tree Patterns Having Height-Constrained Variables. CPM 2005: 346-357 | |
| 35 | Ryoji Takami, Yusuke Suzuki, Tomoyuki Uchida, Takayoshi Shoudai, Yasuaki Nakamura: Polynomial Time Inductive Inference of TTSP Graph Languages from Positive Data. ILP 2005: 366-383 | |
| 34 | Yusuke Suzuki, Tetsuhiro Miyahara, Takayoshi Shoudai, Tomoyuki Uchida, Yasuaki Nakamura: Discovery of Maximally Frequent Tag Tree Patterns with Height-Constrained Variables from Semistructured Web Documents. WIRI 2005: 104-112 | |
| 2004 | ||
| 33 | Satoshi Matsumoto, Takayoshi Shoudai: Learning of Ordered Tree Languages with Height-Bounded Variables Using Queries. ALT 2004: 425-439 | |
| 32 | Kazuhide Aikou, Yusuke Suzuki, Takayoshi Shoudai, Tetsuhiro Miyahara: Automatic Wrapper Generation for Metasearch Using Ordered Tree Structured Patterns. Australian Conference on Artificial Intelligence 2004: 1030-1035 | |
| 31 | Tetsuhiro Miyahara, Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Kenichi Takahashi, Hiroaki Ueda: Discovery of Maximally Frequent Tag Tree Patterns with Contractible Variables from Semistructured Documents. PAKDD 2004: 133-144 | |
| 30 | Yusuke Suzuki, Takayoshi Shoudai, Satoshi Matsumoto, Tetsuhiro Miyahara: Polynomial Time Inductive Inference of Ordered Tree Languages with Height-Constrained Variables from Positive Data. PRICAI 2004: 211-220 | |
| 2003 | ||
| 29 | Yusuke Suzuki, Takayoshi Shoudai, Satoshi Matsumoto, Tomoyuki Uchida, Tetsuhiro Miyahara: Efficient Learning of Ordered and Unordered Tree Patterns with Contractible Variables. ALT 2003: 114-128 | |
| 28 | Satoshi Matsumoto, Yusuke Suzuki, Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida: Learning of Finite Unions of Tree Patterns with Repeated Internal Structured Variables from Queries. ALT 2003: 144-158 | |
| 27 | Yusuke Suzuki, Takayoshi Shoudai, Satoshi Matsumoto, Tomoyuki Uchida: Efficient Learning of Unlabeled Term Trees with Contractible Variables from Positive Data. ILP 2003: 347-364 | |
| 26 | Kazunori Yamagata, Tomoyuki Uchida, Takayoshi Shoudai, Yasuaki Nakamura: An Effective Grammar-Based Compression Algorithm for Tree Structured Data. ILP 2003: 383-400 | |
| 25 | Tetsuhiro Miyahara, Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Sachio Hirokawa, Kenichi Takahashi, Hiroaki Ueda: Extraction of Tag Tree Patterns with Contractible Variables from Irregular Semistructured Data. PAKDD 2003: 430-436 | |
| 24 | Yuko Itokawa, Tomoyuki Uchida, Takayoshi Shoudai, Tetsuhiro Miyahara, Yasuaki Nakamura: Finding Frequent Subgraphs from Graph Structured Data with Geometric Information and Its Application to Lossless Compression. PAKDD 2003: 582-594 | |
| 2002 | ||
| 23 | Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara: Ordered Term Tree Languages which Are Polynomial Time Inductively Inferable from Positive Data. ALT 2002: 188-202 | |
| 22 | Satoshi Matsumoto, Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida: Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries. Australian Joint Conference on Artificial Intelligence 2002: 523-534 | |
| 21 | Yusuke Suzuki, Ryuta Akanuma, Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida: Polynomial Time Inductive Inference of Ordered Tree Patterns with Internal Structured Variables from Positive Data. COLT 2002: 169-184 | |
| 20 | Osamu Maruyama, Takayoshi Shoudai, Satoru Miyano: Toward Drawing an Atlas of Hypothesis Classes: Approximating a Hypothesis via Another Hypothesis Model. Discovery Science 2002: 220-232 | |
| 19 | Tsunenori Mine, Akira Suganuma, Takayoshi Shoudai: A Support for Navigation Path Planning with Adaptive Previewing for Web-Based Learning. ICCE 2002: 1250-1251 | |
| 18 | Yusuke Suzuki, Kohtaro Inomae, Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida: A Polynomial Time Matching Algorithm of Structured Ordered Tree Patterns for Data Mining from Semistructured Data. ILP 2002: 270-284 | |
| 17 | Tetsuhiro Miyahara, Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Kenichi Takahashi, Hiroaki Ueda: Discovery of Frequent Tag Tree Patterns in Semistructured Web Documents. PAKDD 2002: 341-355 | |
| 16 | Kazuyoshi Furukawa, Tomoyuki Uchida, Kazuya Yamada, Tetsuhiro Miyahara, Takayoshi Shoudai, Yasuaki Nakamura: Extracting Characteristic Structures among Words in Semistructured Documents. PAKDD 2002: 356-367 | |
| 2001 | ||
| 15 | Osamu Maruyama, Takayoshi Shoudai, Emiko Furuichi, Satoru Kuhara, Satoru Miyano: Learning Conformation Rules. Discovery Science 2001: 243-257 | |
| 14 | Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara: Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables. FCT 2001: 335-346 | |
| 13 | Tetsuhiro Miyahara, Takayoshi Shoudai, Tomoyuki Uchida, Kenichi Takahashi, Hiroaki Ueda: Discovery of Frequent Tree Structured Patterns in Semistructured Web Documents. PAKDD 2001: 47-52 | |
| 2000 | ||
| 12 | Tomoyuki Uchida, Yuko Itokawa, Takayoshi Shoudai, Tetsuhiro Miyahara, Yasuaki Nakamura: A New Framework for Discovering Knowledge from Two-Dimensional Structured Data Using Layout Formal Graph System. ALT 2000: 141-155 | |
| 11 | Tetsuhiro Miyahara, Takayoshi Shoudai, Tomoyuki Uchida, Kenichi Takahashi, Hiroaki Ueda: Polynomial Time Matching Algorithms for Tree-Like Structured Patterns in Knowledge Discovery. PAKDD 2000: 5-16 | |
| 10 | Tsunenori Mine, Takayoshi Shoudai, Akira Suganuma: Automatic Exercise Generator with Tagged Documents Considering Lerner's Performance. WebNet 2000: 779-780 | |
| 1999 | ||
| 9 | Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida, Satoshi Matsumoto: Inductive Inference of Regular Term Free Languages and Its Application to Knowledge Discovery. EJC 1999: 85-102 | |
| 8 | 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 | |
| 1998 | ||
| 7 | Osamu Maruyama, Tomoyuki Uchida, Takayoshi Shoudai, Satoru Miyano: Toward Genomic Hypothesis Creator: View Designer for Discovery. Discovery Science 1998: 105-116 | |
| 1997 | ||
| 6 | Satoshi Matsumoto, Yukiko Hayashi, Takayoshi Shoudai: Polynomial Time Inductive Inference of Regular Term Tree Languages from Positive Data. ALT 1997: 212-227 | |
| 1995 | ||
| 5 | Takayoshi Shoudai, Michael Lappe, Satoru Miyano, Ayumi Shinohara, Takeo Okazaki, Setsuo Arikawa, Tomoyuki Uchida, Shinichi Shimozono, Takeshi Shinohara, Satoru Kuhara: BONSAI Garden: Parallel Knowledge Discovery System for Amino Acid Sequences. ISMB 1995: 359-358 | |
| 4 | Takayoshi Shoudai, Satoru Miyano: Using Maximal Independent Sets to Solve Problems in Parallel. Theor. Comput. Sci. 148(1): 57-65 (1995) | |
| 1992 | ||
| 3 | Takayoshi Shoudai: A P-Complete Language Describable with Iterated Shuffle. Inf. Process. Lett. 41(5): 233-238 (1992) | |
| 1991 | ||
| 2 | Takayoshi Shoudai: Using Maximal Independent Sets to Solve Problems in Parallel. WG 1991: 126-134 | |
| 1989 | ||
| 1 | Takayoshi Shoudai: The Lexicographically First Topological Order Problem is NLOG-Complete. Inf. Process. Lett. 33(3): 121-124 (1989) | |