scholarly journals Mixture-Based Probabilistic Graphical Models for the Label Ranking Problem

Entropy ◽  
2021 ◽  
Vol 23 (4) ◽  
pp. 420
Author(s):  
Enrique G. Rodrigo ◽  
Juan C. Alfaro ◽  
Juan A. Aledo ◽  
José A. Gámez
Keyword(s):  
Graphical Models ◽  
Probabilistic Models ◽  
Naive Bayes ◽  
Probabilistic Graphical Models ◽  
Naïve Bayes ◽  
Machine Learning Algorithms ◽  
Multivariate Gaussian Distribution ◽  
Ranking Problem ◽  
Hidden Variable ◽  
Label Ranking

The goal of the Label Ranking (LR) problem is to learn preference models that predict the preferred ranking of class labels for a given unlabeled instance. Different well-known machine learning algorithms have been adapted to deal with the LR problem. In particular, fine-tuned instance-based algorithms (e.g., k-nearest neighbors) and model-based algorithms (e.g., decision trees) have performed remarkably well in tackling the LR problem. Probabilistic Graphical Models (PGMs, e.g., Bayesian networks) have not been considered to deal with this problem because of the difficulty of modeling permutations in that framework. In this paper, we propose a Hidden Naive Bayes classifier (HNB) to cope with the LR problem. By introducing a hidden variable, we can design a hybrid Bayesian network in which several types of distributions can be combined: multinomial for discrete variables, Gaussian for numerical variables, and Mallows for permutations. We consider two kinds of probabilistic models: one based on a Naive Bayes graphical structure (where only univariate probability distributions are estimated for each state of the hidden variable) and another where we allow interactions among the predictive attributes (using a multivariate Gaussian distribution for the parameter estimation). The experimental evaluation shows that our proposals are competitive with the start-of-the-art algorithms in both accuracy and in CPU time requirements.

scholarly journals Prediction of Heart Disease Using Machine Learning Algorithms

2018 ◽  
Vol 7 (2.32) ◽  
pp. 363 ◽  
Author(s):  
N Rajesh ◽  
Maneesha T ◽  
Shaik Hafeez ◽  
Hari Krishna
Keyword(s):  
Risk Factors ◽  
Heart Disease ◽  
Decision Trees ◽  
Naive Bayes ◽  
Heart Diseases ◽  
Naïve Bayes ◽  
Machine Learning Algorithms ◽  
Common Disease ◽  
Bayes Algorithm ◽  
The One

Heart disease is the one of the most common disease. This disease is quite common now a days we used different attributes which can relate to this heart diseases well to find the better method to predict and we also used algorithms for prediction. Naive Bayes, algorithm is analyzed on dataset based on risk factors. We also used decision trees and combination of algorithms for the prediction of heart disease based on the above attributes. The results shown that when the dataset is small naive Bayes algorithm gives the accurate results and when the dataset is large decision trees gives the accurate results.  

scholarly journals Predicting Student’s Performance Using Machine Learning Algorithm

2021 ◽  
pp. 53-58
Author(s):  
Sheela Rani P ◽  
Dhivya S ◽  
Dharshini Priya M ◽  
Dharmila Chowdary A
Keyword(s):  
Machine Learning ◽  
Support Vector Machine ◽  
Prediction Model ◽  
Naive Bayes ◽  
Learning Algorithm ◽  
Naïve Bayes ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Learning Approaches ◽  
K Nearest Neighbors

Machine learning is a new analysis discipline that uses knowledge to boost learning, optimizing the training method and developing the atmosphere within which learning happens. There square measure 2 sorts of machine learning approaches like supervised and unsupervised approach that square measure accustomed extract the knowledge that helps the decision-makers in future to require correct intervention. This paper introduces an issue that influences students' tutorial performance prediction model that uses a supervised variety of machine learning algorithms like support vector machine , KNN(k-nearest neighbors), Naïve Bayes and supplying regression and logistic regression. The results supported by various algorithms are compared and it is shown that the support vector machine and Naïve Bayes performs well by achieving improved accuracy as compared to other algorithms. The final prediction model during this paper may have fairly high prediction accuracy .The objective is not just to predict future performance of students but also provide the best technique for finding the most impactful features that influence student’s while studying.

scholarly journals Cyber Bullying Detection for Twitter Using ML Classification Algorithms

2021 ◽  
Vol 9 (11) ◽  
pp. 24-29
Author(s):  
Muskan Patidar
Keyword(s):  
Machine Learning ◽  
Social Media ◽  
Natural Language ◽  
Naive Bayes ◽  
Learning Algorithms ◽  
Naïve Bayes ◽  
Cyber Bullying ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Classification Algorithms

