Nagaraj, Nithin and Balasubramanian, Karthi and Dey, S (2013) A new complexity measure for time series analysis and classification. European Physical Journal - Special Topics, 222. pp. 847-860. ISSN 1951-6355
![[img]](http://eprints.nias.res.in/style/images/fileicons/application_pdf.png) |
PDF
2013-nithin-EPJ.pdf - Published Version Restricted to Registered users only Download (252kB) | Request a copy |
| Contribution | Name |
|---|
| Abstract: | Complexity measures are used in a number of applications such as extraction of information from data such as ecological time series, detection of non-random structure in biomedical signals, testing of random number generators, language recognition and authorship attribution etc. Different complexity measures proposed in the literature like Shannon entropy, Relative entropy, Lempel-Ziv, Kolmogrov and Algorithmic complexity are mostly ineffective in analyzing short sequences that are further corrupted with noise. To address this problem, we propose a new complexity measure ETC and define it as the “Effort To Compress |
|---|---|
| Item Type: | Journal Paper |
| Subjects: | School of Natural and Engineering Sciences > Mathematical Modeling |
| Divisions: | Schools > Natural Sciences and Engineering |
| Date Deposited: | 11 Nov 2013 05:50 |
| Last Modified: | 25 Aug 2023 05:11 |
| Official URL: | http://epjst.epj.org/ |
| Related URLs: | |
| Funders: | * |
| Projects: | * |
| DOI: | 10.1140/epjst/e2013-01888-9 |
| URI: | http://eprints.nias.res.in/id/eprint/398 |
Actions (login required)
 |
View Item |
