Silahtaro?lu G.2024-03-132024-03-1320092010-376Xhttps://hdl.handle.net/20.500.12662/3230Decision tree algorithms have very important place at classification model of data mining. In literature, algorithms use entropy concept or gini index to form the tree. The shape of the classes and their closeness to each other some of the factors that affect the performance of the algorithm. In this paper we introduce a new decision tree algorithm which employs data (attribute) folding method and variation of the class variables over the branches to be created. A comparative performance analysis has been held between the proposed algorithm and C4.5.eninfo:eu-repo/semantics/closedAccessClassificationDecision treeEntropyGiniPruningSplitArticle2-s2.0-78651560851306N/A30256