Abstract
A method of regular grammar inference in computational learning for classification problems is presented. We classify the strings by generating multiple subclasses. A construction algorithm is presented for the classification automata from positive classified examples. We prove the correctness of the algorithm, and suggest some possible extensions.
Cite
CITATION STYLE
APA
Xiangrui, W., & Chaudhari, N. S. (2003). Classification automaton and its construction using learning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2671, pp. 515–519). Springer Verlag. https://doi.org/10.1007/3-540-44886-1_43
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free