A novel encoding Lempel–Ziv complexity algorithm for quantifying the irregularity of physiological time series. Issue 133 (September 2016)
- Record Type:
- Journal Article
- Title:
- A novel encoding Lempel–Ziv complexity algorithm for quantifying the irregularity of physiological time series. Issue 133 (September 2016)
- Main Title:
- A novel encoding Lempel–Ziv complexity algorithm for quantifying the irregularity of physiological time series
- Authors:
- Zhang, Yatao
Wei, Shoushui
Liu, Hai
Zhao, Lina
Liu, Chengyu - Abstract:
- Highlights: A novel variant of LZ complexity based on encoding coarse-grain process (ELZ) is proposed. The ELZ not only reflects details of sequence but also avoids excessive quantification levels. The ELZ complexity can better discern between randomness and chaos character of sequence. The ELZ is more sensitive for data mutation than other variants of LZ complexity. The ELZ are much more stable than other variants of LZ complexity. Abstract: Background and objective: The Lempel–Ziv (LZ) complexity and its variants have been extensively used to analyze the irregularity of physiological time series. To date, these measures cannot explicitly discern between the irregularity and the chaotic characteristics of physiological time series. Our study compared the performance of an encoding LZ (ELZ) complexity algorithm, a novel variant of the LZ complexity algorithm, with those of the classic LZ (CLZ) and multistate LZ (MLZ) complexity algorithms. Methods and results: Simulation experiments on Gaussian noise, logistic chaotic, and periodic time series showed that only the ELZ algorithm monotonically declined with the reduction in irregularity in time series, whereas the CLZ and MLZ approaches yielded overlapped values for chaotic time series and time series mixed with Gaussian noise, demonstrating the accuracy of the proposed ELZ algorithm in capturing the irregularity, rather than the complexity, of physiological time series. In addition, the effect of sequence length on the ELZHighlights: A novel variant of LZ complexity based on encoding coarse-grain process (ELZ) is proposed. The ELZ not only reflects details of sequence but also avoids excessive quantification levels. The ELZ complexity can better discern between randomness and chaos character of sequence. The ELZ is more sensitive for data mutation than other variants of LZ complexity. The ELZ are much more stable than other variants of LZ complexity. Abstract: Background and objective: The Lempel–Ziv (LZ) complexity and its variants have been extensively used to analyze the irregularity of physiological time series. To date, these measures cannot explicitly discern between the irregularity and the chaotic characteristics of physiological time series. Our study compared the performance of an encoding LZ (ELZ) complexity algorithm, a novel variant of the LZ complexity algorithm, with those of the classic LZ (CLZ) and multistate LZ (MLZ) complexity algorithms. Methods and results: Simulation experiments on Gaussian noise, logistic chaotic, and periodic time series showed that only the ELZ algorithm monotonically declined with the reduction in irregularity in time series, whereas the CLZ and MLZ approaches yielded overlapped values for chaotic time series and time series mixed with Gaussian noise, demonstrating the accuracy of the proposed ELZ algorithm in capturing the irregularity, rather than the complexity, of physiological time series. In addition, the effect of sequence length on the ELZ algorithm was more stable compared with those on CLZ and MLZ, especially when the sequence length was longer than 300. A sensitivity analysis for all three LZ algorithms revealed that both the MLZ and the ELZ algorithms could respond to the change in time sequences, whereas the CLZ approach could not. Cardiac interbeat (RR) interval time series from the MIT-BIH database were also evaluated, and the results showed that the ELZ algorithm could accurately measure the inherent irregularity of the RR interval time series, as indicated by lower LZ values yielded from a congestive heart failure group versus those yielded from a normal sinus rhythm group ( p < 0.01). … (more)
- Is Part Of:
- Computer methods and programs in biomedicine. Issue 133(2016)
- Journal:
- Computer methods and programs in biomedicine
- Issue:
- Issue 133(2016)
- Issue Display:
- Volume 133, Issue 133 (2016)
- Year:
- 2016
- Volume:
- 133
- Issue:
- 133
- Issue Sort Value:
- 2016-0133-0133-0000
- Page Start:
- 7
- Page End:
- 15
- Publication Date:
- 2016-09
- Subjects:
- Lempel–Ziv complexity -- Encoding LZ complexity -- Coarse-graining process -- Physiological time series
Medicine -- Computer programs -- Periodicals
Biology -- Computer programs -- Periodicals
Computers -- Periodicals
Medicine -- Periodicals
Médecine -- Logiciels -- Périodiques
Biologie -- Logiciels -- Périodiques
Biology -- Computer programs
Medicine -- Computer programs
Periodicals
Electronic journals
610.28 - Journal URLs:
- http://www.sciencedirect.com/science/journal/01692607 ↗
http://www.elsevier.com/journals ↗ - DOI:
- 10.1016/j.cmpb.2016.05.010 ↗
- Languages:
- English
- ISSNs:
- 0169-2607
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 3394.095000
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 2327.xml