scholarly journals Hasil Klasifikasi Algoritma Backpropagation dan K-Nearest Neighbor pada Cardiovascular Disease

2021 ◽  
Vol 1 (1) ◽  
pp. 17-27
Author(s):  
Nashrulloh Khoiruzzaman ◽  
Rima Dias Ramadhani ◽  
Apri Junaidi
Keyword(s):  
Cardiovascular Disease ◽  
Chest Pain ◽  
Euclidean Distance ◽  
Nearest Neighbor ◽  
K Nearest Neighbor ◽  
Hidden Layer

Cardiovascular disease adalah penyakit yang diakibatkan oleh kelainan yang terjadi pada organ jantung. Cardivascular disease dapat menyerang manusia dari usia muda hingga usia tua yang terdapat 13 faktor yang mempengaruhinya yaitu Age, Sex, Chest pain, Trestbps, Chol, Fbs, Restecg, Thalach, Exang, Oldpeak, Slope, Ca, dan Thal. Cardiovascular disease beragam jenisnya antara lain penyakit jantung koroner, gagal jantung, tekanan darah tinggi, tekanan darah rendah dan lain-lain. Oleh karena itu, penelitian ini memiliki tujuan untuk melakukan klasifikasi terhadap cardiovascular disease. Pada penelitian ini menggunakan algoritma backpropagation dan algoritma K-nearest neighbor. Langkah awal dilakukan adalah proses perhitungan euclidean distance pada K-NN untuk mencari jarak k terdekat untuk mendapatkan kategori berdasarkan frequensi terbanyak dari nilai k yang ditentukan dan mencari bobot baru untuk algoritma backpropagation untuk mendapatkan bobot baru yang digunakan untuk mendapatkan nilai yang sesuai dengan yang diharapkan. Pengujian sistem ini terdiri dari pengujian nilai akurasi dengan nilai K, pengujian K-fold X validation dan pengaruh hidden layer. Hasil dari Penelitian ini bahwa algoritma backpropagation menghasilkan nilai akurasi sebesar 64%, presisi sebesar 62%, recall sebesar 64% dan algoritma K-nearest neighbor menghasilkan nilai akurasi sebesar 66%, presisi sebesar 61% dan recall sebesar 66%. Pengaruh hidden layer terhadap algoritma backpropagation dalam mengklasifikasikan cardiovascular disease sangat besar hal ini sesuai dengan hasil dari penelitian yang telah dilakukan bahwa ketika jumlah hidden layer kecil, nilai yang dihasilkan juga kecil akan tetapi ketika jumlah hidden layernya tinggi nilai akurasinya bahkan menjadi rendah .

Cardiovascular Disease Prediction from Electrocardiogram by using Machine Learning Method: A Snapshot from the Subjects of the Malaysian Cohort

2020 ◽  
Author(s):  
Nazrul Anuar Nayan ◽  
Hafifah Ab Hamid ◽  
Mohd Zubir Suboh ◽  
Noraidatulakma Abdullah ◽  
Rosmina Jaafar ◽  
...  
Keyword(s):  
Machine Learning ◽  
Cardiovascular Disease ◽  
Nearest Neighbor ◽  
Total Cholesterol Level ◽  
Population Based ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Cvd Risk ◽  
Linear Discriminant ◽  
Artificial Neural Network Ann

Abstract Background: Cardiovascular disease (CVD) is the leading cause of deaths worldwide. In 2017, CVD contributed to 13,503 deaths in Malaysia. The current approaches for CVD prediction are usually invasive and costly. Machine learning (ML) techniques allow an accurate prediction by utilizing the complex interactions among relevant risk factors. Results: This study presents a case–control study involving 60 participants from The Malaysian Cohort, which is a prospective population-based project. Five parameters, namely, the R–R interval and root mean square of successive differences extracted from electrocardiogram (ECG), systolic and diastolic blood pressures, and total cholesterol level, were statistically significant in predicting CVD. Six ML algorithms, namely, linear discriminant analysis, linear and quadratic support vector machines, decision tree, k-nearest neighbor, and artificial neural network (ANN), were evaluated to determine the most accurate classifier in predicting CVD risk. ANN, which achieved 90% specificity, 90% sensitivity, and 90% accuracy, demonstrated the highest prediction performance among the six algorithms. Conclusions: In summary, by utilizing ML techniques, ECG data can serve as a good parameter for CVD prediction among the Malaysian multiethnic population.

scholarly journals Efficient Shared Execution Processing of k-Nearest Neighbor Joins in Road Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-17 ◽  
Author(s):  
Hyung-Ju Cho
Keyword(s):  
Euclidean Distance ◽  
Nearest Neighbor ◽  
Real Life ◽  
Road Networks ◽  
Nearest Neighbors ◽  
Superior Performance ◽  
K Nearest Neighbor ◽  
Wide Range ◽  
Primitive Operation ◽  
Nested Loop

We investigate the k-nearest neighbor (kNN) join in road networks to determine the k-nearest neighbors (NNs) from a dataset S to every object in another dataset R. The kNN join is a primitive operation and is widely used in many data mining applications. However, it is an expensive operation because it combines the kNN query and the join operation, whereas most existing methods assume the use of the Euclidean distance metric. We alternatively consider the problem of processing kNN joins in road networks where the distance between two points is the length of the shortest path connecting them. We propose a shared execution-based approach called the group-nested loop (GNL) method that can efficiently evaluate kNN joins in road networks by exploiting grouping and shared execution. The GNL method can be easily implemented using existing kNN query algorithms. Extensive experiments using several real-life roadmaps confirm the superior performance and effectiveness of the proposed method in a wide range of problem settings.

scholarly journals Cardiovascular Disease Prediction from Electrocardiogram by Using Machine Learning

2020 ◽  
Vol 16 (07) ◽  
pp. 34
Author(s):  
Nayan Nazrul Anuar ◽  
Ab Hamid Hafifah ◽  
Suboh Mohd Zubir ◽  
Abdullah Noraidatulakma ◽  
Jaafar Rosmina ◽  
...  
Keyword(s):  
Machine Learning ◽  
Cardiovascular Disease ◽  
Nearest Neighbor ◽  
Total Cholesterol Level ◽  
Population Based ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Cvd Risk ◽  
Linear Discriminant ◽  
Artificial Neural Network Ann

<p>Cardiovascular disease (CVD) is the leading cause of deaths worldwide. In 2017, CVD contributed to 13,503 deaths in Malaysia. The current approaches for CVD prediction are usually invasive and costly. Machine learning (ML) techniques allow an accurate prediction by utilizing the complex interactions among relevant risk factors. This study presents a case–control study involving 60 participants from The Malaysian Cohort, which is a prospective population-based project. Five parameters, namely, the R–R interval and root mean square of successive differences extracted from electrocardiogram (ECG), systolic and diastolic blood pressures, and total cholesterol level, were statistically significant in predicting CVD. Six ML algorithms, namely, linear discriminant analysis, linear and quadratic support vector machines, decision tree, k-nearest neighbor, and artificial neural network (ANN), were evaluated to determine the most accurate classifier in predicting CVD risk. ANN, which achieved 90% specificity, 90% sensitivity, and 90% accuracy, demonstrated the highest prediction performance among the six algorithms. In summary, by utilizing ML techniques, ECG data can serve as a good parameter for CVD prediction among the Malaysian multiethnic population.</p>

scholarly journals Prediction of Train Arrival Delay Using Hybrid ELM-PSO Approach

2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Xu Bao ◽  
Yanqiu Li ◽  
Jianmin Li ◽  
Rui Shi ◽  
Xin Ding
Keyword(s):  
Nearest Neighbor ◽  
Pso Algorithm ◽  
Bayesian Optimization ◽  
Gradient Boosting ◽  
K Nearest Neighbor ◽  
Delay Management ◽  
Buffer Time ◽  
Proposed Model ◽  
Learning Machine ◽  
Hidden Layer

In this study, a hybrid method combining extreme learning machine (ELM) and particle swarm optimization (PSO) is proposed to forecast train arrival delays that can be used for later delay management and timetable optimization. First, nine characteristics (e.g., buffer time, the train number, and station code) associated with train arrival delays are chosen and analyzed using extra trees classifier. Next, an ELM with one hidden layer is developed to predict train arrival delays by considering these characteristics mentioned before as input features. Furthermore, the PSO algorithm is chosen to optimize the hyperparameter of the ELM compared to Bayesian optimization and genetic algorithm solving the arduousness problem of manual regulating. Finally, a case is studied to confirm the advantage of the proposed model. Contrasted to four baseline models (k-nearest neighbor, categorical boosting, Lasso, and gradient boosting decision tree) across different metrics, the proposed model is demonstrated to be proficient and achieve the highest prediction accuracy. In addition, through a detailed analysis of the prediction error, it is found that our model possesses good robustness and correctness.

scholarly journals Short-Term Traffic Volume Forecasting with Asymmetric Loss Based on Enhanced KNN Method

2019 ◽  
Vol 2019 ◽  
pp. 1-11
Author(s):  
Zhiyuan Wang ◽  
Shouwen Ji ◽  
Bowen Yu
Keyword(s):  
Euclidean Distance ◽  
Intelligent Transportation System ◽  
Nearest Neighbor ◽  
Mean Squared Error ◽  
Essential Elements ◽  
Traffic Volume ◽  
K Nearest Neighbor ◽  
Short Term ◽  
Traffic Condition ◽  
Asymmetric Loss

Short-term traffic volume forecasting is one of the most essential elements in Intelligent Transportation System (ITS) by providing prediction of traffic condition for traffic management and control applications. Among previous substantial forecasting approaches, K nearest neighbor (KNN) is a nonparametric and data-driven method popular for conciseness, interpretability, and real-time performance. However, in previous related researches, the limitations of Euclidean distance and forecasting with asymmetric loss have rarely been focused on. This research aims to fill up these gaps. This paper reconstructs Euclidean distance to overcome its limitation and proposes a KNN forecasting algorithm with asymmetric loss. Correspondingly, an asymmetric loss index, Imbalanced Mean Squared Error (IMSE), has also been proposed to test the effectiveness of newly designed algorithm. Moreover, the effect of Loess technique and suitable parameter value of dynamic KNN method have also been tested. In contrast to the traditional KNN algorithm, the proposed algorithm reduces the IMSE index by more than 10%, which shows its effectiveness when the cost of forecasting residual direction is notably different. This research expands the applicability of KNN method in short-term traffic volume forecasting and provides an available approach to forecast with asymmetric loss.

Smart Access Absensi Praktikum Teknik Elektro Universitas Trunojoyo Madura Menggunakan RFID Berbasis Internet of Things (IoT)

2021 ◽  
Vol 3 (1) ◽  
Author(s):  
Miftachul Ulum ◽  
Ahmad Fiqhi Ibadillah ◽  
Adi Kurniawan Saputro
Keyword(s):  
Internet Of Things ◽  
Human Error ◽  
Euclidean Distance ◽  
Nearest Neighbor ◽  
K Nearest Neighbor

Sistem absensi manual tidak praktis dalam proses perekapan absensike server pusat, karena harus diolah secara manual dan banyakkemungkinan human error. Data absensi tidak dapat langsung diuploadke server sehingga diperlukan sistem absensi yang terintegrasi agardapat meminimalisir kesalahan dan kecurangan. Pada penelitian ini,dirancang alat untuk sistem dengan rfid yang akan mengidentifikasi iddata sebagai input untuk database. Penulis menggunakan metode KNearestNeighbor sebagai klasifikasi, jam masuk dan jam keluardijadikan sebagai masukkan untuk data uji dan data latih yangdiperoleh dari pembacaan id oleh RFID RC522 yang disematkandalam modul absensi. Bertumpu pada NodeMCU untuk kebutuhanInternet of Things dan juga penggerak dari keseluruhan komponen didalamnya, alat tersebut dapat diwujudkan dalam bentuk yang simpeldan menarik. Dari hasil pengujian yang telah dilakukan pada penelitiansistem dan modul absensi mendapatkan skor rata-rata waktu di bawah10 second untuk 1 kali proses absensi, untuk klasifikasi menggunakanmetode K-Nearest Neighbor dengan euclidean distance menghasilkantingkat akurasi yang tinggi berturut-turut 66,67% - 100% sesuai dandapat dikatakan sistem dan modul absensi ini sudah berjalan denganbaik dan efektif.

scholarly journals Penggunaan Global Contrast Saliency dan Histogram of Oriented Gradient Sebagai Fitur untuk Klasifikasi Jenis Hewan Mamalia

Petir ◽  
2020 ◽  
Vol 13 (1) ◽  
pp. 80-85
Author(s):  
Yohannes Yohannes ◽  
Muhammad Ezar Al Rivan
Keyword(s):  
Euclidean Distance ◽  
Nearest Neighbor ◽  
Shape Feature ◽  
Shape Features ◽  
K Nearest Neighbor ◽  
Histogram Of Oriented Gradient ◽  
Global Contrast ◽  
The Face ◽  
Better Than

Mammal type can be classified based on the face. Every mammal’s face has a different shape. Histogram of Oriented Gradient (HOG) used to get shape feature from mammal’s face. Before this step, Global Contrast Saliency used to make images focused on an object. This process conducts to get better shape features. Then, classification using k-Nearest Neighbor (k-NN). Euclidean and cityblock distance with k=3,5,7 and 9 used in this study. The result shows cityblock distance with k=9 better than Euclidean distance for each k. Tiger is superior to others for all distances. Sheep is bad classified.

scholarly journals Klasifikasi Sekolah Menengah Pertama/Sederajat Wilayah Bireuen Menggunakan Algoritma K-Nearest Neighbors Berbasis Web

2020 ◽  
Vol 5 (1) ◽  
pp. 33
Author(s):  
Rozzi Kesuma Dinata ◽  
Fajriana Fajriana ◽  
Zulfa Zulfa ◽  
Novia Hasdyna
Keyword(s):  
Euclidean Distance ◽  
Nearest Neighbor ◽  
Nearest Neighbors ◽  
K Nearest Neighbor ◽  
K Nearest Neighbors

Pada penelitian ini diimplementasikan algoritma K-Nearest Neighbor dalam pengklasifikasian Sekolah Menengah Pertama/Sederajat berdasarkan peminatan calon siswa. Tujuan penelitian ini adalah untuk memudahkan pengguna dalam menemukan sekolah SMP/sederajat berdasarkan 8 kriteria sekolah yaitu akreditasi, fasilitas ruangan, fasilitas olah raga, laboratorium, ekstrakulikuler, biaya, tingkatan kelas dan waktu belajar. Adapun data yang digunakan dalam penelitian ini didapatkan dari Dinas Pendidikan Pemuda dan Olahraga Kabupaten Bireuen. Hasil penelitian dengan menggunakan K-NN dan pendekatan Euclidean Distance dengan k=3, diperoleh nilai precision sebesar 63,67%, recall 68,95% dan accuracy sebesar 79,33% .

scholarly journals A generalized fuzzy k-nearest neighbor regression model based on Minkowski distance

2021 ◽  
Author(s):  
Mahinda Mailagaha Kumbure ◽  
Pasi Luukka
Keyword(s):  
Regression Model ◽  
Euclidean Distance ◽  
Nearest Neighbor ◽  
Weighted Average ◽  
Nearest Neighbors ◽  
Manhattan Distance ◽  
K Nearest Neighbor ◽  
Minkowski Distance ◽  
Regression Methods ◽  
Target Sample

AbstractThe fuzzy k-nearest neighbor (FKNN) algorithm, one of the most well-known and effective supervised learning techniques, has often been used in data classification problems but rarely in regression settings. This paper introduces a new, more general fuzzy k-nearest neighbor regression model. Generalization is based on the usage of the Minkowski distance instead of the usual Euclidean distance. The Euclidean distance is often not the optimal choice for practical problems, and better results can be obtained by generalizing this. Using the Minkowski distance allows the proposed method to obtain more reasonable nearest neighbors to the target sample. Another key advantage of this method is that the nearest neighbors are weighted by fuzzy weights based on their similarity to the target sample, leading to the most accurate prediction through a weighted average. The performance of the proposed method is tested with eight real-world datasets from different fields and benchmarked to the k-nearest neighbor and three other state-of-the-art regression methods. The Manhattan distance- and Euclidean distance-based FKNNreg methods are also implemented, and the results are compared. The empirical results show that the proposed Minkowski distance-based fuzzy regression (Md-FKNNreg) method outperforms the benchmarks and can be a good algorithm for regression problems. In particular, the Md-FKNNreg model gave the significantly lowest overall average root mean square error (0.0769) of all other regression methods used. As a special case of the Minkowski distance, the Manhattan distance yielded the optimal conditions for Md-FKNNreg and achieved the best performance for most of the datasets.

Sign in / Sign up

Export Citation Format

Share Document