Soft decision trees
Künye
İrsoy, O., Yıldız, O. T. & Alpaydın, A. İ. E. (2012). Soft decision trees. Paper presented at the International Conference on Pattern Recognition, 1819-1822.Özet
We discuss a novel decision tree architecture with soft decisions at the internal nodes where we choose both children with probabilities given by a sigmoid gating function. Our algorithm is incremental where new nodes are added when needed and parameters are learned using gradient-descent. We visualize the soft tree fit on a toy data set and then compare it with the canonical, hard decision tree over ten regression and classification data sets. Our proposed model has significantly higher accuracy using fewer nodes.
Kaynak
International Conference on Pattern RecognitionBağlantı
https://hdl.handle.net/11729/1649İlgili Öğeler
Başlık, yazar, küratör ve konuya göre gösterilen ilgili öğeler.
-
Fast inter-mode decision and selective quarter-pel refinement in H.264 video coding
Ateş, Hasan Fehmi (IEEE, 2008)In H.264 video coding standard, there exist several inter - prediction modes that use macroblock partitions with variable block sizes. Choosing a rate-distortion optimal coding mode for each macroblock is essential for the ... -
Parallel univariate decision trees
Yıldız, Olcay Taner; Dikmen, Onur (Elsevier B.V., 2007-05-01)Univariate decision tree algorithms are widely used in data mining because (i) they are easy to learn (ii) when trained they can be expressed in rule based manner. In several applications mainly including data mining, the ... -
Regularizing soft decision trees
Yıldız, Olcay Taner; Alpaydın, Ahmet İbrahim Ethem (Springer, 2013)Recently, we have proposed a new decision tree family called soft decision trees where a node chooses both its left and right children with different probabilities as given by a gating function, different from a hard ...