Setsuo Arikawa

Affiliations:
  • Kyushu University, Japan


According to our database1, Setsuo Arikawa authored at least 73 papers between 1977 and 2005.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2005
On-line construction of compact directed acyclic word graphs.
Discret. Appl. Math., 2005

2004
Compact directed acyclic word graphs for a sliding window.
J. Discrete Algorithms, 2004

Efficient Substructure Discovery from Large Semi-Structured Data.
IEICE Trans. Inf. Syst., 2004

Efficient Algorithms for Finding Frequent Substructures from Semi-structured Data Streams.
Proceedings of the New Frontiers in Artificial Intelligence - JSAI 2003 and JSAI 2004 Conferences and Workshops, Niigata, Japan, June 23-27, 2003 and Kanazawa, Japan, May 31, 2004

2003
Collage system: a unifying framework for compressed pattern matching.
Theor. Comput. Sci., 2003

A practical algorithm to find the best subsequence patterns.
Theor. Comput. Sci., 2003

Preface.
Theor. Comput. Sci., 2003

A Note on Randomized Algorithm for String Matching with Mismatches.
Nord. J. Comput., 2003

Discovering Most Classificatory Patterns for Very Expressive Pattern Classes.
Proceedings of the Discovery Science, 6th International Conference, 2003

2002
Processing Text Files as Is: Pattern Matching over Compressed Texts, Multi-byte Character Texts, and Semi-structured Texts.
Proceedings of the String Processing and Information Retrieval, 2002

Optimized Substructure Discovery for Semi-structured Data.
Proceedings of the Principles of Data Mining and Knowledge Discovery, 2002

Space-Economical Construction of Index Structures for All Suffixes of a String.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

Online Algorithms for Mining Semi-structured Data Stream.
Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), 2002

Finding Best Patterns Practically.
Proceedings of the Progress in Discovery Science, 2002

Knowledge Discovery from Semistructured Texts.
Proceedings of the Progress in Discovery Science, 2002

Efficient Data Mining from Large Text Databases.
Proceedings of the Progress in Discovery Science, 2002

Discovering Best Variable-Length-Don't-Care Patterns.
Proceedings of the Discovery Science, 5th International Conference, 2002

The Minimum DAWG for All Suffixes of a String and Its Applications.
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

2001
A comparison of identification criteria for inductive inference of recursive real-valued functions.
Theor. Comput. Sci., 2001

Construction of the CDAWG for a Trie.
Proceedings of the Prague Stringology Conference 2001, Prague, Czech Republic, 2001

On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs.
Proceedings of the Eighth International Symposium on String Processing and Information Retrieval, 2001

Extracting Partial Structures from HTML Documents.
Proceedings of the Fourteenth International Florida Artificial Intelligence Research Society Conference, 2001

Mining Semi-structured Data by Path Expressions.
Proceedings of the Discovery Science, 4th International Conference, DS 2001, Washington, 2001

A Practical Algorithm to Find the Best Episode Patterns.
Proceedings of the Discovery Science, 4th International Conference, DS 2001, Washington, 2001

The Discovery Science Project in Japan.
Proceedings of the Discovery Science, 4th International Conference, DS 2001, Washington, 2001

Faster Approximate String Matching over Compressed Text.
Proceedings of the Data Compression Conference, 2001

Compressed Pattern Matching for SEQUITUR.
Proceedings of the Data Compression Conference, 2001

Multiple Pattern Matching Algorithms on Collage System.
Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications.
Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

Efficient Discovery of Proximity Patterns with Suffix Arrays.
Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

Efficient Learning of Semi-structured Data from Queries.
Proceedings of the Algorithmic Learning Theory, 12th International Conference, 2001

2000
Efficient Discovery of Optimal Word-Association Patterns in Large Text Databases.
New Gener. Comput., 2000

Special Feature on Discovery Science.
New Gener. Comput., 2000

Bit-Parallel Approach to Approximate String Matching in Compressed Texts.
Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

Online Construction of Subsequence Automata for Multiple Texts.
Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs.
Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

