基于信息语义消除的符号流模式分类
Pattern Classification In Symbolic Streams via Semantic Annihilation of Information
摘要:
我们提出了一种技术,通过选择性擦除观察到的符号在符号流中的模式分类,在这种情况下,感兴趣的模式表示为概率有限状态自动机(PFSA)。我们定义了一个加性阿贝尔群的概率有限状态自动机(PFSA)的一个略有限制的子集,和组和用于制定特定模式的语义零化子。零化器试图通过从观察到的序列中去除基本上所有的符号间相关性来识别预先指定的模式,从而将它们变成符号白噪声。因此,完美的湮灭对应于完美的模式匹配。这种方法的分类,通过信息湮灭被证明是严格有利的,理论上的保证,一个大类的PFSA模型。仿真实验验证了该方法的有效性。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。