Grammar-based classifier system: A universal tool for grammatical inference

WSEAS Transactions on Computers

Volumn 7, Issue 10, 2008, Pages 1584-1593

  Unold, Olgierd ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

DFA induction; Grammatical inference; Learning classifier systems; Machine learning; Natural language processing; Promoter recognition; Regular language induction

Indexed keywords

CLASSIFIERS; COMPUTATIONAL GRAMMARS; COMPUTATIONAL LINGUISTICS; CONTEXT FREE GRAMMARS; EDUCATION; FORMAL LANGUAGES; LEARNING SYSTEMS; LINGUISTICS; MODEL STRUCTURES; NUCLEIC ACIDS; ORGANIC ACIDS; QUERY LANGUAGES; ROBOT LEARNING;

DFA INDUCTION; GRAMMATICAL INFERENCE; LEARNING CLASSIFIER SYSTEMS; MACHINE LEARNING; NATURAL LANGUAGE PROCESSING; PROMOTER RECOGNITION; REGULAR LANGUAGE INDUCTION;

NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 59249095920     PISSN: 11092750     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (65)

1. Angeline P.: Evolutionary Algorithms and Emergent Intelligence. PhD Thesis. Computer Science Department, Ohio State University (1994)
2. Angeline P.: An alternative to indexed memory for evolving programs with explicit state representations. In: Koza J.R. et al (eds.) Proc. 2nd Conf. Genetic Programming (GP97). Morgan Kaufmann, San Francisco, CA, 423-430 (1997)
3. Angeline P., Saunders G.M., Pollack J.P.: All Evolutionary Algorithm that Constructs Recurrent Neural Networks. IEEE Trans. Neural Networks, vol. 5, no. 1, 54-65 (1994)
4. Angluin D.: A note on the number of queries needed to identify regular languages, Information and Control, 51, 76-87 (1981)
5. Angluin D.: Queries and concept learning. Machine Learning 2(4), 319-342 (1988)
6. Aycinena M., Kochenderfer M.J., Mulford D.C.: An evolutionary approach to natural language grammar induction. Final project for CS224N: Natural Language Processing. Stanford University (2003) http:// homepages.inf.ed.ac.uk/s0341074/docs/aycinenakochenderfer mulford-2003-cs224n.pdf
7. Bianchi D.: Learning Grammatical Rules from Examples Using a Credit Assignment Algorithm. In: Proc. of The First Online Workshop on Soft Computing (WSCI), 113-118. Nagoya (1996)
8. Blattner F., Plunkett G., Bloch C., Perna N., Burland V., Riley M., Collado-Vides J., Glasner J., Rode C., Mayhew G. et al. (eds.) The complete genome sequence of Escherichia coli k-12. Science 277, 1453-1462 (1997)
9. Bongard J., Lipson H.: Active Coevolutionary Learning of Deterministic Finite Automata, J. of Machine Learning Research, 6, 1651-1678 (2005)
10. Cicchello O., Kremer S.C.: Beyond EDSM. In: Proc. Int'l Colloquium Grammatical Inference, vol. 2484, 37-48 (2002)
11. Collado-Vides J.: Grammatical model of the regulation of gene expression. In: Proc. Natl Acad. Sci. USA, 89, 9405-9409 (1992)
12. Cyre W.R.: Learning Grammars with a Modified Classifier System. In: Proc. 2002 World Congress on Computational Intelligence, 1366-1371. Honolulu, Hawaii (2002)
13. Dupont P.: Incremental regular inference. In: Miclet L., de la Higuera C. (eds.) Proc. 3rd ICGI-96, LNAI, vol. 1147, 222-237. Springer (1996)
14. Dupont P., Miclet L., Vidal E.: What Is the Search Space of the Regular Inference? In: Carrasco R.C., Oncina J. (eds.) Proc. Grammatical Inference and Applications: Second Int'l Colloquium (ICGI-94), 25-37 (1994)
15. Durbin R., Eddy S., Krogh A., Mitchison G.: Biological Sequence Analysis. Cambridge University Press, Cambridge (1998)
16. Giles C., Sun G., Chen H., Lee Y., Chen D.: Higher order Recurrent Neural Networks and Grammatical Inference. In: Touretzky D. (ed.) Advances in Neural Information Processing Systems 2, 380-387. San Mateo, Calif: Morgan Kaufman (1990)
17. Gold E.: Language identification in the limit. Information Control 10, 447-474 (1967)
18. Hamdi-Cherif C., Hamdi-Cherif A.: ILSGInf - An Inductive Learning System for Grammatical Inference, WSEAS Trans. on Computers, 7(6), 991-996 (2007)
19. de la Higuera C.: Current trends in grammatical inference. In: Ferri F.J. et al (eds.) Advances in Pattern Recognition. Joint IAPR International Workshops. SSPR+SPR'2000, LNCS, vol. 1876, 28-31. Springer (2000)
20. Holland J.: Adaptation. In: Rosen R., Snell F.M. (eds.) Progress in theoretical biology. Plenum, New York (1976)
21. Holland J.: Escaping Brittleness: The possibilities of General-Purpose Learning Algorithms Applied to Parallel Rule-Based Systems. In: Michalski R.S. et al. (eds.) Machine Learning, an Artificial Intelligence Approach, vol. II, 593-623. Morgan Kaufmann (1986)
22. Holmes J.H., Lanzi P.L., Stolzmann W., Wilson S.W.: Learning classifier systems: new models, successful applications. Information Processing Letters 82(1), 23-30 (2002)
23. Hopcroft J.E. Ullman J.D.: Formal Languages And Their Relation to Automata. Reading, Mass.: Addison-Wesley (1969)
24. Hopcroft J.E. Ullman J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)
25. Judd K.L., Tesfatsion L.: Agent-Based Computational Economics. Handbook of Computational Economics, vol. 2, Elsevier, North-Holland (2005)
26. Katagami D., Yamada S.: Real robot learning with human teaching. In The Fourth Japan-Australia Joint Workshop on Intelligent and Evolutionary Systems, 263-270 (2000)
27. Katagami D., Yamada S.: Interactive Classifier System for Real Robot Learning. In: IEEE International Workshop on Robot-Human Interaction ROMAN-2000, Osaka, Japan, 258-263 (2000)
28. Lang K., Pearlmutter B., Price R.: Results of the Abbadingo One DFA Learning Competition and a New Evidence Driven State Merging Algorithm. In: Proc. Int. Colloquium on Grammatical Inference ICGA-98, LNAI, vol. 1433, Springer, Berlin, Heidelberg, 1-12 (1998)
29. Lanzi P.L., Riolo R.L.: A Roadmap to the Last Decade of Learning Classifier System Research. In: LNAI, vol. 1813, 33-62. Springer Verlag (2000)
30. Lee L., Learning of Context-Free Languages: A Survey of the Literature. Report TR-12-96, Harvard University, Cambridge, Massachusetts (1996)
31. Leung S.W., Mellish C., Robertson D.: Basic gene grammars and DNA-chart parser for language processing of Escherichia coli promoter DNA sequences. Bioinformatics 17, 226-236 (2001)
32. Lewin B.: Genes VH. Oxford University Press, Oxford (2000)
33. Lucas S., Reynolds T.J.: Learning Deterministic Finite Automata with a Smart State labeling Evolutionary Algorithm. IEEE Trans. on Pattern Analysis and Machine Intelligence, 27 (7-), 1-12 (2005)
34. Luke S., Hamahashi S., Kitano H.: 'Genetic' Programming". In: Banzhaf W. et al. (eds.) Proc. Genetic and Evolutionary Computation Conf., 1098-1105 (1999)
35. Mishra R., Chatterji D.: Promoter search and strength of a promoter: two important means for regulation of gene expression in Escherichia coli. J. Biosci. 18 1-11 (1993)
36. Murphy P.M., Aha D.W.: UCI Repository of Machine Learning Databases. Department of Information and Computer Science, University of California at Irvine, Irvine, CA (1992)
37. Oncina J., Garcià P.: Inferring regular languages in polynomial update time. In: Perez N. et al. (eds.) Pattern recognition and image analysis. Singapore, World Scientific, 49-61 (1992)
38. O'Neill M.: Escherichia coli promoters: neural networks develop distinct descriptions in learning to search for promoters of different spacing classes. Nucleic Acids Res. 20, 3471-3477 (1992)
39. Pao T., Carr J.: A solution of the syntactic induction-inference problem for regular languages. Computer Languages, 3, 53-64 (1978)
40. Parekh R.G., Honavar V.G.: An incremental interactive approach for regular grammar inference. In: Proc, 3rd ICGI-96, LNAI, vol. 1147, Springer, Berlin, Heidelberg, 238-250 (1996)
41. Pereira F., Warren D.: Definite clause grammars for language analysis. Artif. Intell, 13, 231-278 (1980)
42. Pitt L.: Inductive inference, DFAs and computational complexity. In: Proc. Int. Workshop on Analogical and Inductive Inference, LNAI, vol. 397, Springer, London, UK, 18-44 (1989)
43. Pitt L., Warmuth M.: The Minimum Consistent DFA Problem Cannot Be Approximated within Any Polynomial. J. ACM, vol. 40, no. 1, 95-142 (1993)
44. Porat F., Feldman J.: Learning automata from ordered examples. Machine Learning, 7, 109-138 (1991)
45. Rice P., Elliston K., Gribskov M.: DNA. In: Girbskov M., Devereux J. (eds.) Sequence Analysis Primer. Chapter 1, Stockton Press, 1-59 (1991)
46. Rosenblueth D., Thieffry D., Huerta A., Salgado H., Collado-Vides J.: Syntactic recognition of regulatory regions in Escherichia coli. Comput. Appl. Biosci. 12, 415-422 (1996)
47. Sakakibara Y,: Grammatical Inference in Bioinformatics. IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 27 (7), 1051-1062 (2005)
48. Searls D.: Linguistic approaches to biological sequences. Bioinformatics 13, 333-344 (1997)
49. Shavlik J., Towell G., Noordewier M.: Using neural networks to refine existing biological knowledge. Int. J. Genome Res. 1, 81-107 (1992)
50. Solan Z., Horn D., Ruppin E., Edelman S.: Unsupervised learning of natural languages. In: Proc. Nat. Acad. Science. US, 102, 11629-11634, (2005)
51. Sonego P., Kocsor A., Pongor S.: ROC analysis: applications to the classification of biological sequences and 3D structures. Briefings in Bioinformatics, doi:10.1093/bib/bbm064 (2008)
52. Stolzmann W.: An Introduction to Anticipatory Classifier Systems. In: LNAI, vol. 1813, 175-194. Springer-Verlag (2000)
53. Tomita M.: Dynamic construction of finite automata from examples using hill climbing. In: Proc. 4th Annual Cognitive Science Conf., USA, 105-108 (1982)
54. Towell G., Shavlik J.: Extracting refined rules from knowledge-based neural networks. Machine Learning 13, 71-101 (1993)
55. Unold O.: Context-free grammar induction using evolutionary methods, WSEAS Trans. on Circuits and Systems, 3(2), 632-637 (2003)
56. Unold O.: Context-free grammar induction with grammar-based classifier system. Archives of Control Science, vol. 15 (LI) 4, 681-690 (2005)
57. Unold O.: Playing a toy-grammar with GCS. In: Mira J, acAlvarez J.R. (eds.) IWINAC 2005. LNCS, vol. 3562, 300-309. Springer Verlag (2005)
58. Unold O.: Learning classifier system approach to natural language grammar induction. In: Shi Y. et al. (eds.) ICCS 2007, Part II, LNCS, vol. 4488, 1210-1213 (2007)
59. Unold O.: Grammar-based classifier system for recognition of promoter regions. In: Beliczynski B. et al. (eds.) ICANNGA07, Part I, LNCS, vol. 4431, 798-805 (2007)
60. Unold O., Cielecki L.: Grammar-based Classifier System. In: Hryniewicz O. et al. (eds.) Issues in Intelligent Systems: Paradigms. EXIT Publishing House, Warsaw, 273-286 (2005)
61. Unold O., Dabrowski G.: Use of learning classifier system for inferring natural language grammar. In: Abraham A et al. (eds.) Design and application of hybrid intelligent. Amsterdam, IOS Press, 272-278 (2003)
62. Waltrous R., Kuhn G.: Induction of finite state automata using second-order recurrent networks. In: Moody J. et al. (eds.) Advances in Neural Information Processing 4. Morgan Kaufmann, San Francisco, CA, 309-316 (1992)
63. Wilson S.W.: Classifier Fitness Based on Accuracy. Evolutionary Computation 3 (2), 147-175 (1995)
64. Yoshikawa M., Kihira T., Terai H.: Q-learning based on hierarchical evolutionary mechanism, WSEAS Trans. on Systems and Control, 3(3), 219-228 (2008)
65. Younger D.: Recognition and parsing of context-free languages in time n3. University of Hawaii Technical Report, Department of Computer Science (1967)