dc.contributor.author | Yıldız, Olcay Taner | en_US |
dc.contributor.author | Alpaydın, Ahmet İbrahim Ethem | en_US |
dc.date.accessioned | 2015-07-14T23:46:48Z | |
dc.date.available | 2015-07-14T23:46:48Z | |
dc.date.issued | 2013 | |
dc.identifier.citation | Yıldız, O. T. & Alpaydın, A. İ. E. (2014). Regularizing soft decision trees. Paper presented at the Lecture Notes in Electrical Engineering, 264, 15-21. doi:10.1007/978-3-319-01604-7_2 | en_US |
dc.identifier.isbn | 9783319016047 | |
dc.identifier.isbn | 9783319016030 | |
dc.identifier.issn | 1876-1100 | |
dc.identifier.issn | 1876-1119 | |
dc.identifier.uri | https://hdl.handle.net/11729/604 | |
dc.identifier.uri | http://dx.doi.org/10.1007/978-3-319-01604-7_2 | |
dc.description.abstract | 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 decision node which chooses one of the two. In this paper, we extend the original algorithm by introducing local dimension reduction via L-1 and L-2 regularization for feature selection and smoother fitting. We compare our novel approach with the standard decision tree algorithms over 27 classification data sets. We see that both regularized versions have similar generalization ability with less complexity in terms of number of nodes, where L-2 seems to work slightly better than L-1. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Springer | en_US |
dc.relation.isversionof | 10.1007/978-3-319-01604-7_2 | |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Algorithms | en_US |
dc.subject | Classification (of information) | en_US |
dc.subject | Data mining | en_US |
dc.subject | Information science | en_US |
dc.subject | Decision-tree algorithm | en_US |
dc.subject | Dimension reduction | en_US |
dc.subject | Gating functions | en_US |
dc.subject | Generalization ability | en_US |
dc.subject | Hard decisions | en_US |
dc.subject | Original algorithms | en_US |
dc.subject | Decision trees | en_US |
dc.title | Regularizing soft decision trees | en_US |
dc.type | conferenceObject | en_US |
dc.description.version | Publisher's Version | en_US |
dc.description.version | Author Post Print | en_US |
dc.relation.journal | Lecture Notes in Electrical Engineering | en_US |
dc.contributor.department | Işık Üniversitesi, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümü | en_US |
dc.contributor.department | Işık University, Faculty of Engineering, Department of Computer Engineering | en_US |
dc.contributor.authorID | 0000-0001-5838-4615 | |
dc.identifier.volume | 264 | |
dc.identifier.startpage | 15 | |
dc.identifier.endpage | 21 | |
dc.peerreviewed | Yes | en_US |
dc.publicationstatus | Published | en_US |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.contributor.institutionauthor | Yıldız, Olcay Taner | en_US |
dc.relation.index | WOS | en_US |
dc.relation.index | Scopus | en_US |
dc.relation.index | Conference Proceedings Citation Index – Science (CPCI-S) | en_US |
dc.description.wosid | WOS:000333692000002 | |