scholarly journals Automated COVID-19 and Heart Failure Detection Using DNA Pattern Technique with Cough Sounds

Diagnostics ◽  
2021 ◽  
Vol 11 (11) ◽  
pp. 1962
Author(s):  
Mehmet Ali Kobat ◽  
Tarik Kivrak ◽  
Prabal Datta Barua ◽  
Turker Tuncer ◽  
Sengul Dogan ◽  
...  
Keyword(s):  
Heart Failure ◽  
Healthy Subjects ◽  
Nearest Neighbor ◽  
Diagnostic System ◽  
Failure Detection ◽  
K Nearest Neighbor ◽  
Proposed Model ◽  
Dna Pattern ◽  
Feature Selector ◽  
Neighbor Classifier

COVID-19 and heart failure (HF) are common disorders and although they share some similar symptoms, they require different treatments. Accurate diagnosis of these disorders is crucial for disease management, including patient isolation to curb infection spread of COVID-19. In this work, we aim to develop a computer-aided diagnostic system that can accurately differentiate these three classes (normal, COVID-19 and HF) using cough sounds. A novel handcrafted model was used to classify COVID-19 vs. healthy (Case 1), HF vs. healthy (Case 2) and COVID-19 vs. HF vs. healthy (Case 3) automatically using deoxyribonucleic acid (DNA) patterns. The model was developed using the cough sounds collected from 241 COVID-19 patients, 244 HF patients, and 247 healthy subjects using a hand phone. To the best our knowledge, this is the first work to automatically classify healthy subjects, HF and COVID-19 patients using cough sounds signals. Our proposed model comprises a graph-based local feature generator (DNA pattern), an iterative maximum relevance minimum redundancy (ImRMR) iterative feature selector, with classification using the k-nearest neighbor classifier. Our proposed model attained an accuracy of 100.0%, 99.38%, and 99.49% for Case 1, Case 2, and Case 3, respectively. The developed system is completely automated and economical, and can be utilized to accurately detect COVID-19 versus HF using cough sounds.

scholarly journals Computational Intelligence-Based Model for Mortality Rate Prediction in COVID-19 Patients

2021 ◽  
Vol 18 (12) ◽  
pp. 6429
Author(s):  
Irfan Ullah Khan ◽  
Nida Aslam ◽  
Malak Aljabri ◽  
Sumayh S. Aljameel ◽  
Mariam Moataz Aly Kamaleldin ◽  
...  
Keyword(s):  
Mortality Rate ◽  
Computational Intelligence ◽  
Nearest Neighbor ◽  
Gradient Boosting ◽  
K Nearest Neighbor ◽  
Detection And Identification ◽  
Proposed Model ◽  
Extreme Gradient Boosting ◽  
The World ◽  
Detection And Diagnosis

The COVID-19 outbreak is currently one of the biggest challenges facing countries around the world. Millions of people have lost their lives due to COVID-19. Therefore, the accurate early detection and identification of severe COVID-19 cases can reduce the mortality rate and the likelihood of further complications. Machine Learning (ML) and Deep Learning (DL) models have been shown to be effective in the detection and diagnosis of several diseases, including COVID-19. This study used ML algorithms, such as Decision Tree (DT), Logistic Regression (LR), Random Forest (RF), Extreme Gradient Boosting (XGBoost), and K-Nearest Neighbor (KNN) and DL model (containing six layers with ReLU and output layer with sigmoid activation), to predict the mortality rate in COVID-19 cases. Models were trained using confirmed COVID-19 patients from 146 countries. Comparative analysis was performed among ML and DL models using a reduced feature set. The best results were achieved using the proposed DL model, with an accuracy of 0.97. Experimental results reveal the significance of the proposed model over the baseline study in the literature with the reduced feature set.

scholarly journals Stronger Automation for Flyspeck by Feature Weighting and Strategy Evolution

10.29007/5gzr ◽  
2018 ◽  
Author(s):  
Cezary Kaliszyk ◽  
Josef Urban
Keyword(s):  
Nearest Neighbor ◽  
Feature Weighting ◽  
K Nearest Neighbor ◽  
Nearest Neighbor Classifier ◽  
Hol Light ◽  
Distance Weighted ◽  
Neighbor Classifier

