Classification automaton and its construction using learning

Authors:
Wang Xiangrui;Narendra S. Chaudhari
Affiliations:
School of Computer Engineering, Nanyang Technological University, Singapore;School of Computer Engineering, Nanyang Technological University, Singapore
Venue:
AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
Year:
2003

Citing 4
Cited 1

Efficiency of a Good But Not Linear Set Union Algorithm

Journal of the ACM (JACM)
Inference of Reversible Languages

Journal of the ACM (JACM)
Learning Structure from Sequences, with Applications in a Digital Library

ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)

Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)

Minimizing state transition model for multiclassification by mixed-integer programming

MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.