Fast computation of approximate entropy
| dc.contributor.author | Manis, G. | en |
| dc.date.accessioned | 2015-11-24T17:01:50Z | |
| dc.date.available | 2015-11-24T17:01:50Z | |
| dc.identifier.issn | 0169-2607 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10985 | |
| dc.rights | Default Licence | - |
| dc.subject | approximate entropy | en |
| dc.subject | apen | en |
| dc.subject | fast algorithm | en |
| dc.subject | heart-rate dynamics | en |
| dc.subject | complexity | en |
| dc.title | Fast computation of approximate entropy | en |
| heal.abstract | The approximate entropy (ApEn) is a measure of systems complexity. The implementation of the method is computationally expensive and requires execution time analogous to the square of the size of the input signal. We propose here a fast algorithm which speeds up the computation of approximate entropy by detecting early some vectors that are not similar and by excluding them from the similarity test. Experimental analysis with various biomedical signals revealed a significant improvement in execution times. (C) 2008 Elsevier Ireland Ltd. All rights reserved. | en |
| heal.access | campus | - |
| heal.fullTextAvailability | TRUE | - |
| heal.identifier.primary | DOI 10.1016/j.cmpb.2008.02.008 | - |
| heal.journalName | Comput Methods Programs Biomed | en |
| heal.journalType | peer reviewed | - |
| heal.language | en | - |
| heal.publicationDate | 2008 | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.type | journalArticle | - |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.type.en | Journal article | en |
Αρχεία
Φάκελος/Πακέτο αδειών
1 - 1 of 1
Φόρτωση...
- Ονομα:
- license.txt
- Μέγεθος:
- 1.74 KB
- Μορφότυπο:
- Item-specific license agreed upon to submission
- Περιγραφή: