scholarly journals Detection of Ventricular Fibrillation Using the Image from Time-Frequency Representation and Combined Classifiers without Feature Extraction

2018 ◽  
Vol 8 (11) ◽  
pp. 2057 ◽  
Author(s):  
Azeddine Mjahad ◽  
Alfredo Rosado-Muñoz ◽  
Juan Guerrero-Martínez ◽  
Manuel Bataller-Mompeán ◽  
Jose Francés-Villora ◽  
...  
Keyword(s):  
Feature Extraction ◽  
Ventricular Fibrillation ◽  
Real Time ◽  
Nearest Neighbor ◽  
Diagnostic System ◽  
Image Data ◽  
K Nearest Neighbor ◽  
Time Frequency ◽  
Hierarchical Method ◽  
Frequency Representation

Due the fact that the required therapy to treat Ventricular Fibrillation (V F) is aggressive (electric shock), the lack of a proper detection and recovering therapy could cause serious injuries to the patient or trigger a ventricular fibrillation, or even death. This work describes the development of an automatic diagnostic system for the detection of the occurrence of V F in real time by means of the time-frequency representation (T F R) image of the ECG. The main novelties are the use of the T F R image as input for a classification process, as well as the use of combined classifiers. The feature extraction stage is eliminated and, together with the use of specialized binary classifiers, this method improves the results of the classification. To verify the validity of the method, four different classifiers in different combinations are used: Regression Logistic with L2 Regularization (L 2 R L R), adaptive neural network (A N N C), Bagging (B A G G), and K-nearest neighbor (K N N). The Hierarchical Method (HM) and Voting Majority Method (VMM) combinations are used. ECG signals used for evaluation were obtained from the standard MIT-BIH and AHA databases. When the classifiers were combined, it was observed that the combination of B A G G , K N N , and A N N C using the Hierarchical Method (HM) gave the best results, with a sensitivity of 95.58 ± 0.41%, a 99.31 ± 0.08% specificity, a 98.6 ± 0.04% of overall accuracy, and a precision of 98.25 ± 0.29% for V F . Whereas a sensitivity of 94.02 ± 0.58%, a specificity of 99.31 ± 0.08%, an overall accuracy of 99.14 ± 0.43%, and a precision of 98.59 ± 0.09% was obtained for V T with a run time between 0.07 s and 0.12 s. Results show that the use of T F R image data to feed the combined classifiers yields a reduction in execution time with performance values above to those obtained by individual classifiers. This is of special utility for V F detection in real time.

scholarly journals K-nearest neighbor and naïve Bayes based diagnostic analytic of harmonic source identification

2021 ◽  
Vol 9 (6) ◽  
pp. 2650-2657
Author(s):  
Mohd Hatta Jopri ◽  
Mohd Ruddin Ab Ghani ◽  
Abdul Rahim Abdullah ◽  
Mustafa Manap ◽  
Tole Sutikno ◽  
...  
Keyword(s):  
Nearest Neighbor ◽  
Naive Bayes ◽  
Single Point ◽  
Naïve Bayes ◽  
K Nearest Neighbor ◽  
Time Frequency ◽  
System A ◽  
Frequency Representation ◽  
S Transform ◽  
Harmonic Source

This paper proposes a comparison of machine learning (ML) algorithm known as the k-nearest neighbor (KNN) and naïve Bayes (NB) in identifying and diagnosing the harmonic sources in the power system. A single-point measurement is applied in this proposed method, and using the S-transform the measurement signals are analyzed and extracted into voltage and current parameters. The voltage and current features that estimated from time-frequency representation (TFR) of S-transform analysis are used as the input for MLs. Four significant cases of harmonic source location are considered, whereas harmonic voltage (HV) and harmonic current (HC) source type-load are used in the diagnosing process. To identify the best ML, the performance measurement of the proposed method including the accuracy, precision, specificity, sensitivity, and F-measure are calculated. The sufficiency of the proposed methodology is tested and verified on IEEE 4-bust test feeder and each ML algorithm is executed for 10 times due to prevent any overfitting result.

scholarly journals SEGMENTASI PASAR KOPI MENGGUNAKAN METODE KNN DI INDONESIA

2020 ◽  
Vol 1 (1) ◽  
pp. 34-38
Author(s):  
Muhamad Maksum Hidayat ◽  
Wahyu Nugroho ◽  
Arief Setyanto
Keyword(s):  
Feature Extraction ◽  
Market Segmentation ◽  
Nearest Neighbor ◽  
Image Data ◽  
Market Development ◽  
K Nearest Neighbor ◽  
K Nearest Neighbor Algorithm ◽  
Coffee Market ◽  
The Right ◽  
Histogram Feature

