Aggregating One-Dependence Estimators Research Articles

Spatial Prediction of Rainfall-Induced Landslides Using Aggregating One-Dependence Estimators Classifier

In this study, the spatial prediction of rainfall-induced landslides at the Pauri Gahwal area, Uttarakhand, India has been done using Aggregating One-Dependence Estimators (AODE) classifier which has not been applied earlier for landslide problems. Historical landslide locations have been collated with a set of influencing factors for landslide spatial analysis. The performance of the AODE model has been assessed using statistical analyzing methods and receiver operating characteristic curve technique. The predictive capability of the AODE model has also been compared with other popular landslide models namely Support Vector Machines (SVM), Radial Basis Function Neural Network (ANN-RBF), Logistic Regression (LR), and Naive Bayes (NB). The result of analysis illustrates that the AODE model has highest predictability, followed by the SVM model, the ANN-RBF model, the LR model, and the NB model, respectively. Thus AODE is a promising method for the development of better landslide susceptibility map for proper landslide hazard management.

COMPARATIVE STUDY: FEATURE SELECTION METHODS IN THE BLENDED LEARNING ENVIRONMENT

Research presented in this paper deals with the unknown behavior pattern of students in the blended learning environment. In order to improve prediction accuracy it was necessary to determine the methodology for students` activities assessments. The Training set was created by combining distributed sources – Moodle database and traditional learning process. The methodology emphasizes data mining preprocessing phase: transformation and features selection. Information gain, Symmetrical Uncert Feature Eval, RelieF, Correlation based Feature Selection, Wrapper Subset Evaluation, Classifier Subset Evaluator features selection methods were implemented to find the most relevant subset. Statistical dependence was determined by calculating mutual information measure. Naïve Bayes, Aggregating One-Dependence Estimators, Decision tree and Support Vector Machines classifiers have been trained for subsets with different cardinality. Models were evaluated with comparative analysis of statistical parameters and time required to build them. We have concluded that the RelieF, Wrapper Subset Evaluation and mutual information present the most convenient features selection methods for blended learning environment. The major contribution of the presented research is selecting the optimal low-cardinal subset of students’ activities and a significant prediction accuracy improvement in blended learning environment.

Towards the integration of multiple classifier pertaining to the Student's performance prediction

Summary Accurate predictions of students’ academic performance at early stages of the degree programme helps in identification of the weak students and enable management to take the corrective actions to prevent them from failure. Existing single classifier based predictive modelling is not easily scalable from one context to another context, Moreover, a predictive model developed for a particular course at a particular institution may not be valid for a different course at the same institution or any other institution. With this necessity, the notion of the integrated multiple classifiers for the predictions of students’ academic performance is proposed in this article. The integrated classifier consists of three complementary algorithms, namely Decision Tree, K-Nearest Neighbour, and Aggregating One-Dependence Estimators (AODE). A product of probability combining rule is employed to integrate the multiple classifiers for the prediction of academic performance of the engineering students. This approach provides a generalized solution for student performance prediction. The proposed method has been applied and compared on three student performance datasets using t-test. The proposed method is also compared with KSTAR, OneR, ZeroR, Naive Bayes, and NB tree classifiers as well as with the individual classifiers.

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

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.

Handling numeric attributes when comparing Bayesian network classifiers: does the discretization method matter?

Within the framework of Bayesian networks (BNs), most classifiers assume that the variables involved are of a discrete nature, but this assumption rarely holds in real problems. Despite the loss of information discretization entails, it is a direct easy-to-use mechanism that can offer some benefits: sometimes discretization improves the run time for certain algorithms; it provides a reduction in the value set and then a reduction in the noise which might be present in the data; in other cases, there are some Bayesian methods that can only deal with discrete variables. Hence, even though there are many ways to deal with continuous variables other than discretization, it is still commonly used. This paper presents a study of the impact of using different discretization strategies on a set of representative BN classifiers, with a significant sample consisting of 26 datasets. For this comparison, we have chosen Naive Bayes (NB) together with several other semi-Naive Bayes classifiers: Tree-Augmented Naive Bayes (TAN), k-Dependence Bayesian (KDB), Aggregating One-Dependence Estimators (AODE) and Hybrid AODE (HAODE). Also, we have included an augmented Bayesian network created by using a hill climbing algorithm (BNHC). With this comparison we analyse to what extent the type of discretization method affects classifier performance in terms of accuracy and bias-variance discretization. Our main conclusion is that even if a discretization method produces different results for a particular dataset, it does not really have an effect when classifiers are being compared. That is, given a set of datasets, accuracy values might vary but the classifier ranking is generally maintained. This is a very useful outcome, assuming that the type of discretization applied is not decisive future experiments can be d times faster, d being the number of discretization methods considered.