Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets

Authors:
Yuuichi Kameda;Hiroo Tokunaga;Akihiro Yamamoto
Affiliations:
Department of Mathematics and Information Sciences Graduate School of Science and Engineering, Tokyo Metropolitan University, Hachioji-shi, Japan 192-0397;Department of Mathematics and Information Sciences Graduate School of Science and Engineering, Tokyo Metropolitan University, Hachioji-shi, Japan 192-0397;Graduate School of Informatics, Kyoto University Yoshida Honmachi, Sakyo-ku, Kyoto, Japan 606-850
Venue:
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Year:
2008

Citing 8
Cited 1

Unification revisited

Foundations of deductive databases and logic programming
Identification of unions of languages drawn from an identifiable class

COLT '89 Proceedings of the second annual workshop on Computational learning theory
On uniform learnability of language families

Information Processing Letters
Learning algebraic structures from text

Theoretical Computer Science - Algorithmic learning theory
Mathematics Based on Learning

ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
A Polynomial Time Algorithm for Finding Finite Unions of Tree Pattern Languages

Proceedings of the Second International Workshop on Nonmonotonic and Inductive Logic
Inferability of closed set systems from positive data

JSAI'06 Proceedings of the 20th annual conference on New frontiers in artificial intelligence
Computing characteristic sets of bounded unions of polynomial ideals

JSAI'07 Proceedings of the 2007 conference on New frontiers in artificial intelligence

Inferability of unbounded unions of certain closed set systems

JSAI-isAI'09 Proceedings of the 2009 international conference on New frontiers in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study a learning procedure from positive data for bounded unions of certain class of languages. Our key tools are the notion of characteristic sets and hypergraphs. We generate hypergraphs from given positive data and exploit them in order to find characteristic sets.