scholarly journals Klasifikasi Malicious Websites Menggunakan Algoritma K-NN Berdasarkan Application Layers dan Network Characteristics

2018 ◽  
Vol 4 (1) ◽  
pp. 37
Author(s):  
Green Arther Sandag ◽  
Jonathan Leopold ◽  
Vinky Fransiscus Ong
Keyword(s):  
Feature Selection ◽  
Data Reduction ◽  
Nearest Neighbor ◽  
Naive Bayes ◽  
Data Cleaning ◽  
Data Preprocessing ◽  
Naïve Bayes ◽  
Application Layer ◽  
K Nearest Neighbor ◽  
Network Characteristics

Dalam kehidupan di era teknologi sekarang ini semua aktivitas manusia telah dipengaruhi oleh internet. Berbagi informasi, komunikasi, sosialisasi, berbelanja, berbisnis, pendidikan dan banyak hal lainnya yang dapat dilakukan menggunakan internet. Seiring dengan berkembangnya internet berbagai macam ancaman keamanan menjadi lebih beragam. Virus adalah musuh nomor satu di internet. Virus memanfaatkan berbagai metode untuk dapat menghindari anti-virus, salah satunya adalah Malware. Malware adalah salah satu kode berbahaya yang dapat mengubah, merusak dan mencuri data pribadi yang dapat merugikan individual ataupun kelompok. Penelitian ini akan memprediksi malicious website berdasarkan application layer dan network characteristics menggunakan metode K-Nearest Neighbor. Penelitian ini menggunakan metode data cleaning dan data reduction untuk data preprocessing, dan feature selection untuk pemilihan attribut yang paling berpengaruh pada malicious website. Untuk memprediksi malicious website penulis menggunakan algoritma K-NN dengan hasil 2,42% precision lebih tinggi dibandingkan dengan penelitian sebelumnya yang menggunakan algoritma Naïve Bayes.  Keywords : Klasifikasi, Network Characteristics, Malicious Websites, Application Layers, K-NN, Naïve Bayes

Feature selection via computational intelligence techniques

2020 ◽  
Vol 39 (5) ◽  
pp. 6205-6216
Author(s):  
Ramazan Algin ◽  
Ali Fuat Alkaya ◽  
Mustafa Agaoglu
Keyword(s):  
Machine Learning ◽  
Feature Selection ◽  
Computational Intelligence ◽  
Nearest Neighbor ◽  
Naive Bayes ◽  
Search Algorithms ◽  
Naïve Bayes ◽  
Feature Subset ◽  
K Nearest Neighbor ◽  
Migrating Birds Optimization

Feature selection (FS) has become an essential task in overcoming high dimensional and complex machine learning problems. FS is a process used for reducing the size of the dataset by separating or extracting unnecessary and unrelated properties from it. This process improves the performance of classification algorithms and reduces the evaluation time by enabling the use of small sized datasets with useful features during the classification process. FS aims to gain a minimal feature subset in a problem domain while retaining the accuracy of the original data. In this study, four computational intelligence techniques, namely, migrating birds optimization (MBO), simulated annealing (SA), differential evolution (DE) and particle swarm optimization (PSO) are implemented for the FS problem as search algorithms and compared on the 17 well-known datasets taken from UCI machine learning repository where the dimension of the tackled datasets vary from 4 to 500. This is the first time that MBO is applied for solving the FS problem. In order to judge the quality of the subsets generated by the search algorithms, two different subset evaluation methods are implemented in this study. These methods are probabilistic consistency-based FS (PCFS) and correlation-based FS (CFS). Performance comparison of the algorithms is done by using three well-known classifiers; k-nearest neighbor, naive bayes and decision tree (C4.5). As a benchmark, the accuracy values found by classifiers using the datasets with all features are used. Results of the experiments show that our MBO-based filter approach outperforms the other three approaches in terms of accuracy values. In the experiments, it is also observed that as a subset evaluator CFS outperforms PCFS and as a classifier C4.5 gets better results when compared to k-nearest neighbor and naive bayes.

scholarly journals Performance of Naïve Bayes, C4.5 and KNN using Breast Cancer, Iris and Hypothyroid Datasets

2020 ◽  
Vol 9 (3) ◽  
pp. 2193-2197
Keyword(s):  
Breast Cancer ◽  
Data Mining ◽  
Nearest Neighbor ◽  
Naive Bayes ◽  
Naïve Bayes ◽  
Specific Pattern ◽  
K Nearest Neighbor ◽  
Data Mining Technique ◽  
Digital Format ◽  
Tree Classifier

