scholarly journals A Decision Tree-Based Attribute Weighting Filter for Naive Bayes

2007 ◽  
pp. 59-70 ◽  
Author(s):  
Mark Hall
Keyword(s):  
Decision Tree ◽  
Naive Bayes ◽  
Naïve Bayes ◽  
Attribute Weighting

KLASIFIKASI SMS SPAM MENGGUNAKAN SUPPORT VECTOR MACHINE

2019 ◽  
Vol 15 (2) ◽  
pp. 275-280
Author(s):  
Agus Setiyono ◽  
Hilman F Pardede
Keyword(s):  
Data Mining ◽  
Support Vector Machine ◽  
Decision Tree ◽  
Naive Bayes ◽  
Naïve Bayes ◽  
Support Vector ◽  
Spam Detection ◽  
Support Vector Machine Algorithm ◽  
Data Mining Techniques ◽  
To Receive

It is now common for a cellphone to receive spam messages. Great number of received messages making it difficult for human to classify those messages to Spam or no Spam.  One way to overcome this problem is to use Data Mining for automatic classifications. In this paper, we investigate various data mining techniques, named Support Vector Machine, Multinomial Naïve Bayes and Decision Tree for automatic spam detection. Our experimental results show that Support Vector Machine algorithm is the best algorithm over three evaluated algorithms. Support Vector Machine achieves 98.33%, while Multinomial Naïve Bayes achieves 98.13% and Decision Tree is at 97.10 % accuracy.

Identifying Key Fraud Indicators in the Automobile Insurance Industry Using SQL Server Analysis Services

2019 ◽  
Vol 64 (2) ◽  
pp. 53-71
Author(s):  
Botond Benedek ◽  
Ede László
Keyword(s):  
Neural Network ◽  
Decision Tree ◽  
Naive Bayes ◽  
Insurance Industry ◽  
Naïve Bayes ◽  
Sql Server ◽  
Categorical Variables ◽  
Automobile Insurance ◽  
Price Determination ◽  
Mining Tool

Abstract Customer segmentation represents a true challenge in the automobile insurance industry, as datasets are large, multidimensional, unbalanced and it also requires a unique price determination based on the risk profile of the customer. Furthermore, the price determination of an insurance policy or the validity of the compensation claim, in most cases must be an instant decision. Therefore, the purpose of this research is to identify an easily usable data mining tool that is capable to identify key automobile insurance fraud indicators, facilitating the segmentation. In addition, the methods used by the tool, should be based primarily on numerical and categorical variables, as there is no well-functioning text mining tool for Central Eastern European languages. Hence, we decided on the SQL Server Analysis Services (SSAS) tool and to compare the performance of the decision tree, neural network and Naïve Bayes methods. The results suggest that decision tree and neural network are more suitable than Naïve Bayes, however the best conclusion can be drawn if we use the decision tree and neural network together.

Human activity classification using Decision Tree and Naïve Bayes classifiers

2021 ◽  
Author(s):  
Kholoud Maswadi ◽  
Norjihan Abdul Ghani ◽  
Suraya Hamid ◽  
Muhammads Babar Rasheed
Keyword(s):  
Decision Tree ◽  
Human Activity ◽  
Naive Bayes ◽  
Naïve Bayes ◽  
Activity Classification

scholarly journals Multiple Naïve Bayes Classifiers Ensemble for Traffic Incident Detection

2014 ◽  
Vol 2014 ◽  
pp. 1-16 ◽  
Author(s):  
Qingchao Liu ◽  
Jian Lu ◽  
Shuyan Chen ◽  
Kangjia Zhao
Keyword(s):  
Decision Tree ◽  
Naive Bayes ◽  
Classification Performance ◽  
Naïve Bayes ◽  
Classifier Ensemble ◽  
Optimal Threshold ◽  
Incident Detection ◽  
Bayes Classifier ◽  
Traffic Incident ◽  
Better Than

This study presents the applicability of the Naïve Bayes classifier ensemble for traffic incident detection. The standard Naive Bayes (NB) has been applied to traffic incident detection and has achieved good results. However, the detection result of the practically implemented NB depends on the choice of the optimal threshold, which is determined mathematically by using Bayesian concepts in the incident-detection process. To avoid the burden of choosing the optimal threshold and tuning the parameters and, furthermore, to improve the limited classification performance of the NB and to enhance the detection performance, we propose an NB classifier ensemble for incident detection. In addition, we also propose to combine the Naïve Bayes and decision tree (NBTree) to detect incidents. In this paper, we discuss extensive experiments that were performed to evaluate the performances of three algorithms: standard NB, NB ensemble, and NBTree. The experimental results indicate that the performances of five rules of the NB classifier ensemble are significantly better than those of standard NB and slightly better than those of NBTree in terms of some indicators. More importantly, the performances of the NB classifier ensemble are very stable.

scholarly journals Analisa Komparasi Algoritma Decision Tree C4.5 dan Naïve Bayes untuk Prediksi Churn Berdasarkan Kelas Pelanggan Retail

