Paper Info
Title
Resolving The Conflicts Between Cuts In A Decision Tree With Verifying Cuts
Abstract
A decision tree with verifying cuts, called V-tree, uses additional knowledge encoded in many attributes to classify new objects. The purpose of the verifying cuts is to confirm the correctness of the partitioning of tree nodes based on the (semi)-optimal cut determined by a greedy approach. The confirmation may be relevant because for some new objects there are discrepancies in the class prediction on the basis of the individual verifying cuts. In this paper we present a new method for resolving conflicts between cuts assigned to node. The method uses an additional local discretization classifier in each node where there is a conflict between the cuts. The paper includes the results of experiments performed on data sets from a biomedical database and machine learning repositories. In order to evaluate the presented method, we compared its performance with the classification results of a local discretization decision tree, well known from literature and called here C-tree, as well as a V-tree with previous simple conflict resolution method. Our new approach outperforms the C-tree, although it does not produce better results than V-tree with simple method of conflict resolution for the surveyed data sets. However, the proposed method is a step toward a deeper analysis of conflicts between rules.
Year
DOI
Venue
2017
10.1007/978-3-319-60840-2_30
ROUGH SETS, IJCRS 2017, PT II
Keywords
Field
DocType
Rough sets, Discretization, Classifiers, Conflict resolution
Decision tree,Data mining,Discretization,Data set,Computer science,Correctness,Conflict resolution,Rough set,Classifier (linguistics)
Conference
Volume
ISSN
Citations 
10314
0302-9743
0
PageRank 
References 
Authors
0.34
7
6
Name
Order
Citations
PageRank
Sylwia Buregwa-Czuma1173.52
Jan G. Bazan229122.71
Stanislawa Bazan-Socha3385.32
Wojciech Rzasa49413.42
Lukasz Dydo561.96
Andrzej Skowron65062421.31