Discovering Unordered and Ordered Phrase Association Patterns for Text Mining.
Proceedings of the Knowledge Discovery and Data Mining, 2000

Putting Old Data into New System: Web-Based Catalog Card Image Searching.
Proceedings of the 2000 Kyoto International Conference on Digital Libraries: Research and Practice, 2000

Text Data Mining: Discovery of Important Keywords in the Cyberspace.
Proceedings of the 2000 Kyoto International Conference on Digital Libraries: Research and Practice, 2000

Learning Term Rewriting Systems from Entailment .
Proceedings of the Inductive Logic Programming, 10th International Conference, 2000

Identification of Tree Translation Rules from Examples.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2000

A Boyer-Moore Type Algorithm for Compressed Pattern Matching.
Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

Speeding Up Pattern Matching by Text Compression.
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999
On the Inductive Inference of Recursive Real-Valued Functions.
Theor. Comput. Sci., 1999

A Unifying Framework for Compressed Pattern Matching.
Proceedings of the Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, 1999

A Road to Discovery Science (Abstract).
Proceedings of the New Directions in Rough Sets, 1999

Pattern Matching in Text Compressed by Using Antidictionaries.
Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

Shift-And Approach to Pattern Matching in LZW Compressed Text.
Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

1998
Discovery of Differential Equations from Numerical Data.
Proceedings of the Discovery Science, 1998

An Efficient Tool for Discovering Simple Combinatorial Patterns from Large Text Databases.
Proceedings of the Discovery Science, 1998

Multiple Pattern Matching in LZW Compressed Text.
Proceedings of the Data Compression Conference, 1998

A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases.
Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998

1997
Special Issue on Algorithmic Learning Theory.
New Gener. Comput., 1997

Inferability of Recursive Real-Valued Functions.
Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997

1995
Towards a Mathematical Theory of Machine Discovery from Facts.
Theor. Comput. Sci., 1995

Developments in Computational Learning and Discovery Theory within the Framework of Elementary Formal Systems.
Proceedings of the Machine Intelligence 15, 1995

BONSAI Garden: Parallel Knowledge Discovery System for Amino Acid Sequences.
Proceedings of the Third International Conference on Intelligent Systems for Molecular Biology, 1995

Pattern Inference.
Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

1994
Partially Isomorphic Generalization and Analogical Reasoning.
Proceedings of the Machine Learning: ECML-94, 1994

Explanation-Based Reuse of Prolog Programs.
Proceedings of the Algorithmic Learning Theory, 1994

1993
A Machine Discovery from Amino Acid Sequences by Decision Trees over Regular Patterns.
New Gener. Comput., 1993

Inductive Inference Machines That Can Refute Hypothesis Spaces.
Proceedings of the Algorithmic Learning Theory, 4th International Workshop, 1993

1992
Learning Elementary Formal Systems.
Theor. Comput. Sci., 1992

1991
Introduction: Special Issue on Algorithmic Learning Theory.
New Gener. Comput., 1991

More About Learning Elementary Formal Systems.
Proceedings of the Nonmonotonic and Inductive Logic, 1991

1989
Time-Bounded Reasoning in First Order Knowledge Base Systems.
Proceedings of the Logic Programming '89, 1989

Elementary Formal System as a Unifying Framework for Language Learning.
Proceedings of the Second Annual Workshop on Computational Learning Theory, 1989

1988
Pseudo Extension in Default Reasoning and Belief Revision by Model Inference.
Proceedings of the Logic Programming '88, 1988

1986
A Foundation of Reasoning by Analogy: Analogical Union of Logic Programs.
Proceedings of the Logic Programming '86, 1986

Reasoning by Analogy as a Partial Identity Between Models.
Proceedings of the Analogical and Inductive Inference, 1986

1985
Efficient pattern matching algorithms and their applications to text information systems.
Proceedings of the Computer-Assisted Information Retrieval (Recherche d'Information et ses Applications), 1985

1984
A Run-Time Efficient Realization of Aho-Corasick Pattern Matching Machines.
New Gener. Comput., 1984

1977
On characteristic sets and degrees of finite automata.
Int. J. Parallel Program., 1977


  Loading...