Coffee is one of the most widely consumed plantation commodities in Indonesia and has great opportunities to be developed, especially in the field of market development. The thing that becomes an obstacle for coffee entrepreneurs is the right segmentation of the coffee market with the vast Indonesian state. This study aims to segment the coffee market in Indonesia by utilizing coffee image data available on Instagram social media with image classification using the K-Nearest Neighbor algorithm and histogram feature extraction, so as to determine the exact coffee market segmentation in Indonesia.

scholarly journals Linear discriminate analysis and k-nearest neighbor based diagnostic analytic of harmonic source identification

2021 ◽  
Vol 10 (1) ◽  
pp. 171-178
Author(s):  
Mohd Hatta Jopri ◽  
Abdul Rahim Abdullah ◽  
Mustafa Manap ◽  
M. Badril Nor Shah ◽  
Tole Sutikno ◽  
...  
Keyword(s):  
Nearest Neighbor ◽  
Geometric Mean ◽  
Performance Criteria ◽  
K Nearest Neighbor ◽  
Linear Discriminate Analysis ◽  
Discriminate Analysis ◽  
Time Frequency ◽  
Frequency Representation ◽  
S Transform ◽  
Harmonic Source

The diagnostic analytic of harmonic source is crucial research due to identify and diagnose the harmonic source in the power system. This paper presents a comparison of machine learning (ML) algorithm known as linear discriminate analysis (LDA) and k-nearest neighbor (KNN) in identifying and diagnosing the harmonic sources. Voltage and current features that estimated from time-frequency representation (TFR) of S-transform analysis are used as the input for ML. Several unique cases of harmonic source location are considered, whereas harmonic voltage (HV) and harmonic current (HC) source type-load are used in the diagnosing process. To identify the best ML, each ML algorithm is executed 10 times due to prevent any overfitting result and the performance criteria are measured consist of the accuracy, precision, geometric mean, specificity, sensitivity, and F measure are calculated.

Handwritten Balinesse Character Recognition using K-Nearest Neighbor

2018 ◽  
Author(s):  
I Wayan Agus Surya Darma
Keyword(s):  
Feature Extraction ◽  
Success Rate ◽  
Character Recognition ◽  
Nearest Neighbor ◽  
Recognition System ◽  
Extraction Process ◽  
K Nearest Neighbor ◽  
Nearest Neighbor Algorithm ◽  
K Nearest Neighbor Algorithm ◽  
Character Feature

Balinese character recognition is a technique to recognize feature or pattern of Balinese character. Feature of Balinese character is generated through feature extraction process. This research using handwritten Balinese character. Feature extraction is a process to obtain the feature of character. In this research, feature extraction process generated semantic and direction feature of handwritten Balinese character. Recognition is using K-Nearest Neighbor algorithm to recognize 81 handwritten Balinese character. The feature of Balinese character images tester are compared with reference features. Result of the recognition system with K=3 and reference=10 is achieved a success rate of 97,53%.

scholarly journals A Comparative Survey of Feature Extraction and Machine Learning Methods in Diverse Acoustic Environments

Sensors ◽  
2021 ◽  
Vol 21 (4) ◽  
pp. 1274
Author(s):  
Daniel Bonet-Solà ◽  
Rosa Ma Alsina-Pagès
Keyword(s):  
Machine Learning ◽  
Feature Extraction ◽  
Best Practice ◽  
Nearest Neighbor ◽  
Gaussian Mixture ◽  
Machine Learning Algorithms ◽  
Multimedia Retrieval ◽  
Natural Environments ◽  
K Nearest Neighbor ◽  
Acoustic Environments

Acoustic event detection and analysis has been widely developed in the last few years for its valuable application in monitoring elderly or dependant people, for surveillance issues, for multimedia retrieval, or even for biodiversity metrics in natural environments. For this purpose, sound source identification is a key issue to give a smart technological answer to all the aforementioned applications. Diverse types of sounds and variate environments, together with a number of challenges in terms of application, widen the choice of artificial intelligence algorithm proposal. This paper presents a comparative study on combining several feature extraction algorithms (Mel Frequency Cepstrum Coefficients (MFCC), Gammatone Cepstrum Coefficients (GTCC), and Narrow Band (NB)) with a group of machine learning algorithms (k-Nearest Neighbor (kNN), Neural Networks (NN), and Gaussian Mixture Model (GMM)), tested over five different acoustic environments. This work has the goal of detailing a best practice method and evaluate the reliability of this general-purpose algorithm for all the classes. Preliminary results show that most of the combinations of feature extraction and machine learning present acceptable results in most of the described corpora. Nevertheless, there is a combination that outperforms the others: the use of GTCC together with kNN, and its results are further analyzed for all the corpora.

