Claim Missing Document
Check
Articles

Found 12 Documents
Search

Naïve Bayes and K-Nearest Neighbor Algorithm Approach in Data Mining Classification of Drugs Addictive Diseases Dadang Priyanto; Ahmad Robbiul Iman; Deny Jollyta
ILKOM Jurnal Ilmiah Vol 15, No 2 (2023)
Publisher : Prodi Teknik Informatika FIK Universitas Muslim Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33096/ilkom.v15i2.1544.262-270

Abstract

Indonesia, with its very large population, is a potential market for drugs trafficking. Hence, seriousness is needed in cracking down or preventing drug trafficking. Narcotics are substances or drugs that can cause dependence or addicted and other negative impacts on users. The problem is that drug users do not realize and even ignore diseases caused by drug addiction. The diseases can be life-threatening for users, such as inflammation of the liver, heart disease, hypertension, stroke, and others. The prevalence rate of drug abuse in West Nusa Tenggara (NTB) is included in the high category, reaching 292 cases or around 37.24% cases. This study aimed to create an application that can classify various diseases of drug users using the naïve bayes and KNN methods. The results of this study indicated that there was a very close relationship between drug users and various deadly diseases. The prediction results showed that the naive bayes method provided a prediction accuracy of 94.5% while the KNN showed a prediction accuracy of 92.5%. This shows that the naive bayes method provides better predictive performance than the KNN in the data set of drug addicts in NTB.
Comparison of Distance Measurements Based on k-Numbers and Its Influence to Clustering Deny Jollyta; Prihandoko Prihandoko; Dadang Priyanto; Alyauma Hajjah; Yulvia Nora Marlim
MATRIK : Jurnal Manajemen, Teknik Informatika dan Rekayasa Komputer Vol 23 No 1 (2023)
Publisher : LPPM Universitas Bumigora

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30812/matrik.v23i1.3078

Abstract

Heuristic data requires appropriate clustering methods to avoid casting doubt on the information generated by the grouping process. Determining an optimal cluster choice from the results of grouping is still challenging. This study aimed to analyze the four numerical measurement formulas in light of the data patterns from categorical that are now accessible to give users of heuristic data recommendations for how to derive knowledge or information from the best clusters. The method used was clustering with four measurements: Euclidean, Canberra, Manhattan, and Dynamic Time Warping and Elbow approach for optimizing. The Elbow with Sum Square Error (SSE) is employed to calculate the optimal cluster. The number of test clusters ranges from k = 2 to k = 10. Student data from social media was used in testing to help students achieve higher GPAs. 300 completed questionnaires that were circulated and used to collect the data. The result of this study showed that the Manhattan Distance is the best numerical measurement with the largest SSE of 45.359 and optimal clustering at k = 5. The optimal cluster Manhattan generated was made up of students with GPAs above 3.00 and websites/ vlogs used as learning tools by the mathematics and computer department. Each cluster’s ability to create information can be impacted by the proximity of qualities caused by variations in the number of clusters.