![]() | 2005 | |
---|---|---|
83 | ![]() ![]() ![]() ![]() ![]() ![]() | Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi: On-line construction of compact directed acyclic word graphs. Discrete Applied Mathematics 146(2): 156-179 (2005) |
2004 | ||
82 | ![]() ![]() ![]() ![]() ![]() ![]() | Einoshin Suzuki, Setsuo Arikawa: Discovery Science, 7th International Conference, DS 2004, Padova, Italy, October 2-5, 2004, Proceedings Springer 2004 |
81 | ![]() ![]() ![]() ![]() ![]() ![]() | Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Compact directed acyclic word graphs for a sliding window. J. Discrete Algorithms 2(1): 33-51 (2004) |
2003 | ||
80 | ![]() ![]() ![]() ![]() ![]() ![]() | Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Setsuo Arikawa: Discovering Most Classificatory Patterns for Very Expressive Pattern Classes. Discovery Science 2003: 486-493 |
79 | ![]() ![]() ![]() ![]() ![]() ![]() | Kensuke Baba, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, Setsuo Arikawa: A Note on Randomized Algorithm for String Matching with Mismatches. Nord. J. Comput. 10(1): 2-12 (2003) |
78 | ![]() ![]() ![]() ![]() ![]() ![]() | Takuya Kida, Tetsuya Matsumoto, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: Collage system: a unifying framework for compressed pattern matching. Theor. Comput. Sci. 1(298): 253-272 (2003) |
77 | ![]() ![]() ![]() ![]() ![]() ![]() | Setsuo Arikawa, Koichi Furukawa, Shinichi Morishita, Hiroshi Motoda: Preface. Theor. Comput. Sci. 292(2): 343-344 (2003) |
76 | ![]() ![]() ![]() ![]() ![]() ![]() | Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: A practical algorithm to find the best subsequence patterns. Theor. Comput. Sci. 292(2): 465-479 (2003) |
2002 | ||
75 | ![]() ![]() ![]() ![]() ![]() ![]() | Setsuo Arikawa, Ayumi Shinohara: Progress in Discovery Science, Final Report of the Japanese Discovery Science Project Springer 2002 |
74 | ![]() ![]() ![]() ![]() ![]() ![]() | Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, Setsuo Arikawa: The Minimum DAWG for All Suffixes of a String and Its Applications. CPM 2002: 153-167 |
73 | ![]() ![]() ![]() ![]() ![]() ![]() | Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Discovering Best Variable-Length-Don't-Care Patterns. Discovery Science 2002: 86-97 |
72 | ![]() ![]() ![]() ![]() ![]() ![]() | Tatsuya Asai, Hiroki Arimura, Kenji Abe, Shinji Kawasoe, Setsuo Arikawa: Online Algorithms for Mining Semi-structured Data Stream. ICDM 2002: 27-34 |
71 | ![]() ![]() ![]() ![]() ![]() ![]() | Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa: Space-Economical Construction of Index Structures for All Suffixes of a String. MFCS 2002: 341-352 |
70 | ![]() ![]() ![]() ![]() ![]() ![]() | Kenji Abe, Shinji Kawasoe, Tatsuya Asai, Hiroki Arimura, Setsuo Arikawa: Optimized Substructure Discovery for Semi-structured Data. PKDD 2002: 1-14 |
69 | ![]() ![]() ![]() ![]() ![]() ![]() | Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa: Efficient Data Mining from Large Text Databases. Progress in Discovery Science 2002: 123-139 |
68 | ![]() ![]() ![]() ![]() ![]() ![]() | Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Masahiro Hirao, Hiromasa Hoshino, Shunsuke Inenaga: Finding Best Patterns Practically. Progress in Discovery Science 2002: 307-317 |
67 | ![]() ![]() ![]() ![]() ![]() ![]() | Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa: Knowledge Discovery from Semistructured Texts. Progress in Discovery Science 2002: 586-599 |
66 | ![]() ![]() ![]() ![]() ![]() ![]() | Tatsuya Asai, Kenji Abe, Shinji Kawasoe, Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa: Efficient Substructure Discovery from Large Semi-structured Data. SDM 2002 |
65 | ![]() ![]() ![]() ![]() ![]() ![]() | Masayuki Takeda, Satoru Miyamoto, Takuya Kida, Ayumi Shinohara, Shuichi Fukamachi, Takeshi Shinohara, Setsuo Arikawa: Processing Text Files as Is: Pattern Matching over Compressed Texts, Multi-byte Character Texts, and Semi-structured Texts. SPIRE 2002: 170-186 |
64 | ![]() ![]() ![]() ![]() ![]() ![]() | Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Compact Directed Acyclic Word Graphs for a Sliding Window. SPIRE 2002: 310-324 |
2001 | ||
63 | ![]() ![]() ![]() ![]() ![]() ![]() | Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa: Efficient Learning of Semi-structured Data from Queries. ALT 2001: 315-331 |
62 | ![]() ![]() ![]() ![]() ![]() ![]() | Setsuo Arikawa: The Discovery Science Project in Japan. ALT 2001: 9-11 |
61 | ![]() ![]() ![]() ![]() ![]() ![]() | Hiroki Arimura, Hiroki Asaka, Hiroshi Sakamoto, Setsuo Arikawa: Efficient Discovery of Proximity Patterns with Suffix Arrays. CPM 2001: 152-156 |
60 | ![]() ![]() ![]() ![]() ![]() ![]() | Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi: On-Line Construction of Compact Directed Acyclic Word Graphs. CPM 2001: 169-180 |
59 | ![]() ![]() ![]() ![]() ![]() ![]() | Toru Kasai, Gunho Lee, Hiroki Arimura, Setsuo Arikawa, Kunsoo Park: Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications. CPM 2001: 181-192 |
58 | ![]() ![]() ![]() ![]() ![]() ![]() | Takuya Kida, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: Multiple Pattern Matching Algorithms on Collage System. CPM 2001: 193-206 |
57 | ![]() ![]() ![]() ![]() ![]() ![]() | Gonzalo Navarro, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: Faster Approximate String Matching over Compressed Text. Data Compression Conference 2001: 459-468 |
56 | ![]() ![]() ![]() ![]() ![]() ![]() | Shuichi Mitarai, Masahiro Hirao, Tetsuya Matsumoto, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Compressed Pattern Matching for SEQUITUR. Data Compression Conference 2001: 469- |
55 | ![]() ![]() ![]() ![]() ![]() ![]() | Setsuo Arikawa: The Discovery Science Project in Japan. Discovery Science 2001: 1-2 |
54 | ![]() ![]() ![]() ![]() ![]() ![]() | Katsuaki Taniguchi, Hiroshi Sakamoto, Hiroki Arimura, Shinichi Shimozono, Setsuo Arikawa: Mining Semi-structured Data by Path Expressions. Discovery Science 2001: 378-388 |
53 | ![]() ![]() ![]() ![]() ![]() ![]() | Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: A Practical Algorithm to Find the Best Episode Patterns. Discovery Science 2001: 435-440 |
52 | ![]() ![]() ![]() ![]() ![]() ![]() | Hiroshi Sakamoto, Yoshitsugu Murakami, Hiroki Arimura, Setsuo Arikawa: Extracting Partial Structures from HTML Documents. FLAIRS Conference 2001: 264-268 |
51 | ![]() ![]() ![]() ![]() ![]() ![]() | Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs. SPIRE 2001: 96-110 |
50 | ![]() ![]() ![]() ![]() ![]() ![]() | Eiju Hirowatari, Setsuo Arikawa: A comparison of identification criteria for inductive inference of recursive real-valued functions. Theor. Comput. Sci. 268(2): 351-366 (2001) |
2000 | ||
49 | ![]() ![]() ![]() ![]() ![]() ![]() | Setsuo Arikawa, Shinichi Morishita: Discovery Science, Third International Conference, DS 2000, Kyoto, Japan, December 4-6, 2000, Proceedings Springer 2000 |
48 | ![]() ![]() ![]() ![]() ![]() ![]() | Yusuke Shibata, Takuya Kida, Shuichi Fukamachi, Masayuki Takeda, Ayumi Shinohara, Takeshi Shinohara, Setsuo Arikawa: Speeding Up Pattern Matching by Text Compression. CIAC 2000: 306-315 |
47 | ![]() ![]() ![]() ![]() ![]() ![]() | Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: A Boyer-Moore Type Algorithm for Compressed Pattern Matching. CPM 2000: 181-194 |
46 | ![]() ![]() ![]() ![]() ![]() ![]() | Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: A Practical Algorithm to Find the Best Subsequence Patterns. Discovery Science 2000: 141-154 |
45 | ![]() ![]() ![]() ![]() ![]() ![]() | Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa: Identification of Tree Translation Rules from Examples. ICGI 2000: 241-255 |
44 | ![]() ![]() ![]() ![]() ![]() ![]() | Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa: Learning Term Rewriting Systems from Entailment . ILP Work-in-progress reports 2000 |
43 | ![]() ![]() ![]() ![]() ![]() ![]() | Hiroki Arimura, Jun-ichiro Abe, Hiroshi Sakamoto, Setsuo Arikawa, Ryoichi Fujino, Shinichi Shimozono: Text Data Mining: Discovery of Important Keywords in the Cyberspace. Kyoto International Conference on Digital Libraries 2000: 121-126 |
42 | ![]() ![]() ![]() ![]() ![]() ![]() | Toshiro Minami, Hidekazu Kurita, Setsuo Arikawa: Putting Old Data into New System: Web-Based Catalog Card Image Searching. Kyoto International Conference on Digital Libraries 2000: 296-303 |
41 | ![]() ![]() ![]() ![]() ![]() ![]() | Ryoichi Fujino, Hiroki Arimura, Setsuo Arikawa: Discovering Unordered and Ordered Phrase Association Patterns for Text Mining. PAKDD 2000: 281-293 |
40 | ![]() ![]() ![]() ![]() ![]() ![]() | Masahiro Hirao, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs. SPIRE 2000: 132-138 |
39 | ![]() ![]() ![]() ![]() ![]() ![]() | Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Online Construction of Subsequence Automata for Multiple Texts. SPIRE 2000: 146-152 |
38 | ![]() ![]() ![]() ![]() ![]() ![]() | Tetsuya Matsumoto, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: Bit-Parallel Approach to Approximate String Matching in Compressed Texts. SPIRE 2000: 221-228 |
37 | ![]() ![]() ![]() ![]() ![]() ![]() | Hiroshi Motoda, Setsuo Arikawa: Special Feature on Discovery Science. New Generation Comput. 18(1): 13-16 (2000) |
36 | ![]() ![]() ![]() ![]() ![]() ![]() | Shinichi Shimozono, Hiroki Arimura, Setsuo Arikawa: Efficient Discovery of Optimal Word-Association Patterns in Large Text Databases. New Generation Comput. 18(1): 49-60 (2000) |
1999 | ||
35 | ![]() ![]() ![]() ![]() ![]() ![]() | Setsuo Arikawa, Koichi Furukawa: Discovery Science, Second International Conference, DS '99, Tokyo, Japan, December, 1999, Proceedings Springer 1999 |
34 | ![]() ![]() ![]() ![]() ![]() ![]() | Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: Shift-And Approach to Pattern Matching in LZW Compressed Text. CPM 1999: 1-13 |
33 | ![]() ![]() ![]() ![]() ![]() ![]() | Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: Pattern Matching in Text Compressed by Using Antidictionaries. CPM 1999: 37-49 |
32 | ![]() ![]() ![]() ![]() ![]() ![]() | Setsuo Arikawa: A Road to Discovery Science (Abstract). RSFDGrC 1999: 19 |
31 | ![]() ![]() ![]() ![]() ![]() ![]() | Takuya Kida, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: A Unifying Framework for Compressed Pattern Matching. SPIRE/CRIWG 1999: 89-96 |
30 | ![]() ![]() ![]() ![]() ![]() ![]() | Kalvis Apsitis, Setsuo Arikawa, Rusins Freivalds, Eiju Hirowatari, Carl H. Smith: On the Inductive Inference of Recursive Real-Valued Functions. Theor. Comput. Sci. 219(1-2): 3-17 (1999) |
1998 | ||
29 | ![]() ![]() ![]() ![]() ![]() ![]() | Setsuo Arikawa, Hiroshi Motoda: Discovery Science, First International Conference, DS '98, Fukuoka, Japan, December 14-16, 1998, Proceedings Springer 1998 |
28 | ![]() ![]() ![]() ![]() ![]() ![]() | Hiroki Arimura, Atsushi Wataki, Ryoichi Fujino, Setsuo Arikawa: A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases. ALT 1998: 247-261 |
27 | ![]() ![]() ![]() ![]() ![]() ![]() | Eiju Hirowatari, Setsuo Arikawa: A Comparison of Identification Criteria for Inductive Inference of Recursive Real-Valued Functions. ALT 1998: 262-275 |
26 | ![]() ![]() ![]() ![]() ![]() ![]() | Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Masamichi Miyazaki, Setsuo Arikawa: Multiple Pattern Matching in LZW Compressed Text. Data Compression Conference 1998: 103-112 |
25 | ![]() ![]() ![]() ![]() ![]() ![]() | Koichi Niijima, Hidemi Uchida, Eiju Hirowatari, Setsuo Arikawa: Discovery of Differential Equations from Numerical Data. Discovery Science 1998: 364-374 |
24 | ![]() ![]() ![]() ![]() ![]() ![]() | Hiroki Arimura, Atsushi Wataki, Ryoichi Fujino, Shinichi Shimozono, Setsuo Arikawa: An Efficient Tool for Discovering Simple Combinatorial Patterns from Large Text Databases. Discovery Science 1998: 393-394 |
1997 | ||
23 | ![]() ![]() ![]() ![]() ![]() ![]() | Eiju Hirowatari, Setsuo Arikawa: Inferability of Recursive Real-Valued Functions. ALT 1997: 18-31 |
22 | ![]() ![]() ![]() ![]() ![]() ![]() | Setsuo Arikawa, Michael M. Richter: Special Issue on Algorithmic Learning Theory. New Generation Comput. 15(1): 1-2 (1997) |
1996 | ||
21 | ![]() ![]() ![]() ![]() ![]() ![]() | Setsuo Arikawa, Arun Sharma: Algorithmic Learning Theory, 7th International Workshop, ALT '96, Sydney, Australia, October 23-25, 1996, Proceedings Springer 1996 |
1995 | ||
20 | ![]() ![]() ![]() ![]() ![]() ![]() | Takeshi Shinohara, Setsuo Arikawa: Pattern Inference. GOSLER Final Report 1995: 259-291 |
19 | ![]() ![]() ![]() ![]() ![]() ![]() | 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 |
18 | ![]() ![]() ![]() ![]() ![]() ![]() | Setsuo Arikawa, Masako Sato, Ayumi Shinohara, Takeshi Shinohara: Developments in Computational Learning and Discovery Theory within the Framework of Elementary Formal Systems. Machine Intelligence 15 1995: 227-247 |
17 | ![]() ![]() ![]() ![]() ![]() ![]() | Yasuhito Mukouchi, Setsuo Arikawa: Towards a Mathematical Theory of Machine Discovery from Facts. Theor. Comput. Sci. 137(1): 53-84 (1995) |
1994 | ||
16 | ![]() ![]() ![]() ![]() ![]() ![]() | Setsuo Arikawa, Klaus P. Jantke: Algorithmic Learning Theory, 4th International Workshop on Analogical and Inductive Inference, AII '94, 5th International Workshop on Algorithmic Learning Theory, ALT '94, Reinhardsbrunn Castle, Germany, October 10-15, 1994, Proceedings Springer 1994 |
15 | ![]() ![]() ![]() ![]() ![]() ![]() | Yasuyuki Koga, Eiju Hirowatari, Setsuo Arikawa: Explanation-Based Reuse of Prolog Programs. AII/ALT 1994: 149-160 |
14 | ![]() ![]() ![]() ![]() ![]() ![]() | Eizyu Hirowatari, Setsuo Arikawa: Partially Isomorphic Generalization and Analogical Reasoning. ECML 1994: 363-366 |
1993 | ||
13 | ![]() ![]() ![]() ![]() ![]() ![]() | Yasuhito Mukouchi, Setsuo Arikawa: Inductive Inference Machines That Can Refute Hypothesis Spaces. ALT 1993: 123-136 |
12 | ![]() ![]() ![]() ![]() ![]() ![]() | Setsuo Arikawa, Satoru Miyano, Ayumi Shinohara, Satoru Kuhara, Yasuhito Mukouchi, Takeshi Shinohara: A Machine Discovery from Amino Acid Sequences by Decision Trees over Regular Patterns. New Generation Comput. 11(3): 361-375 (1993) |
1992 | ||
11 | ![]() ![]() ![]() ![]() ![]() ![]() | Setsuo Arikawa, Satoru Kuhara, Satoru Miyano, Yasuhito Mukouchi, Ayumi Shinohara, Takeshi Shinohara: A Machine Discovery from Amino Acid Sequences by Decision Trees over Regular Patterns. FGCS 1992: 618-625 |
10 | ![]() ![]() ![]() ![]() ![]() ![]() | Setsuo Arikawa, Takeshi Shinohara, Akihiro Yamamoto: Learning Elementary Formal Systems. Theor. Comput. Sci. 95(1): 97-113 (1992) |
1991 | ||
9 | ![]() ![]() ![]() ![]() ![]() ![]() | Setsuo Arikawa, Takeshi Shinohara, Satoru Miyano, Ayumi Shinohara: More About Learning Elementary Formal Systems. Nonmonotonic and Inductive Logic 1991: 107-117 |
8 | ![]() ![]() ![]() ![]() ![]() ![]() | Setsuo Arikawa: Introduction: Special Issue on Algorithmic Learning Theory. New Generation Comput. 8(4): 277- (1991) |
1989 | ||
7 | ![]() ![]() ![]() ![]() ![]() ![]() | Setsuo Arikawa, Takeshi Shinohara, Akihiro Yamamoto: Elementary Formal System as a Unifying Framework for Language Learning. COLT 1989: 312-327 |
6 | ![]() ![]() ![]() ![]() ![]() ![]() | Yihua Shi, Setsuo Arikawa: Time-Bounded Reasoning in First Order Knowledge Base Systems. LP 1989: 54-72 |
1988 | ||
5 | ![]() ![]() ![]() ![]() ![]() ![]() | Hiroko Yuasa, Setsuo Arikawa: Pseudo Extension in Default Reasoning and Belief Revision by Model Inference. LP 1988: 27-37 |
1986 | ||
4 | ![]() ![]() ![]() ![]() ![]() ![]() | Makoto Haraguchi, Setsuo Arikawa: Reasoning by Analogy as a Partial Identity Between Models. AII 1986: 61-87 |
3 | ![]() ![]() ![]() ![]() ![]() ![]() | Makoto Haraguchi, Setsuo Arikawa: A Foundation of Reasoning by Analogy: Analogical Union of Logic Programs. LP 1986: 58-69 |
1985 | ||
2 | ![]() ![]() ![]() ![]() ![]() ![]() | Setsuo Arikawa, Takeshi Shinohara: Efficient pattern matching algorithms and their applications to text information systems. RIAO 1985: 349-371 |
1984 | ||
1 | ![]() ![]() ![]() ![]() ![]() ![]() | Setsuo Arikawa, Takeshi Shinohara: A Run-Time Efficient Realization of Aho-Corasick Pattern Matching Machines. New Generation Comput. 2(2): 171-186 (1984) |