Pattern Classification In Symbolic Streams via Semantic Annihilation of Information

Details Pattern Classification In Symbolic Streams via Semantic Annihilation of Information Pattern Classification In Symbolic Streams via Semantic Annihilation of Information

2010-08-21

arxiv.org/abs/1008.3667v1

Computer Science

Symbolic Computation

15 pages, 7 figures (Under Review Elsewhere: Journal Reference Will Be Provided When Available )

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Pattern Classification In Symbolic Streams via Semantic Annihilation of Information does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Pattern Classification In Symbolic Streams via Semantic Annihilation of Information, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pattern Classification In Symbolic Streams via Semantic Annihilation of Information will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-165687