The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Decision trees induction is among powerful and commonly encountered architecture for extracting of classification knowledge from datasets of labeled instances. However, learning decision trees from large irrelevant datasets is quite different from learning small and moderate sized datasets. In this paper, we propose a simple yet effective composite splitting criterion equal to a random sampling approach...
The ever growing presence of data led to a large number of proposed algorithms for classification and especially decision trees over the last years. Recently, it has been shown that decision trees outperform traditional approaches also on limited data. Therefore, increasing the decision tree classification accuracy yields better performance on both huge and moderate sized datasets. This paper proposes...
In this work we investigate several issues in order to improve the performance of decision trees. Firstly, we introduced or adopt a new composite splitting criterion aimed to improve classification accuracy. Secondly, we derive a new pruning technique using expert knowledge, which is able to significantly reduce the size of tree without degrading the classification accuracy. Finally, we implemented...
In this paper, we present a practical algorithm to deal with the data specific classification problem when there are datasets with different properties. We proposed to integrate error rate, missing values and expert judgment as factors for determining data specific pruning to form Expert Knowledge Based Pruning (EKBP). We conduct an extensive experimental study on openly available 40 real world datasets...
In this paper, we propose a new pruning method which is a combination of pre-pruning and post-pruning, aiming on both classification accuracy and tree size. Based upon this method, we induce a decision tree. The experimental results are computed by using 18 benchmark datasets from UCI Machine Learning Repository. The results, when compared to benchmark algorithms, indicate that our new tree pruning...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.