2019 ◽  
Vol 3 (3) ◽  
pp. 103
Author(s):  
Ni Wayan Wardani ◽  
Ni Kadek Ariasih
Keyword(s):  
Data Mining ◽  
Decision Tree ◽  
Naive Bayes ◽  
Naïve Bayes

Pelanggan adalah salah satu aset utama bagi perusahaan ritel. Perusahaan harus dapat mengenali bagaimana karakter pelanggan mereka sehingga mereka dapat mempertahankan pelanggan yang sudah ada agar tidak berhenti membeli dan pindah ke perusahaan ritel yang bersaing (churn). Salah satu model yang tepat untuk mengenali karakter pelanggan adalah model RFM (Recency, Frekuensi, Moneter). Model RFM mampu menghasilkan kelas pelanggan dan di setiap kelas pelanggan dapat dianalisis atau diprediksi dengan konsep data mining apakah pelanggan tetap sebagai pelanggan atau churn. Data yang digunakan berasal dari data pelanggan dan data penjualan di UD. Mawar Sari. Kelas pelanggan UD Mawar Sari yang dihasilkan dari model RFM adalah Dormant, Everyday, Golden dan Superstar. Konsep data mining dengan membangun model prediksi dalam penelitian ini menggunakan algoritma Decision Tree C4.5 dan Naïve Bayes. Di semua kelas pelanggan kinerja Algoritma Naïve Bayes lebih baik daripada Algoritma Decision Tree C4.5 dengan Recall 95,92%, Precision 84,15%, dan Accuracy 83,49% dan kelas pelanggan yang memiliki potensi churn tinggi adalah Dormant B, Dormant E, dan Dormant F.Kata Kunci: Prediksi Churn, RFM, C4.5, Naïve Bayes

scholarly journals Brain tumor prediction using naïve Bayes’ classifier and decision tree algorithms

2018 ◽  
Vol 7 (1.7) ◽  
pp. 137 ◽  
Author(s):  
Danda Shashank Reddy ◽  
Chinta Naga Harshitha ◽  
Carmel Mary Belinda
Keyword(s):  
Brain Tumor ◽  
Decision Tree ◽  
Naive Bayes ◽  
Classification Problem ◽  
Naïve Bayes ◽  
World Health ◽  
Decision Tree Algorithm ◽  
Tree Algorithm ◽  
Computer Tomography Scan ◽  
Bayes Algorithm

Now a day’s many advanced techniques are proposed in diagnosing the tumor in brain like magnetic resonance imaging, computer tomography scan, angiogram, spinal tap and biospy. Based on diagnosis it is easy to predict treatment. All of the types of brain tumor are officially reclassified by the World Health Organization. Brain tumors are of 120 types, almost each tumor is having same symptoms and it is difficult to predict treatment. For this regard we are proposing more accurate and efficient algorithm in predicting the type of brain tumor is Naïve Bayes’ classification and decision tree algorithm. The main focus is on solving tumor classification problem using these algorithms. Here the main goal is to show that the prediction through the decision tree algorithm is simple and easy than the Naïve Bayes’ algorithm.

scholarly journals Tinjauan Algoritma RoI (Region of Interest) Dengan Metode Pengambangan Otsu Dan Klasterisasi K-Mean; Hasil Dan Tantangannya

2020 ◽  
Vol 16 (2) ◽  
pp. 75
Author(s):  
Didit Widiyanto
Keyword(s):  
Support Vector Machine ◽  
Decision Tree ◽  
Naive Bayes ◽  
Region Of Interest ◽  
Naïve Bayes ◽  
Support Vector ◽  
Gray Level

Akurasi sebuah klasifikasi citra ditentukan oleh pengklasifikasi.  Meskipun RoI (Region of Interest) tidak menentukan secara langsung akurasi, namun RoI menentukan lingkup klasifikasi citra.   Terdapat tiga algoritma yang dapat digunakan sebagai algoritma RoI yaitu; Balanced Histogram Thresholding (BHT), algoritma Otsu, dan algoritma klasterisasi K-Means.  Paper ini meninjau algoritma Otsu dan algoritma klasterisasi K-Means yang digunakan oleh lima peneliti.  Dari ke lima peneliti; tiga peneliti menerapkan algoritma Otsu dan dua peneliti menerapkan algoritma K-Means sebagai algoritma RoI. Setelah operasi RoI, ke lima peneliti menerapkan algoritma GLCM (Gray Level Co-occurance Matrix) sebagai pengekstraksi ciri tekstur.  Hasil ekstraksi ciri diklasifikasi dengan menggunakan berbagai pengklasifikasi antara lain SVM (Support Vector Machine), Naive Bayes, dan Decision Tree. Akhirnya dengan membandingkan hasil dari ke lima peneliti, akurasi tertinggi diperoleh sebesar 100% dengan pengklasifikasi SVM menggunakan algoritma Otsu sebagai algoritma RoI, dan akurasi terendah adalah sebesar52% yang menggunakan algoritma Otsu pada kanal S dari citra HSV (Hue, Saturation Value).

Sign in / Sign up

Export Citation Format

Share Document