Please use this identifier to cite or link to this item: https://olympias.lib.uoi.gr/jspui/handle/123456789/10985
Full metadata record
DC FieldValueLanguage
dc.contributor.authorManis, G.en
dc.date.accessioned2015-11-24T17:01:50Z-
dc.date.available2015-11-24T17:01:50Z-
dc.identifier.issn0169-2607-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/10985-
dc.rightsDefault Licence-
dc.subjectapproximate entropyen
dc.subjectapenen
dc.subjectfast algorithmen
dc.subjectheart-rate dynamicsen
dc.subjectcomplexityen
dc.titleFast computation of approximate entropyen
heal.typejournalArticle-
heal.type.enJournal articleen
heal.type.elΆρθρο Περιοδικούel
heal.identifier.primaryDOI 10.1016/j.cmpb.2008.02.008-
heal.languageen-
heal.accesscampus-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικήςel
heal.publicationDate2008-
heal.abstractThe 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.journalNameComput Methods Programs Biomeden
heal.journalTypepeer reviewed-
heal.fullTextAvailabilityTRUE-
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά)

Files in This Item:
File Description SizeFormat 
Manis-2008-Fast computation of.pdf731.02 kBAdobe PDFView/Open    Request a copy


This item is licensed under a Creative Commons License Creative Commons