| 2005 | ||
|---|---|---|
| j18 | 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 | ||
| j17 | Tatsuya Asai, Kenji Abe, Shinji Kawasoe, Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa: Efficient Substructure Discovery from Large Semi-Structured Data. IEICE Transactions 87-D(12): 2754-2763 (2004) | |
| j16 | 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) | |
| c63 | Tatsuya Asai, Kenji Abe, Shinji Kawasoe, Hiroki Arimura, Setsuo Arikawa: Efficient Algorithms for Finding Frequent Substructures from Semi-structured Data Streams. JSAI Workshops 2004: 29-45 | |
| e7 | Einoshin Suzuki, Setsuo Arikawa (Eds.): Discovery Science, 7th International Conference, DS 2004, Padova, Italy, October 2-5, 2004, Proceedings. Lecture Notes in Computer Science 3245, Springer 2004, isbn 3-540-23357-1 | |
| 2003 | ||
| j15 | 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) | |
| j14 | 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) | |
| j13 | Setsuo Arikawa, Koichi Furukawa, Shinichi Morishita, Hiroshi Motoda: Preface. Theor. Comput. Sci. 292(2): 343-344 (2003) | |
| j12 | 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) | |
| c62 | Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Setsuo Arikawa: Discovering Most Classificatory Patterns for Very Expressive Pattern Classes. Discovery Science 2003: 486-493 | |
| 2002 | ||
| c61 | 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 | |
| c60 | Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Discovering Best Variable-Length-Don't-Care Patterns. Discovery Science 2002: 86-97 | |
| c59 | Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa: Efficient Data Mining from Large Text Databases. Progress in Discovery Science 2002: 123-139 | |
| c58 | Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Masahiro Hirao, Hiromasa Hoshino, Shunsuke Inenaga: Finding Best Patterns Practically. Progress in Discovery Science 2002: 307-317 | |
| c57 | Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa: Knowledge Discovery from Semistructured Texts. Progress in Discovery Science 2002: 586-599 | |
| c56 | Tatsuya Asai, Hiroki Arimura, Kenji Abe, Shinji Kawasoe, Setsuo Arikawa: Online Algorithms for Mining Semi-structured Data Stream. ICDM 2002: 27-34 | |
| c55 | 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 | |
| c54 | Kenji Abe, Shinji Kawasoe, Tatsuya Asai, Hiroki Arimura, Setsuo Arikawa: Optimized Substructure Discovery for Semi-structured Data. PKDD 2002: 1-14 | |
| c53 | Tatsuya Asai, Kenji Abe, Shinji Kawasoe, Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa: Efficient Substructure Discovery from Large Semi-structured Data. SDM 2002 | |
| c52 | 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 | |
| c51 | Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Compact Directed Acyclic Word Graphs for a Sliding Window. SPIRE 2002: 310-324 | |
| c50 | Kensuke Baba, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, Setsuo Arikawa: A Note on Randomized Algorithm for String Matching with Mismatches. Stringology 2002: 9-17 | |
| e6 | Setsuo Arikawa, Ayumi Shinohara (Eds.): Progress in Discovery Science, Final Report of the Japanese Discovery Science Project. Lecture Notes in Computer Science 2281, Springer 2002, isbn 3-540-43338-4 | |
| 2001 | ||
| j11 | 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) | |
| c49 | ||
| c48 | Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa: Efficient Learning of Semi-structured Data from Queries. ALT 2001: 315-331 | |
| c47 | Hiroki Arimura, Hiroki Asaka, Hiroshi Sakamoto, Setsuo Arikawa: Efficient Discovery of Proximity Patterns with Suffix Arrays. CPM 2001: 152-156 | |
| c46 | 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 | |
| c45 | 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 | |
| c44 | Takuya Kida, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: Multiple Pattern Matching Algorithms on Collage System. CPM 2001: 193-206 | |
| c43 | Gonzalo Navarro, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: Faster Approximate String Matching over Compressed Text. Data Compression Conference 2001: 459-468 | |
| c42 | Shuichi Mitarai, Masahiro Hirao, Tetsuya Matsumoto, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Compressed Pattern Matching for SEQUITUR. Data Compression Conference 2001: 469- | |
| c41 | ||
| c40 | Katsuaki Taniguchi, Hiroshi Sakamoto, Hiroki Arimura, Shinichi Shimozono, Setsuo Arikawa: Mining Semi-structured Data by Path Expressions. Discovery Science 2001: 378-388 | |
| c39 | Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: A Practical Algorithm to Find the Best Episode Patterns. Discovery Science 2001: 435-440 | |
| c38 | Hiroshi Sakamoto, Yoshitsugu Murakami, Hiroki Arimura, Setsuo Arikawa: Extracting Partial Structures from HTML Documents. FLAIRS Conference 2001: 264-268 | |
| c37 | Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs. SPIRE 2001: 96-110 | |
| c36 | Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Construction of the CDAWG for a Trie. Stringology 2001: 37-48 | |
| 2000 | ||
| j10 | Hiroshi Motoda, Setsuo Arikawa: Special Feature on Discovery Science. New Generation Comput. 18(1): 13-16 (2000) | |
| j9 | 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) | |
| c35 | 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 | |
| c34 | Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: A Boyer-Moore Type Algorithm for Compressed Pattern Matching. CPM 2000: 181-194 | |
| c33 | Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: A Practical Algorithm to Find the Best Subsequence Patterns. Discovery Science 2000: 141-154 | |
| c32 | Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa: Identification of Tree Translation Rules from Examples. ICGI 2000: 241-255 | |
| c31 | Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa: Learning Term Rewriting Systems from Entailment . ILP Work-in-progress reports 2000 | |
| c30 | 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 | |
| c29 | 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 | |
| c28 | Ryoichi Fujino, Hiroki Arimura, Setsuo Arikawa: Discovering Unordered and Ordered Phrase Association Patterns for Text Mining. PAKDD 2000: 281-293 | |
| c27 | Masahiro Hirao, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs. SPIRE 2000: 132-138 | |
| c26 | Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Online Construction of Subsequence Automata for Multiple Texts. SPIRE 2000: 146-152 | |
| c25 | Tetsuya Matsumoto, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: Bit-Parallel Approach to Approximate String Matching in Compressed Texts. SPIRE 2000: 221-228 | |
| e5 | Setsuo Arikawa, Shinichi Morishita (Eds.): Discovery Science, Third International Conference, DS 2000, Kyoto, Japan, December 4-6, 2000, Proceedings. Lecture Notes in Computer Science 1967, Springer 2000, isbn 3-540-41352-9 | |
| 1999 | ||
| j8 | 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) | |
| c24 | Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: Shift-And Approach to Pattern Matching in LZW Compressed Text. CPM 1999: 1-13 | |
| c23 | Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: Pattern Matching in Text Compressed by Using Antidictionaries. CPM 1999: 37-49 | |
| c22 | ||
| c21 | Takuya Kida, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: A Unifying Framework for Compressed Pattern Matching. SPIRE/CRIWG 1999: 89-96 | |
| e4 | Setsuo Arikawa, Koichi Furukawa (Eds.): Discovery Science, Second International Conference, DS '99, Tokyo, Japan, December, 1999, Proceedings. Lecture Notes in Computer Science 1721, Springer 1999, isbn 3-540-66713-X | |
| 1998 | ||
| c20 | Hiroki Arimura, Atsushi Wataki, Ryoichi Fujino, Setsuo Arikawa: A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases. ALT 1998: 247-261 | |
| c19 | Eiju Hirowatari, Setsuo Arikawa: A Comparison of Identification Criteria for Inductive Inference of Recursive Real-Valued Functions. ALT 1998: 262-275 | |
| c18 | Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Masamichi Miyazaki, Setsuo Arikawa: Multiple Pattern Matching in LZW Compressed Text. Data Compression Conference 1998: 103-112 | |
| c17 | Koichi Niijima, Hidemi Uchida, Eiju Hirowatari, Setsuo Arikawa: Discovery of Differential Equations from Numerical Data. Discovery Science 1998: 364-374 | |
| c16 | 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 | |
| e3 | Setsuo Arikawa, Hiroshi Motoda (Eds.): Discovery Science, First International Conference, DS '98, Fukuoka, Japan, December 14-16, 1998, Proceedings. Lecture Notes in Computer Science 1532, Springer 1998, isbn 3-540-65390-2 | |
| 1997 | ||
| j7 | Setsuo Arikawa, Michael M. Richter: Special Issue on Algorithmic Learning Theory. New Generation Comput. 15(1): 1-2 (1997) | |
| c15 | ||
| 1996 | ||
| e2 | Setsuo Arikawa, Arun Sharma (Eds.): Algorithmic Learning Theory, 7th International Workshop, ALT '96, Sydney, Australia, October 23-25, 1996, Proceedings. Lecture Notes in Computer Science 1160, Springer 1996, isbn 3-540-61863-5 | |
| 1995 | ||
| j6 | Yasuhito Mukouchi, Setsuo Arikawa: Towards a Mathematical Theory of Machine Discovery from Facts. Theor. Comput. Sci. 137(1): 53-84 (1995) | |
| c14 | ||
| c13 | 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-366 | |
| c12 | 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 | |
| 1994 | ||
| c11 | Yasuyuki Koga, Eiju Hirowatari, Setsuo Arikawa: Explanation-Based Reuse of Prolog Programs. AII/ALT 1994: 149-160 | |
| c10 | Eizyu Hirowatari, Setsuo Arikawa: Partially Isomorphic Generalization and Analogical Reasoning. ECML 1994: 363-366 | |
| e1 | Setsuo Arikawa, Klaus P. Jantke (Eds.): 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. Lecture Notes in Computer Science 872, Springer 1994, isbn 3-540-58520-6 | |
| 1993 | ||
| j5 | 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) | |
| c9 | Yasuhito Mukouchi, Setsuo Arikawa: Inductive Inference Machines That Can Refute Hypothesis Spaces. ALT 1993: 123-136 | |
| 1992 | ||
| j4 | Setsuo Arikawa, Takeshi Shinohara, Akihiro Yamamoto: Learning Elementary Formal Systems. Theor. Comput. Sci. 95(1): 97-113 (1992) | |
| c8 | 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 | |
| 1991 | ||
| j3 | Setsuo Arikawa: Introduction: Special Issue on Algorithmic Learning Theory. New Generation Comput. 8(4): 277-280 (1991) | |
| c7 | Setsuo Arikawa, Takeshi Shinohara, Satoru Miyano, Ayumi Shinohara: More About Learning Elementary Formal Systems. Nonmonotonic and Inductive Logic 1991: 107-117 | |
| 1989 | ||
| c6 | Setsuo Arikawa, Takeshi Shinohara, Akihiro Yamamoto: Elementary Formal System as a Unifying Framework for Language Learning. COLT 1989: 312-327 | |
| c5 | ||
| 1988 | ||
| c4 | Hiroko Yuasa, Setsuo Arikawa: Pseudo Extension in Default Reasoning and Belief Revision by Model Inference. LP 1988: 27-37 | |
| 1986 | ||
| c3 | Makoto Haraguchi, Setsuo Arikawa: Reasoning by Analogy as a Partial Identity Between Models. AII 1986: 61-87 | |
| c2 | Makoto Haraguchi, Setsuo Arikawa: A Foundation of Reasoning by Analogy: Analogical Union of Logic Programs. LP 1986: 58-69 | |
| 1985 | ||
| c1 | Setsuo Arikawa, Takeshi Shinohara: Efficient pattern matching algorithms and their applications to text information systems. RIAO 1985: 349-371 | |
| 1984 | ||
| j2 | Setsuo Arikawa, Takeshi Shinohara: A Run-Time Efficient Realization of Aho-Corasick Pattern Matching Machines. New Generation Comput. 2(2): 171-186 (1984) | |
| 1977 | ||
| j1 | Keisuke Tanatsugu, Setsuo Arikawa: On characteristic sets and degrees of finite automata. International Journal of Parallel Programming 6(1): 83-93 (1977) | |
Colors in the list of coauthors
Last update Fri May 24 04:46:59 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page