A New Sample Reduction Method for Decreasing the Running Time of the K-Nearest Neighbors Algorithm To Diagnose Patients With Congestive Heart Failure: Backward Iterative Elimination

Loading...
Publication Logo

Date

2023

Journal Title

Journal ISSN

Volume Title

Publisher

Springer India

Open Access Color

Green Open Access

No

OpenAIRE Downloads

OpenAIRE Views

Publicly Funded

No
Impulse
Top 10%
Influence
Average
Popularity
Top 10%

Research Projects

Journal Issue

Abstract

The model complexity is strictly connected to both the sample size and the number of features in a conventional pattern recognition study. Although there are some sample reduction methods in the literature, they cannot give the highest classifier performance or are not able to achieve the minimum number of samples in general. In this study, we offered a new sample reduction method, named Backward Iterative Elimination. To show its efficiency, we classified congestive heart failure (CHF) patients and healthy subjects from heart rate variability (HRV) features using the k-nearest neighbors (kNN) classifier. We extracted 59 HRV features (time and frequency domain measurements through power spectral density estimates of different transformation methods in addition to nonlinear measures calculated from Poincare plot, sample entropy, symbolic dynamics, and detrended fluctuation analysis) from databases provided by the Massachusetts Institute of Technology and Boston's Beth Israel Hospital. The extracted features were classified using kNN with various odd k values from 1 to 19. The proposed method was compared to three well-known reduction methods: Backward elimination, Gaussian elimination, and Genetic algorithm. The proposed system yielded the highest accuracy values for each k value. While the genetic algorithm achieved the maximum sample size reduction in general, the proposed method showed better sample size reduction performance than other backward elimination methods. The method resulted in a classifier accuracy of 87.95% with 33 samples only. In this case, the algorithm run time reduces to 9.1411 ms, which is 12.1578 ms using all samples. In conclusion, the Backward Iterative Elimination gives the highest classifier performances with an appropriate ratio in sample size reduction so that it can be utilized in pattern recognition studies as a good alternative.

Description

Keywords

Electrocardiogram (ECG), congestive heart failure (CHF), data reduction, genetic algorithm, k-nearest neighbors (kNN), Paroxysmal Atrial-Fibrillation, Selection Method, Rate-Variability, Hrv Indexes, Classification, Performance

Fields of Science

Citation

WoS Q

Q3

Scopus Q

Q1
OpenCitations Logo
OpenCitations Citation Count
4

Source

Sadhana-Academy Proceedings in Engineering Sciences

Volume

48

Issue

2

Start Page

End Page

PlumX Metrics
Citations

Scopus : 6

Captures

Mendeley Readers : 2

SCOPUS™ Citations

6

checked on Mar 17, 2026

Web of Science™ Citations

3

checked on Mar 17, 2026

Page Views

3

checked on Mar 17, 2026

Google Scholar Logo
Google Scholar™
OpenAlex Logo
OpenAlex FWCI
1.5662

Sustainable Development Goals

SDG data is not available