Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Journal of Dinda : Data Science, Information Technology, and Data Analytics

Perbandingan Performa Antara Algoritma Naive Bayes Dan K-Nearest Neighbour Pada Klasifikasi Kanker Payudara Annisa Nugraheni; Rima Dias Ramadhani; Amalia Beladinna Arifa; Agi Prasetiadi
Indonesian Journal of Data Science, IoT, Machine Learning and Informatics Vol 2 No 1 (2022): February
Publisher : Research Group of Data Engineering, Faculty of Informatics

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20895/dinda.v2i1.391

Abstract

Breast cancer is the second most common cause of death from cancer after lung cancer is in the first place. Breast cancer occurs when cells in breast tissue begin to grow uncontrollably and can disrupt existing healthy tissue. Therefore, there is a need for a classification to distinguish breast cancer patients and healthy people. Based on previous research, the Naïve Bayes and K-Nearest Neighbor algorithms are considered capable of classifying breast cancer. In the research process using the breast cancer dataset from the Breast Cancer Coimbra dataset in 2018 UCI Machine Learning Repository with a total of 116 data, while for the calculation of the feasibility of the method using the Confusion Matrix (Accuracy, Precision, and Recall) and the ROC-AUC curve. The purpose of this study is to compare the performance of the Naïve Bayes and K-Nearest Neighbor algorithms. In testing using the Naïve Bayes algorithm and the K-Nearest Neighbor algorithm, there are several test scenarios, namely, data testing before and after normalization, model testing based on a comparison of training data and testing data, model testing based on K values ​​in K-Nearest Neighbors, and model testing. based on the selection of the strongest attribute with the Pearson correlation test. The results of this study indicate that the Naïve Bayes algorithm has the highest average accuracy of 69.12%, healthy precision 64.90%, pain precision 83%, healthy recall 88%, sick recall 61.11% and AUC 0.82 which is included in the good classification category. Meanwhile, the highest average results of the K-Nearest Neighbor algorithm are 76.83% for accuracy, 76% healthy precision, 80.21% pain precision, 74.18% for healthy recall, 80.81% sick recall and 0.91 AUC which is included in the excellent classification category.
Minimalist DCT-based Depthwise Separable Convolutional Neural Network Approach for Tangut Script Agi Prasetiadi; Julian Saputra; Imada Ramadhanti; Asti Dwi Sripamuji; Risa Riski Amalia
Indonesian Journal of Data Science, IoT, Machine Learning and Informatics Vol 3 No 2 (2023): August
Publisher : Research Group of Data Engineering, Faculty of Informatics

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20895/dinda.v3i2.1106

Abstract

The Tangut script, a lesser-explored dead script comprising numerous characters, has received limited attention in deep learning research, particularly in the field of optical character recognition (OCR). Existing OCR studies primarily focus on widely-used characters like Chinese characters and employ deep convolutional neural networks (CNNs) or combinations with recurrent neural networks (RNNs) to enhance accuracy in character recognition. In contrast, this study takes a counterintuitive approach to develop an OCR model specifically for the Tangut script. We utilize shorter layers with slimmer filters using a depthwise separable convolutional neural network (DSCNN) architecture. Furthermore, we preprocess the dataset using a frequency-based transformation, namely the Discrete Cosine Transform (DCT). The results demonstrate successful training of the model, showcasing faster convergence and higher accuracy compared to traditional deep neural networks commonly used in OCR applications.