Publications:
All
- López, D.; Calera-Rubio, J.; Gallego-Sánchez, A.J.
"Inference of k-Testable Directed Acyclic Graph Languages" Journal of Machine Learning Research: Workshop and Conference Proceedings, Vol. 21: ICGI 2012, pp. 149-163
(2012)
: bibtex
: pdfAbstract: In this paper, we tackle the task of graph language learning. We first extend the well-known classes of k-testability and k-testability in the strict sense languages to directed graph languages. Second, we propose a graph automata model for directed acyclic graph languages. This graph automata model is used to propose a grammatical inference algorithm to learn the class of directed acyclic k-testable in the strict sense graph languages. The algorithm runs in polynomial time and identifies this class of languages from positive data.
@inproceedings {
author = "López, D.; Calera-Rubio, J.; Gallego-Sánchez, A.J.",
title = "Inference of k-Testable Directed Acyclic Graph Languages",
booktitle = "Journal of Machine Learning Research: Workshop and Conference Proceedings, Vol. 21: ICGI 2012",
pages = "149-163",
year = "2012"
}
|