Abstract: Social networking platforms have given us incalculable opportunities than ever before, and its benefits are undeniable. Despite benefits, people may be humiliated, insulted, bullied, and harassed by anonymous users, strangers, or peers. Cyberbullying refers to the use of technology to humiliate and slander other people. It takes form of hate messages sent through social media and emails. With the exponential increase of social media users, cyberbullying has been emerged as a form of bullying through electronic messages. We have tried to propose a possible solution for the above problem, our project aims to detect cyberbullying in tweets using ML Classification algorithms like Naïve Bayes, KNN, Decision Tree, Random Forest, Support Vector etc. and also we will apply the NLTK (Natural language toolkit) which consist of bigram, trigram, n-gram and unigram on Naïve Bayes to check its accuracy. Finally, we will compare the results of proposed and baseline features with other machine learning algorithms. Findings of the comparison indicate the significance of the proposed features in cyberbullying detection. Keywords: Cyber bullying, Machine Learning Algorithms, Twitter, Natural Language Toolkit

scholarly journals Structural Health Monitoring using Varied Machine Learning Algorithms

2018 ◽  
Vol 7 (3.12) ◽  
pp. 793 ◽  
Author(s):  
B Shanthi ◽  
Mahalakshmi N ◽  
Shobana M
Keyword(s):  
Machine Learning ◽  
Structural Health Monitoring ◽  
Health Monitoring ◽  
Naive Bayes ◽  
Learning Algorithms ◽  
Naïve Bayes ◽  
Machine Learning Algorithms ◽  
Classification Algorithms ◽  
Structural Health

Structural Health Monitoring is essential in today’s world where large amount of money and labour are involved in building a structure. There arises a need to periodically check whether the built structure is strong and flawless, also how long it will be strong and if not how much it is damaged. These information are needed so that the precautions can be made accordingly. Otherwise, it may result in disastrous accidents which may take away even human lives. There are various methods to evaluate a structure. In this paper, we apply various classification algorithms like J48, Naive Bayes and many other classifiers available, to the dataset to check on the accuracy of the prediction determined by all of these classification algorithms and ar-rive at the conclusion of the best possible classifier to say whether a structure is damaged or not.  

scholarly journals Evaluation of Prognosis in Nasopharyngeal Cancer Using Machine Learning

2020 ◽  
Vol 19 ◽  
pp. 153303382090982
Author(s):  
Melek Akcay ◽  
Durmus Etiz ◽  
Ozer Celik ◽  
Alaattin Ozen
Keyword(s):  
Machine Learning ◽  
Logistic Regression ◽  
Naive Bayes ◽  
Nasopharyngeal Cancer ◽  
Naïve Bayes ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Tumor Diameter ◽  
Survival Prognosis ◽  
Data Set

Background and Aim: Although the prognosis of nasopharyngeal cancer largely depends on a classification based on the tumor-lymph node metastasis staging system, patients at the same stage may have different clinical outcomes. This study aimed to evaluate the survival prognosis of nasopharyngeal cancer using machine learning. Settings and Design: Original, retrospective. Materials and Methods: A total of 72 patients with a diagnosis of nasopharyngeal cancer who received radiotherapy ± chemotherapy were included in the study. The contribution of patient, tumor, and treatment characteristics to the survival prognosis was evaluated by machine learning using the following techniques: logistic regression, artificial neural network, XGBoost, support-vector clustering, random forest, and Gaussian Naive Bayes. Results: In the analysis of the data set, correlation analysis, and binary logistic regression analyses were applied. Of the 18 independent variables, 10 were found to be effective in predicting nasopharyngeal cancer-related mortality: age, weight loss, initial neutrophil/lymphocyte ratio, initial lactate dehydrogenase, initial hemoglobin, radiotherapy duration, tumor diameter, number of concurrent chemotherapy cycles, and T and N stages. Gaussian Naive Bayes was determined as the best algorithm to evaluate the prognosis of machine learning techniques (accuracy rate: 88%, area under the curve score: 0.91, confidence interval: 0.68-1, sensitivity: 75%, specificity: 100%). Conclusion: Many factors affect prognosis in cancer, and machine learning algorithms can be used to determine which factors have a greater effect on survival prognosis, which then allows further research into these factors. In the current study, Gaussian Naive Bayes was identified as the best algorithm for the evaluation of prognosis of nasopharyngeal cancer.

scholarly journals Mobile Money Fraud Prediction—A Cross-Case Analysis on the Efficiency of Support Vector Machines, Gradient Boosted Decision Trees, and Naïve Bayes Algorithms

