Identification of unions of languages drawn from an identifiable class
COLT '89 Proceedings of the second annual workshop on Computational learning theory
The correct definition of finite elasticity: corrigendum to identification of unions
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
A note on language classes with finite elasticity
A note on language classes with finite elasticity
Mining Graph Data
| Hi-index | 0.00 |
Within the data mining community there has been a lot of interest in mining and learning from graphs (see [1] for a recent overview). Most work in this area has has focussed on finding algorithms that help solve real-world problems. Although useful and interesting results have been obtained, more fundamental issues like learnability properties have hardly been adressed yet. This kind of work also tends not to be grounded in graph grammar theory, even though some approaches aim at inducing grammars from collections of graphs.