Takayoshi Shoudai

According to our database1, Takayoshi Shoudai authored at least 62 papers between 1989 and 2020.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
An Efficient Learning Algorithm for Regular Pattern Languages Using One Positive Example and a Linear Number of Membership Queries.
IEICE Trans. Inf. Syst., 2020

2019
Exact Learning of Primitive Formal Systems Defining Labeled Ordered Tree Languages via Queries.
IEICE Trans. Inf. Syst., 2019

2018
Polynomial Time Learnability of Graph Pattern Languages Defined by Cographs.
IEICE Trans. Inf. Syst., 2018

An Efficient Pattern Matching Algorithm for Unordered Term Tree Patterns of Bounded Dimension.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

2017
A Polynomial Time Pattern Matching Algorithm on Graph Patterns of Bounded Treewidth.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

Polynomial Time Inductive Inference of Languages of Ordered Term Tree Patterns with Height-Constrained Variables from Positive Data.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

Learning of Primitive Formal Systems Defining Labelled Ordered Tree Languages via Queries.
Proceedings of the Late Breaking Papers of the 27th International Conference on Inductive Logic Programming, 2017

2016
Distributional Learning of Regular Formal Graph System of Bounded Degree.
Proceedings of the Inductive Logic Programming - 26th International Conference, 2016

2015
An Efficient Pattern Matching Algorithm for Ordered Term Tree Patterns.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

2014
Polynomial Time Mat Learning of C-deterministic Regular Formal Graph Systems.
Proceedings of the IIAI 3rd International Congress on Advanced Applied Informatics, 2014

2013
Structure-based Data Mining and Screening for Network Traffic Data.
Proceedings of the 2013 Second IIAI International Conference on Advanced Applied Informatics, 2013

Hardness of Learning Unordered Tree Contraction Patterns.
Proceedings of the 2013 Second IIAI International Conference on Advanced Applied Informatics, 2013

2012
Learning Unordered Tree Contraction Patterns in Polynomial Time.
Proceedings of the Inductive Logic Programming - 22nd International Conference, 2012

2011
Efficient Pattern Matching on Graph Patterns of Bounded Treewidth.
Electron. Notes Discret. Math., 2011

Polynomial Time Inductive Inference of Cograph Pattern Languages from Positive Data.
Proceedings of the Inductive Logic Programming - 21st International Conference, 2011

Graph Contraction Pattern Matching for Graphs of Bounded Treewidth.
Proceedings of the Latest Advances in Inductive Logic Programming, 2011

2009
Learning block-preserving graph patterns and its application to data mining.
Mach. Learn., 2009

A Polynomial Time Algorithm for Finding a Minimally Generalized Linear Interval Graph Pattern.
IEICE Trans. Inf. Syst., 2009

Polynomial Time Inductive Inference of TTSP Graph Languages from Positive Data.
IEICE Trans. Inf. Syst., 2009

2008
Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries.
IEICE Trans. Inf. Syst., 2008

Learning Block-Preserving Outerplanar Graph Patterns and Its Application to Data Mining.
Proceedings of the Inductive Logic Programming, 18th International Conference, 2008

Mining of Frequent Externally Extensible Outerplanar Graph Patterns.
Proceedings of the Seventh International Conference on Machine Learning and Applications, 2008

2007
A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns.
Proceedings of the Theory and Applications of Models of Computation, 2007

Mining of Frequent Block Preserving Outerplanar Graph Structured Patterns.
Proceedings of the Inductive Logic Programming, 17th International Conference, 2007

Exact Learning of Finite Unions of Graph Patterns from Queries.
Proceedings of the Algorithmic Learning Theory, 18th International Conference, 2007

2006
Ordered term tree languages which are polynomial time inductively inferable from positive data.
Theor. Comput. Sci., 2006

2005
Discovery of Maximally Frequent Tag Tree Patterns with Height-Constrained Variables from Semistructured Web Documents.
Proceedings of the 2005 International Workshop on Challenges in Web Information Retrieval and Integration (WIRI 2005), 2005

Polynomial Time Inductive Inference of TTSP Graph Languages from Positive Data.
Proceedings of the Inductive Logic Programming, 15th International Conference, 2005

A Polynomial Time Matching Algorithm of Ordered Tree Patterns Having Height-Constrained Variables.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

2004
Polynomial Time Inductive Inference of Ordered Tree Languages with Height-Constrained Variables from Positive Data.
Proceedings of the PRICAI 2004: Trends in Artificial Intelligence, 2004