Data mining usually specifies the discovery of specific pattern or analysis of data from a large dataset. Classification is one of an efficient data mining technique, in which class the data are classified are already predefined using the existing datasets. The classification of medical records in terms of its symptoms using computerized method and storing the predicted information in the digital format is of great importance in the diagnosis of various diseases in the medical field. In this paper, finding the algorithm with highest accuracy range is concentrated so that a cost-effective algorithm can be found. Here the data mining classification algorithms are compared with their accuracy of finding exact data according to the diagnosis report and their execution rate to identify how fast the records are classified. The classification technique based algorithms used in this study are the Naive Bayes Classifier, the C4.5 tree classifier and the K-Nearest Neighbor (KNN) to predict which algorithm is the best suited for classifying any kind of medical dataset. Here the datasets such as Breast Cancer, Iris and Hypothyroid are used to predict which of the three algorithms is suitable for classifying the datasets with highest accuracy of finding the records of patients with the particular health problems. The experimental results represented in the form of table and graph shows the performance and the importance of Naïve Bayes, C4.5 and K-Nearest Neighbor algorithms. From the performance outcome of the three algorithms the C4.5 algorithm is a lot better than the Naïve Bayes and the K-Nearest Neighbor algorithm.

scholarly journals RB-Bayes algorithm for the prediction of diabetic in Pima Indian dataset

2019 ◽  
Vol 9 (6) ◽  
pp. 4866
Author(s):  
Rajni Rajni ◽  
Amandeep Amandeep
Keyword(s):  
Nearest Neighbor ◽  
Naive Bayes ◽  
Early Stage ◽  
Human Life ◽  
Naïve Bayes ◽  
Support Vector ◽  
Pima Indians ◽  
K Nearest Neighbor ◽  
Fast Pace ◽  
Bayes Algorithm

<p>Diabetes is a major concern all over the world. It is increasing at a fast pace. People can avoid diabetes at an early stage without any test. The goal of this paper is to predict the probability of whether the person has a risk of diabetes or not at an early stage. This would lead to having a great impact on their quality of human life. The datasets are Pima Indians diabetes and Cleveland coronary illness and consist of 768 records. Though there are a number of solutions available for information extraction from a huge datasets and to predict the possibility of having diabetes, but the accuracy of their mining process is far from accurate. For achieving highest accuracy, the issue of zero probability which is generally faced by naïve bayes analysis needs to be addressed suitably. The proposed framework RB-Bayes aims to extract the required information with high accuracy that could survive the problem of zero probability and also configure accuracy with other methods like Support Vector Machine, Naive Bayes, and K Nearest Neighbor. We calculated mean to handle missing data and calculated probability for yes (positive) and no (negative). The highest value between yes and no decide the value for the tuple. It is mostly used in text classification. The outcomes on Pima Indian diabetes dataset demonstrate that the proposed methodology enhances the precision as a contrast with other regulated procedures. The accuracy of the proposed methodology large dataset is 72.9%.</p>

scholarly journals Prediksi Harga Minyak Kelapa Sawit Dalam Investasi Dengan Membandingkan Algoritma Naïve Bayes, Support Vector Machine dan K-Nearest Neighbor

2019 ◽  
Vol 4 (1) ◽  
Author(s):  
Deny Haryadi ◽  
Rila Mandala
Keyword(s):  
Support Vector Machine ◽  
Nearest Neighbor ◽  
Naive Bayes ◽  
Naïve Bayes ◽  
Support Vector ◽  
K Nearest Neighbor

Harga minyak kelapa sawit bisa mengalami kenaikan, penurunan maupun tetap setiap hari karena faktor yang mempengaruhi harga minyak kelapa sawit seperti harga minyak nabati lain (minyak kedelai dan minyak canola), harga minyak mentah dunia, maupun nilai tukar riil antara kurs dolar terhadap mata uang negara produsen (rupiah, ringgit, dan canada) atau mata uang negara konsumen (rupee). Untuk itu dibutuhkan prediksi harga minyak kelapa sawit yang cukup akurat agar para investor bisa mendapatkan keuntungan sesuai perencanaan yang dibuat. tujuan dari penelitian ini yaitu untuk mengetahui perbandingan accuracy, precision, dan recall yang dihasilkan oleh algoritma Naïve Bayes, Support Vector Machine, dan K-Nearest Neighbor dalam menyelesaikan masalah prediksi harga minyak kelapa sawit dalam investasi. Berdasarkan hasil pengujian dalam penelitian yang telah dilakukan, algoritma Support Vector Machine memiliki accuracy, precision, dan recall dengan jumlah paling tinggi dibandingkan dengan algoritma Naïve Bayes dan algoritma K-Nearest Neighbor. Nilai accuracy tertinggi pada penelitian ini yaitu 82,46% dengan precision tertinggi yaitu 86% dan recall tertinggi yaitu 89,06%.

Investigating the Performance of Naive- Bayes Classifiers and K- Nearest Neighbor Classifiers

2010 ◽  
Vol 5 (2) ◽  
pp. 133-137 ◽  
Author(s):  
Mohammed J. Islam ◽  
Q. M. Jonathan Wu ◽  
Majid Ahmadi ◽  
Maher A. SidAhmed
Keyword(s):  
Nearest Neighbor ◽  
Naive Bayes ◽  
Naïve Bayes ◽  
K Nearest Neighbor ◽  
Nearest Neighbor Classifiers
Sign in / Sign up

Export Citation Format

Share Document