Results 1  10
of
254,554
On the Fragmentary Complexity of Symbolic Sequences
, 1994
"... A measure of the ability of a symbolic sequence to be coded by initial fragments of another symbolic sequence is introduced and its basic properties are investigated. Applications to the characterization of symbolic sequences associated with shift mappings on a torus corresponding to a special parti ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
A measure of the ability of a symbolic sequence to be coded by initial fragments of another symbolic sequence is introduced and its basic properties are investigated. Applications to the characterization of symbolic sequences associated with shift mappings on a torus corresponding to a special
Symbolic Sequences and Tsallis Entropy
"... We address this work to investigate symbolic sequences with longrange correlations by using computational simulation. We analyze sequences with two, three and four symbols that could be repeated l times, with the probability distribution p(l) ∝ 1/l µ . For these sequences, we verified that the usu ..."
Abstract
 Add to MetaCart
We address this work to investigate symbolic sequences with longrange correlations by using computational simulation. We analyze sequences with two, three and four symbols that could be repeated l times, with the probability distribution p(l) ∝ 1/l µ . For these sequences, we verified
Anomaly Detection for Symbolic Sequences . . .
, 2009
"... This thesis deals with the problem of anomaly detection for sequence data. Anomaly detection has been a widely researched problem in several application domains such as system health management, intrusion detection, healthcare, bioinformatics, fraud detection, and mechanical fault detection. Traditi ..."
Abstract
 Add to MetaCart
by traditional anomaly detection techniques. The problem of anomaly detection for sequence data is a rich area of research because of two main reasons. First, sequences can be of different types, e.g., symbolic sequences, time series data, etc., and each type of sequence poses unique set of problems. Second
Processing and recognition of symbol sequences
 Stenning, eds, ‘Proceedings of the Twenty Third Annual Conference of the Cognitive Science Society
, 2001
"... It is proposed that learning a language (or more generally, a sequence of symbols) is formally equivalent to reconstructing the statespace of a nonlinear dynamical system. Given this, a set of results from the study of nonlinear dynamical systems may be especially relevant for an understanding of ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
It is proposed that learning a language (or more generally, a sequence of symbols) is formally equivalent to reconstructing the statespace of a nonlinear dynamical system. Given this, a set of results from the study of nonlinear dynamical systems may be especially relevant for an understanding
SYMMETRY STUDIES OF SYMBOLIC SEQUENCES
"... Dataanalytic interpretations for the canonical projections (or decomposition) theorem for finite groups are illustrated in the study of data indexed by dihedral permutations of three and four symbols. The purpose of this paper is to apply and develop the methodology of symmetry studies to the analy ..."
Abstract
 Add to MetaCart
Dataanalytic interpretations for the canonical projections (or decomposition) theorem for finite groups are illustrated in the study of data indexed by dihedral permutations of three and four symbols. The purpose of this paper is to apply and develop the methodology of symmetry studies
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 578 (50 self)
 Add to MetaCart
in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space. For this purpose, we introduce a calculus on computation trees over realnumbered time. Unfortunately
Information Theory and Statistics
, 1968
"... Entropy and relative entropy are proposed as features extracted from symbol sequences. Firstly, a proper Iterated Function System is driven by the sequence, producing a fractaMike representation (CSR) with a low computational cost. Then, two entropic measures are applied to the CSR histogram of th ..."
Abstract

Cited by 1805 (2 self)
 Add to MetaCart
Entropy and relative entropy are proposed as features extracted from symbol sequences. Firstly, a proper Iterated Function System is driven by the sequence, producing a fractaMike representation (CSR) with a low computational cost. Then, two entropic measures are applied to the CSR histogram
Analysis of symbolic sequences using the JensenShannon divergence
 Article ID 041905
"... We study statistical properties of the JensenShannon divergence D, which quantifies the difference between probability distributions, and which has been widely applied to analyses of symbolic sequences. We present three interpretations of D in the framework of statistical physics, information theo ..."
Abstract

Cited by 56 (2 self)
 Add to MetaCart
We study statistical properties of the JensenShannon divergence D, which quantifies the difference between probability distributions, and which has been widely applied to analyses of symbolic sequences. We present three interpretations of D in the framework of statistical physics, information
Frequency Estimation of Partitioned Reference Symbol Sequences
, 2001
"... The performance of Maximum Likelihood (ML) frequency estimators for bursts containing consecutive reference symbol sequences is shown to improve if the reference symbol sequences are partitioned into two or more equal length parts. The reduction in RMS error of the estimators is directly proportiona ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
The performance of Maximum Likelihood (ML) frequency estimators for bursts containing consecutive reference symbol sequences is shown to improve if the reference symbol sequences are partitioned into two or more equal length parts. The reduction in RMS error of the estimators is directly
LIKELIHOODBASED ESTIMATION OF PERIODICITIES IN SYMBOLIC SEQUENCES
"... In this work, we propose a method of estimating periodicities in symbolic sequences, allowing for arbitrary, finite, symbol sets. Different from other common approaches, that often map the symbolic sequence to a numerical representation, we here exploit a likelihoodbased formulation to represent ..."
Abstract
 Add to MetaCart
In this work, we propose a method of estimating periodicities in symbolic sequences, allowing for arbitrary, finite, symbol sets. Different from other common approaches, that often map the symbolic sequence to a numerical representation, we here exploit a likelihoodbased formulation
Results 1  10
of
254,554