Emergent Induction of Deterministic Context-Free L-system Grammar
L-system is a bio-inspired computational model to capture growth process of plants. This paper proposes a new noise-tolerant grammatical induction LGIC2 for deterministic context-free L-systems. LGIC2 induces L-system grammars from a transmuted string mY, employing an emergent approach in order to enforce its noise tolerance. In the method, frequently appearing substrings are extracted from mY to form grammar candidates. A grammar candidate is used to generate a string Z; however, the number of grammar candidates gets huge, meaning enormous computational cost. Thus, how to prune grammar candidates is vital here. We introduce a couple of techniques such as pruning by frequency, pruning by goodness of fit, and pruning by contractive embedding. Finally, several candidates having the strongest similarities between mY and Z are selected as the final solutions. Our experiments using insertion-type transmutation showed that LGIC2 worked very nicely, much better than an enumerative method LGIC1.
KeywordsL-system plant modeling knowledge discovery grammatical induction noise tolerance
Unable to display preview. Download preview PDF.
- 1.Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms. MIT Press (1990)Google Scholar
- 4.Hjaltason, G.R., Samet, H.: Contractive embedding methods for similarity searching in metric spaces. Technical Report CS-TR-4102, Univ. of Maryland (2000)Google Scholar
- 6.McCormack, J.: Interactive evolution of L-system grammars for computer graphics modelling. In: Complex Systems: From Biology to Computation, pp. 118–130. ISO Press, Amsterdam (1993)Google Scholar
- 7.Nakano, R.: Error correction of enumerative induction of deterministic context-free L-system grammar. IAENG Int. Journal of Computer Science 40(1), 47–52 (2013)Google Scholar
- 8.Nakano, R., Suzumura, S.: Grammatical induction with error correction for deterministic context-free L-systems. In: Proc. of the World Congress on Engineering and Computer Science 2012 (WCECS 2012), pp. 534–538 (2012)Google Scholar
- 9.Nakano, R., Yamada, N.: Number theory-based induction of deterministic context-free L-system grammar. In: Proc. Int. Joint Conf. on Knowledge Discovery, Knowledge Engineering and Knowledge Management 2010, pp. 194–199 (2010)Google Scholar
- 10.Nevill-Manning, C.G.: Inferring sequential structure. Technical Report Doctoral Thesis, Univ. of Waikato (1996)Google Scholar
- 13.Schlecht, J., Barnard, K., Springgs, E., Pryor, B.: Inferring grammar-based structure models from 3d microscopy data. In: Proc. of IEEE Conference on Computer Vision and Pattern Recognition, pp. 1–8 (2007)Google Scholar