2002
DOI: 10.1186/1472-6947-2-1
|View full text |Cite
|
Sign up to set email alerts
|

Prediction models in the design of neural network based ECG classifiers: A neural network and genetic programming approach

Abstract: Background: Classification of the electrocardiogram using Neural Networks has become a widely used method in recent years. The efficiency of these classifiers depends upon a number of factors including network training. Unfortunately, there is a shortage of evidence available to enable specific design choices to be made and as a consequence, many designs are made on the basis of trial and error. In this study we develop prediction models to indicate the point at which training should stop for Neural Network ba… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2005
2005
2017
2017

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 19 publications
(8 citation statements)
references
References 8 publications
0
8
0
Order By: Relevance
“…Time frequency transformation is not necessary. The discrete wavelet transform DWT-PNN [3][4][5][6][7][8][9][10][11][12][13][14][15][16][17] can give similar performance but the optimization of the classification time has to be confirmed. In our case, our program implemented in Matlab7.10, takes 15 s for one hour of Holter recording.…”
Section: Classmentioning
confidence: 99%
See 1 more Smart Citation
“…Time frequency transformation is not necessary. The discrete wavelet transform DWT-PNN [3][4][5][6][7][8][9][10][11][12][13][14][15][16][17] can give similar performance but the optimization of the classification time has to be confirmed. In our case, our program implemented in Matlab7.10, takes 15 s for one hour of Holter recording.…”
Section: Classmentioning
confidence: 99%
“…The optimization of B m1 is the minimization of the mean square error J between the initial heartbeat S 1 and the first function B m1 with respect to the standard deviation σ m1 , the temporal position µ m1 and the amplitude A m1 E 1 (k)= S(k) at the first iteration Optimization was performed by Projected Gradient algorithm [7].This is an algorithm of minimization of first order applied to the cases of optimization under constraints [10].This optimization has the advantage of being fast because it takes into account only three parameters: A m1 , σ m1 , µ m1 of the Gaussian selected.…”
Section: 13mentioning
confidence: 99%
“…This test assumes that there is information in the magnitudes of the differences between paired observations, as well as the signs. It is a very popular statistical test used by researchers to prove the significance of the experimental results [33,34]. Next, we briefly describe the method.…”
Section: The Wilcoxon Test Of Statistical Significancementioning
confidence: 99%
“…Here it can be seen that the performance of the train curve continues to increase throughout the process whereas the curve representing the test data reaches a maximum performance at approximately 500 epochs, after this the performance decreases significantly. By employing the early stopping method of training, a network can be trained to a point of maximum generalization based on a validation set and thus over-fitting is avoided [8]. Although this method is proven and effective, computational requirements are increased.…”
Section: Zntroductionmentioning
confidence: 98%
“…It is possible however to asses the NN at various stages of training by 'employing the early stopping method of training' [8]. This approach requires two sets of data, a training set and a test set.…”
Section: Zntroductionmentioning
confidence: 99%