Information ◽  
2020 ◽  
Vol 11 (8) ◽  
pp. 383
Author(s):  
Francis Effirim Botchey ◽  
Zhen Qin ◽  
Kwesi Hughes-Lartey
Keyword(s):  
Developing Countries ◽  
Support Vector Machines ◽  
Decision Tree ◽  
Naive Bayes ◽  
Naïve Bayes ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Mobile Money ◽  
Vector Machines ◽  
Boosted Decision Tree

The onset of COVID-19 has re-emphasized the importance of FinTech especially in developing countries as the major powers of the world are already enjoying the advantages that come with the adoption of FinTech. Handling of physical cash has been established as a means of transmitting the novel corona virus. Again, research has established that, been unbanked raises the potential of sinking one into abject poverty. Over the years, developing countries have been piloting the various forms of FinTech, but the very one that has come to stay is the Mobile Money Transactions (MMT). As mobile money transactions attempt to gain a foothold, it faces several problems, the most important of them is mobile money fraud. This paper seeks to provide a solution to this problem by looking at machine learning algorithms based on support vector machines (kernel-based), gradient boosted decision tree (tree-based) and Naïve Bayes (probabilistic based) algorithms, taking into consideration the imbalanced nature of the dataset. Our experiments showed that the use of gradient boosted decision tree holds a great potential in combating the problem of mobile money fraud as it was able to produce near perfect results.

scholarly journals A DISCRETIZATION METHOD BASED ON MAXIMIZING THE AREA UNDER RECEIVER OPERATING CHARACTERISTIC CURVE

2013 ◽  
Vol 27 (01) ◽  
pp. 1350002 ◽  
Author(s):  
MURAT KURTCEPHE ◽  
H. ALTAY GÜVENIR
Keyword(s):  
Roc Curve ◽  
Naive Bayes ◽  
Characteristic Curve ◽  
Naïve Bayes ◽  
Machine Learning Algorithms ◽  
Discretization Method ◽  
Operating Characteristics ◽  
Discretization Methods ◽  
Real World Datasets ◽  
Receiver Operating

Many machine learning algorithms require the features to be categorical. Hence, they require all numeric-valued data to be discretized into intervals. In this paper, we present a new discretization method based on the receiver operating characteristics (ROC) Curve (AUC) measure. Maximum area under ROC curve-based discretization (MAD) is a global, static and supervised discretization method. MAD uses the sorted order of the continuous values of a feature and discretizes the feature in such a way that the AUC based on that feature is to be maximized. The proposed method is compared with alternative discretization methods such as ChiMerge, Entropy-Minimum Description Length Principle (MDLP), Fixed Frequency Discretization (FFD), and Proportional Discretization (PD). FFD and PD have been recently proposed and are designed for Naïve Bayes learning. ChiMerge is a merging discretization method as the MAD method. Evaluations are performed in terms of M-Measure, an AUC-based metric for multi-class classification, and accuracy values obtained from Naïve Bayes and Aggregating One-Dependence Estimators (AODE) algorithms by using real-world datasets. Empirical results show that MAD is a strong candidate to be a good alternative to other discretization methods.

scholarly journals Comparative analysis on bayesian classification for breast cancer problem

2019 ◽  
Vol 8 (4) ◽  
Author(s):  
Wan Nor Liyana Wan Hassan Ibeni ◽  
Mohd Zaki Mohd Salikon ◽  
Aida Mustapha ◽  
Saiful Adli Daud ◽  
Mohd Najib Mohd Salleh
Keyword(s):  
Breast Cancer ◽  
Bayesian Networks ◽  
Nearest Neighbor ◽  
Naive Bayes ◽  
Likelihood Estimation ◽  
Predictive Distribution ◽  
Naïve Bayes ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
K Nearest Neighbor

The problem of imbalanced class distribution or small datasets is quite frequent in certain fields especially in medical domain. However, the classical Naive Bayes approach in dealing with uncertainties within medical datasets face with the difficulties in selecting prior distributions, whereby parameter estimation such as the maximum likelihood estimation (MLE) and maximum a posteriori (MAP) often hurt the accuracy of predictions. This paper presents the full Bayesian approach to assess the predictive distribution of all classes using three classifiers; naïve bayes (NB), bayesian networks (BN), and tree augmented naïve bayes (TAN) with three datasets; Breast cancer, breast cancer wisconsin, and breast tissue dataset. Next, the prediction accuracies of bayesian approaches are also compared with three standard machine learning algorithms from the literature; K-nearest neighbor (K-NN), support vector machine (SVM), and decision tree (DT). The results showed that the best performance was the bayesian networks (BN) algorithm with accuracy of 97.281%. The results are hoped to provide as base comparison for further research on breast cancer detection. All experiments are conducted in WEKA data mining tool.

Sign in / Sign up

Export Citation Format

Share Document