Pattern Classification In Symbolic Streams via Semantic Annihilation of Information
From MaRDI portal
Publication:6220315
arXiv1008.3667MaRDI QIDQ6220315
Author name not available (Why is that?)
Publication date: 21 August 2010
Abstract: We propose a technique for pattern classification in symbolic streams via selective erasure of observed symbols, in cases where the patterns of interest are represented as Probabilistic Finite State Automata (PFSA). We define an additive abelian group for a slightly restricted subset of probabilistic finite state automata (PFSA), and the group sum is used to formulate pattern-specific semantic annihilators. The annihilators attempt to identify pre-specified patterns via removal of essentially all inter-symbol correlations from observed sequences, thereby turning them into symbolic white noise. Thus a perfect annihilation corresponds to a perfect pattern match. This approach of classification via information annihilation is shown to be strictly advantageous, with theoretical guarantees, for a large class of PFSA models. The results are supported by simulation experiments.
This page was built for publication: Pattern Classification In Symbolic Streams via Semantic Annihilation of Information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6220315)