Unsupervised symbolization of signal time series for extraction of the embedded information

Yue Li, Asok Ray

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

This paper formulates an unsupervised algorithm for symbolization of signal time series to capture the embedded dynamic behavior. The key idea is to convert time series of the digital signal into a string of (spatially discrete) symbols from which the embedded dynamic information can be extracted in an unsupervised manner (i.e., no requirement for labeling of time series). The main challenges here are: (1) definition of the symbol assignment for the time series; (2) identification of the partitioning segment locations in the signal space of time series; and (3) construction of probabilistic finite-state automata (PFSA) from the symbol strings that contain temporal patterns. The reported work addresses these challenges by maximizing the mutual information measures between symbol strings and PFSA states. The proposed symbolization method has been validated by numerical simulation as well as by experimentation in a laboratory environment. Performance of the proposed algorithm has been compared to that of two commonly used algorithms of time series partitioning.

Original languageEnglish (US)
Article number148
JournalEntropy
Volume19
Issue number4
DOIs
StatePublished - Jan 1 2017

Fingerprint

time signals
strings
experimentation
marking
requirements
simulation

All Science Journal Classification (ASJC) codes

  • Physics and Astronomy(all)

Cite this

@article{d2a0e861498d4403ab5900029c056c40,
title = "Unsupervised symbolization of signal time series for extraction of the embedded information",
abstract = "This paper formulates an unsupervised algorithm for symbolization of signal time series to capture the embedded dynamic behavior. The key idea is to convert time series of the digital signal into a string of (spatially discrete) symbols from which the embedded dynamic information can be extracted in an unsupervised manner (i.e., no requirement for labeling of time series). The main challenges here are: (1) definition of the symbol assignment for the time series; (2) identification of the partitioning segment locations in the signal space of time series; and (3) construction of probabilistic finite-state automata (PFSA) from the symbol strings that contain temporal patterns. The reported work addresses these challenges by maximizing the mutual information measures between symbol strings and PFSA states. The proposed symbolization method has been validated by numerical simulation as well as by experimentation in a laboratory environment. Performance of the proposed algorithm has been compared to that of two commonly used algorithms of time series partitioning.",
author = "Yue Li and Asok Ray",
year = "2017",
month = "1",
day = "1",
doi = "10.3390/e19040148",
language = "English (US)",
volume = "19",
journal = "Entropy",
issn = "1099-4300",
publisher = "Multidisciplinary Digital Publishing Institute (MDPI)",
number = "4",

}

Unsupervised symbolization of signal time series for extraction of the embedded information. / Li, Yue; Ray, Asok.

In: Entropy, Vol. 19, No. 4, 148, 01.01.2017.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Unsupervised symbolization of signal time series for extraction of the embedded information

AU - Li, Yue

AU - Ray, Asok

PY - 2017/1/1

Y1 - 2017/1/1

N2 - This paper formulates an unsupervised algorithm for symbolization of signal time series to capture the embedded dynamic behavior. The key idea is to convert time series of the digital signal into a string of (spatially discrete) symbols from which the embedded dynamic information can be extracted in an unsupervised manner (i.e., no requirement for labeling of time series). The main challenges here are: (1) definition of the symbol assignment for the time series; (2) identification of the partitioning segment locations in the signal space of time series; and (3) construction of probabilistic finite-state automata (PFSA) from the symbol strings that contain temporal patterns. The reported work addresses these challenges by maximizing the mutual information measures between symbol strings and PFSA states. The proposed symbolization method has been validated by numerical simulation as well as by experimentation in a laboratory environment. Performance of the proposed algorithm has been compared to that of two commonly used algorithms of time series partitioning.

AB - This paper formulates an unsupervised algorithm for symbolization of signal time series to capture the embedded dynamic behavior. The key idea is to convert time series of the digital signal into a string of (spatially discrete) symbols from which the embedded dynamic information can be extracted in an unsupervised manner (i.e., no requirement for labeling of time series). The main challenges here are: (1) definition of the symbol assignment for the time series; (2) identification of the partitioning segment locations in the signal space of time series; and (3) construction of probabilistic finite-state automata (PFSA) from the symbol strings that contain temporal patterns. The reported work addresses these challenges by maximizing the mutual information measures between symbol strings and PFSA states. The proposed symbolization method has been validated by numerical simulation as well as by experimentation in a laboratory environment. Performance of the proposed algorithm has been compared to that of two commonly used algorithms of time series partitioning.

UR - http://www.scopus.com/inward/record.url?scp=85016752573&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85016752573&partnerID=8YFLogxK

U2 - 10.3390/e19040148

DO - 10.3390/e19040148

M3 - Article

AN - SCOPUS:85016752573

VL - 19

JO - Entropy

JF - Entropy

SN - 1099-4300

IS - 4

M1 - 148

ER -