Two complementary AI methods are used to improve the strength of the AI/ATP service for proving conjectures over the HOL Light and Flyspeck corpora. First, several schemes for frequency-based feature weighting are explored in combination with distance-weighted k-nearest-neighbor classifier. This results in 16% improvement (39.0% to 45.5% Flyspeck problems solved) of the overall strength of the service when using 14 CPUs and 30 seconds. The best premise-selection/ATP combination is improved from 24.2% to 31.4%, i.e. by 30%. A smaller improvement is obtained by evolving targetted E prover strategies on two particular premise selections, using the Blind Strategymaker (BliStr) system. This raises the performance of the best AI/ATP method from 31.4% to 34.9%, i.e. by 11%, and raises the current 14-CPU power of the service to 46.9%.

scholarly journals A patient distance metric for neurology

2020 ◽  
Author(s):  
Daniel B Hier ◽  
Jonathan Kopel ◽  
Steven U Brint ◽  
Donald C Wunsch II ◽  
Gayla R Olbricht ◽  
...  
Keyword(s):  
Nearest Neighbor ◽  
Signs And Symptoms ◽  
Diagnostic Error ◽  
K Nearest Neighbor ◽  
Bipartite Matching ◽  
Nearest Neighbor Classifier ◽  
Neurological Signs ◽  
Neurological Patients ◽  
Machine Readable ◽  
Neighbor Classifier

Abstract Objective: Neurologists lack a metric for measuring the distance between neurological patients. When neurological signs and symptoms are represented as neurological concepts from a hierarchical ontology and neurological patients are represented as sets of concepts, distances between patients can be represented as inter-set distances.Methods:We converted the neurological signs and symptoms from 721 published neurology cases into sets of concepts with corresponding machine-readable codes. We calculated inter-concept distances based a hierarchical ontology and we calculated inter-patient distances by semantic weighted bipartite matching. We evaluated the accuracy of a k-nearest neighbor classifier to allocate patients into 40 diagnostic classes.Results:Within a given diagnosis, mean patient distance differed by diagnosis, suggesting that across diagnoses there are differences in how similar patients are to other patients with the same diagnosis. The mean distance from one diagnosis to another diagnosis differed by diagnosis, suggesting that diagnoses differ in their proximity to other diagnoses. Utilizing a k-nearest neighbor classifier and inter-patient distances, the risk of misclassification differed by diagnosis.Conclusion:If signs and symptoms are converted to machine-readable codes and patients are represented as sets of these codes, patient distances can be computed as an inter-set distance. These patient distances given insights into how homogeneous patients are within a diagnosis (stereotypy), the distance between different diagnoses (proximity), and the risk of diagnosis misclassification (diagnostic error).

scholarly journals Pengenalan Wajah Menggunakan Metode Linear Discriminant Analysis dan k Nearest Neighbor

2017 ◽  
Vol 9 (1) ◽  
pp. 1-9
Author(s):  
Fandiansyah Fandiansyah ◽  
Jayanti Yusmah Sari ◽  
Ika Putri Ningrum
Keyword(s):  
Feature Extraction ◽  
Face Recognition ◽  
Discriminant Analysis ◽  
Linear Discriminant Analysis ◽  
Nearest Neighbor ◽  
Experimental Result ◽  
K Nearest Neighbor ◽  
Linear Discriminant ◽  
Nearest Neighbor Classifier ◽  
Neighbor Classifier

Face recognition is one of the biometric system that mostly used for individual recognition in the absent machine or access control. This is because the face is the most visible part of human anatomy and serves as the first distinguishing factor of a human being. Feature extraction and classification are the key to face recognition, as they are to any pattern classification task. In this paper, we describe a face recognition method based on Linear Discriminant Analysis (LDA) and k-Nearest Neighbor classifier. LDA used for feature extraction, which directly extracts the proper features from image matrices with the objective of maximizing between-class variations and minimizing within-class variations. The features of a testing image will be compared to the features of database image using K-Nearest Neighbor classifier. The experiments in this paper are performed by using using 66 face images of 22 different people. The experimental result shows that the recognition accuracy is up to 98.33%. Index Terms—face recognition, k nearest neighbor, linear discriminant analysis.

Sign in / Sign up

Export Citation Format

Share Document