Implementation of Multivariate Data Set by Cart Algorithm
نویسنده
چکیده
Data mining deals with various applications such as the discovery of hidden knowledge, unexpected patterns and new rules from large Databases that guide to make decisions about enterprise to products and services competitive. Basically, data mining is concerned with the analysis of data and the use of software techniques for finding patterns and regularities in sets of data. Data Mining, which is known as knowledge discovery in databases has been defined as the nontrivial extraction of implicit, previous unknown and potentially useful information from data. In this paper CART Algorithm is presented which is well known for classification task of the datamining.CART is one of the best known methods for machine learning and computer statistical representation. In CART Result is represented in the form of Decision tree diagram or by flow chart. This paper shows results of multivariate dataset Classification by CART Algorithm. Multivariate dataset Encompassing the Simultaneous observation and analysis of more than one statistical variable.
منابع مشابه
Rough Set Approach to Multivariate Decision Trees Inducing
Aimed at the problem of huge computation, large tree size and over-fitting of the testing data for multivariate decision tree (MDT) algorithms, we proposed a novel roughset-based multivariate decision trees (RSMDT) method. In this paper, the positive region degree of condition attributes with respect to decision attributes in rough set theory is used for selecting attributes in multivariate tes...
متن کاملModels to predict cardiovascular risk: comparison of CART, multilayer perceptron and logistic regression
The estimate of a multivariate risk is now required in guidelines for cardiovascular prevention. Limitations of existing statistical risk models lead to explore machine-learning methods. This study evaluates the implementation and performance of a decision tree (CART) and a multilayer perceptron (MLP) to predict cardiovascular risk from real data. The study population was randomly splitted in a...
متن کاملA Clustering Approach by SSPCO Optimization Algorithm Based on Chaotic Initial Population
Assigning a set of objects to groups such that objects in one group or cluster are more similar to each other than the other clusters’ objects is the main task of clustering analysis. SSPCO optimization algorithm is anew optimization algorithm that is inspired by the behavior of a type of bird called see-see partridge. One of the things that smart algorithms are applied to solve is the problem ...
متن کاملA New Bootstrap Based Algorithm for Hotelling’s T2 Multivariate Control Chart
Normality is a common assumption for many quality control charts. One should expect misleading results once this assumption is violated. In order to avoid this pitfall, we need to evaluate this assumption prior to the use of control charts which require normality assumption. However, in certain cases either this assumption is overlooked or it is hard to check. Robust control charts and bootstra...
متن کاملS3PSO: Students’ Performance Prediction Based on Particle Swarm Optimization
Nowadays, new methods are required to take advantage of the rich and extensive gold mine of data given the vast content of data particularly created by educational systems. Data mining algorithms have been used in educational systems especially e-learning systems due to the broad usage of these systems. Providing a model to predict final student results in educational course is a reason for usi...
متن کامل