Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Cook, D.J., Holder, L.B. (eds.): Mining Graph Data. John Wiley & Sons, Chichester (2006)
Gold, E.M.: Language identification in the limit. Information and Control 10, 447–474 (1967)
Wright, K.: Identification of unions of languages drawn from an identifiable class. In: The 1989 Workshop on Computational Learning Theory, pp. 328–333. Morgan Kaufmann, San Mateo (1989)
Motoki, T., Shinohara, T., Wright, K.: The correct definition of finite elasticity: Corrigendum to identification of unions. In: The Fourth Workshop on Computational Learning Theory. Morgan Kaufmann, San Mateo (1991)
Kanazawa, M.: A note on language classes with finite elasticity. Technical Report CS-R9471, CWI, Amsterdam (1994)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Costa Florêncio, C. (2008). Learning Node Label Controlled Graph Grammars (Extended Abstract). In: Clark, A., Coste, F., Miclet, L. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2008. Lecture Notes in Computer Science(), vol 5278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88009-7_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-88009-7_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88008-0
Online ISBN: 978-3-540-88009-7
eBook Packages: Computer ScienceComputer Science (R0)