Introduction of pruning based on measures of association in the expansion phase of the induction algorithm CART: a case study of pre-university orientation for Sidi Mohamed Ben Abdelah University Online publication date: Tue, 08-Aug-2017
by Imane Satauri; Omar El Beqqali
International Journal of Society Systems Science (IJSSS), Vol. 9, No. 2, 2017
Abstract: Determining the right size of the tree is a crucial operation in the construction of a decision tree on the basis of a large volume of data. It largely determines its performance during its deployment in the population. This, in fact, considers the avoidance of two extremes: the sub-study, defined by a reduced tree, poorly capturing relevant information of the learning data; the over-learning, defined by an exaggerated size of the tree, capturing the specifics of the learning data, characteristics that can not be transposed in the population. In both cases, we have a less performing prediction model. This paper presents an approach of indirect pre-pruning introduced within the algorithm classification and regression tree (CART) expansion phase; it is based on the rules generated from the decision tree and uses validation criteria inspired from the data mining techniques to discover association rules.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Society Systems Science (IJSSS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook