Unsupervised inductive learning in symbolic sequences via Recursive Identification of Self-Similar Semantics
Ishanu Chattopadhyay, Yicheng Wen, Asok Kumar Ray, Shashi Phoha · 2011
This paper presents a new pattern discovery algorithm for constructing probabilistic finite state automata (PFSA) from symbolic sequences. The new algorithm, described as Compression via Recursive Identification of Self-Similar Semantics (CRISSiS), makes use of synchronizing strings for PFSA to localize particular states and then recursively identifies the rest of the states by computing the n-step derived frequencies. We compare our algorithm to other existing algorithms, such as D-Markov and Casual-State Splitting Reconstruction (CSSR) and show both theoretically and experimentally that our algorithm captures a larger class of models.