Discovery of Maximally Frequent Tag Tree Patterns with Contractible Variables from Semistructured Documents.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2004

Automatic Wrapper Generation for Metasearch Using Ordered Tree Structured Patterns.
Proceedings of the AI 2004: Advances in Artificial Intelligence, 2004

Learning of Ordered Tree Languages with Height-Bounded Variables Using Queries.
Proceedings of the Algorithmic Learning Theory, 15th International Conference, 2004

2003
Extraction of Tag Tree Patterns with Contractible Variables from Irregular Semistructured Data.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2003

Finding Frequent Subgraphs from Graph Structured Data with Geometric Information and Its Application to Lossless Compression.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2003

An Effective Grammar-Based Compression Algorithm for Tree Structured Data.
Proceedings of the Inductive Logic Programming: 13th International Conference, 2003

Efficient Learning of Unlabeled Term Trees with Contractible Variables from Positive Data.
Proceedings of the Inductive Logic Programming: 13th International Conference, 2003

Efficient Learning of Ordered and Unordered Tree Patterns with Contractible Variables.
Proceedings of the Algorithmic Learning Theory, 14th International Conference, 2003

Learning of Finite Unions of Tree Patterns with Repeated Internal Structured Variables from Queries.
Proceedings of the Algorithmic Learning Theory, 14th International Conference, 2003

2002
Discovery of Frequent Tag Tree Patterns in Semistructured Web Documents.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2002

Extracting Characteristic Structures among Words in Semistructured Documents.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2002

A Polynomial Time Matching Algorithm of Structured Ordered Tree Patterns for Data Mining from Semistructured Data.
Proceedings of the Inductive Logic Programming, 12th International Conference, 2002

A Support for Navigation Path Planning with Adaptive Previewing for Web-Based Learning.
Proceedings of the International Conference on Computers in Education, 2002

Toward Drawing an Atlas of Hypothesis Classes: Approximating a Hypothesis via Another Hypothesis Model.
Proceedings of the Discovery Science, 5th International Conference, 2002

Polynomial Time Inductive Inference of Ordered Tree Patterns with Internal Structured Variables from Positive Data.
Proceedings of the Computational Learning Theory, 2002

Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries.
Proceedings of the AI 2002: Advances in Artificial Intelligence, 2002

2001
Discovery of Frequent Tree Structured Patterns in Semistructured Web Documents.
Proceedings of the Knowledge Discovery and Data Mining, 2001

Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

Learning Conformation Rules.
Proceedings of the Discovery Science, 4th International Conference, DS 2001, Washington, 2001

2000
Automatic Exercise Generator with Tagged Documents Considering Lerner's Performance.
Proceedings of WebNet 2000 - World Conference on the WWW and Internet, San Antonio, Texas, USA, October 30, 2000

Polynomial Time Matching Algorithms for Tree-Like Structured Patterns in Knowledge Discovery.
Proceedings of the Knowledge Discovery and Data Mining, 2000

A New Framework for Discovering Knowledge from Two-Dimensional Structured Data Using Layout Formal Graph System.
Proceedings of the Algorithmic Learning Theory, 11th International Conference, 2000

1999
Discovering New Knowledge from Graph Data Using Inductive Logic Programming.
Proceedings of the Inductive Logic Programming, 9th International Workshop, 1999

Inductive Inference of Regular Term Free Languages and Its Application to Knowledge Discovery.
Proceedings of the Information Modelling and Knowledge Bases XI: 9th European-Japanese Conferences on Information Modelling and Knowledge Bases, 1999

1998
Toward Genomic Hypothesis Creator: View Designer for Discovery.
Proceedings of the Discovery Science, 1998

1997
Polynomial Time Inductive Inference of Regular Term Tree Languages from Positive Data.
Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997

1995
Using Maximal Independent Sets to Solve Problems in Parallel.
Theor. Comput. Sci., 1995

Parallel Algorithms for Refutation Tree Problem on Formal Graph Systems.
IEICE Trans. Inf. Syst., 1995

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

1992
A P-Complete Language Describable with Iterated Shuffle.
Inf. Process. Lett., 1992

1991
Using Maximal Independent Sets to Solve Problems in Parallel.
Proceedings of the 17th International Workshop, 1991

1989
The Lexicographically First Topological Order Problem is NLOG-Complete.
Inf. Process. Lett., 1989


  Loading...