scholarly journals A novel content based image retrieval system using K-means/KNN with feature extraction

2012 ◽  
Vol 9 (4) ◽  
pp. 1645-1661 ◽  
Author(s):  
Ray-I Chang ◽  
Shu-Yu Lin ◽  
Jan-Ming Ho ◽  
Chi-Wen Fann ◽  
Yu-Chun Wang
Keyword(s):  
Feature Extraction ◽  
Image Retrieval ◽  
Nearest Neighbor ◽  
Clustering Algorithms ◽  
Content Based Image Retrieval ◽  
K Nearest Neighbor ◽  
Color Analysis ◽  
Image Retrieval System ◽  
First Time ◽  
System Designs

Image retrieval has been popular for several years. There are different system designs for content based image retrieval (CBIR) system. This paper propose a novel system architecture for CBIR system which combines techniques include content-based image and color analysis, as well as data mining techniques. To our best knowledge, this is the first time to propose segmentation and grid module, feature extraction module, K-means and k-nearest neighbor clustering algorithms and bring in the neighborhood module to build the CBIR system. Concept of neighborhood color analysis module which also recognizes the side of every grids of image is first contributed in this paper. The results show the CBIR systems performs well in the training and it also indicates there contains many interested issue to be optimized in the query stage of image retrieval.

scholarly journals Travel-time Prediction Using K-nearest Neighbor Method with Distance Metric of Correlation Coefficient

2019 ◽  
Vol 13 (1) ◽  
pp. 141-150
Author(s):  
Jinhwan Jang
Keyword(s):  
Travel Time ◽  
Real Time ◽  
Correlation Coefficient ◽  
Nearest Neighbor ◽  
Modern Society ◽  
K Nearest Neighbor ◽  
Travel Time Prediction ◽  
Significance Level ◽  
Dedicated Short Range Communications ◽  
Road Users

Background: Real-time Travel Time (TT) information has become an essential component of daily life in modern society. With reliable TT information, road users can increase their productivity by choosing less congested routes or adjusting their trip schedules. Drivers normally prefer departure time-based TT, but most agencies in Korea still provide arrival time-based TT with probe data from Dedicated Short-Range Communications (DSRC) scanners due to a lack of robust prediction techniques. Recently, interest has focused on the conventional k-nearest neighbor (k-NN) method that uses the Euclidean distance for real-time TT prediction. However, conventional k-NN still shows some deficiencies under certain conditions. Methods: This article identifies the cases where conventional k-NN has shortcomings and proposes an improved k-NN method that employs a correlation coefficient as a measure of distance and applies a regression equation to compensate for the difference between current and historical TT. Results: The superiority of the suggested method over conventional k-NN was verified using DSRC probe data gathered on a signalized suburban arterial in Korea, resulting in a decrease in TT prediction error of 3.7 percent points on average. Performance during transition periods where TTs are falling immediately after rising exhibited statistically significant differences by paired t-tests at a significance level of 0.05, yielding p-values of 0.03 and 0.003 for two-day data. Conclusion: The method presented in this study can enhance the accuracy of real-time TT information and consequently improve the productivity of road users.

scholarly journals Design and Analysis System of KNN and ID3 Algorithm for Music Classification based on Mood Feature Extraction

2017 ◽  
Vol 7 (1) ◽  
pp. 486
Author(s):  
Made Sudarma ◽  
I Gede Harsemadi
Keyword(s):  
Feature Extraction ◽  
Processing Time ◽  
Nearest Neighbor ◽  
Extraction Process ◽  
Performance Comparison ◽  
K Nearest Neighbor ◽  
K Value ◽  
Id3 Algorithm ◽  
Analysis System ◽  
Music Information

Each of music which has been created, has its own mood which is emitted, therefore, there has been many researches in Music Information Retrieval (MIR) field that has been done for recognition of mood to music.  This research produced software to classify music to the mood by using K-Nearest Neighbor and ID3 algorithm.  In this research accuracy performance comparison and measurement of average classification time is carried out which is obtained based on the value produced from music feature extraction process.  For music feature extraction process it uses 9 types of spectral analysis, consists of 400 practicing data and 400 testing data.  The system produced outcome as classification label of mood type those are contentment, exuberance, depression and anxious.  Classification by using algorithm of KNN is good enough that is 86.55% at k value = 3 and average processing time is 0.01021.  Whereas by using ID3 it results accuracy of 59.33% and average of processing time is 0.05091 second.

Sign in / Sign up

Export Citation Format

Share Document