Masako Sato

According to our database1, Masako Sato authored at least 17 papers between 1982 and 2006.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2006
Learning of erasing primitive formal systems from positive examples.
Theor. Comput. Sci., 2006

2005
Semantic Analysis of Association Rules via Item Response Theory.
Proceedings of the Machine Learning and Data Mining in Pattern Recognition, 2005

2004
Mining Indirect Association Rules.
Proceedings of the Advances in Data Mining, 2004

Learning Languages Generated by Elementary Formal Systems and Its Application to SH Languages.
Proceedings of the Algorithmic Learning Theory, 15th International Conference, 2004

2003
Refutable language learning with a neighbor system.
Theor. Comput. Sci., 2003

2002
Refutable/Inductive Learning from Neighbor Examples and Its Application to Decision Trees over Patterns.
Proceedings of the Progress in Discovery Science, 2002

Compactness and Learning of Classes of Unions of Erasing Regular Pattern Languages.
Proceedings of the Algorithmic Learning Theory, 13th International Conference, 2002

2000
Language Learning with a Neighbor System.
Proceedings of the Discovery Science, 2000

1998
Generalization of discriminant analysis for possibility distributions.
Proceedings of the Knowledge-Based Intelligent Electronic Systems, 1998

Inferring a Rewriting System from Examples.
Proceedings of the Discovery Science, 1998

Characteristic Sets for Unions of Regular Pattern Languages and Compactness.
Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998

1995
Properties of Language Classes with Finite Elasticity.
IEICE Trans. Inf. Syst., 1995

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

1991
Inductive inferability for formal languages from positive data.
Proceedings of the Algorithmic Learning Theory, 2nd International Workshop, 1991

1983
The number of minimal lattice paths restricted by two parallel lines.
Discret. Math., 1983

Note on the number of minimal lattice paths restricted by two parallel lines.
Discret. Math., 1983

1982
One-dimensional random walk with unequal step lengths restricted by an absorbing barrier.
Discret. Math., 1982


  Loading...