Soft decision trees
dc.authorid | 0000-0001-5838-4615 | |
dc.authorid | 0000-0001-7506-0321 | |
dc.contributor.author | İrsoy, Ozan | en_US |
dc.contributor.author | Yıldız, Olcay Taner | en_US |
dc.contributor.author | Alpaydın, Ahmet İbrahim Ethem | en_US |
dc.date.accessioned | 2019-06-28T12:41:13Z | |
dc.date.available | 2019-06-28T12:41:13Z | |
dc.date.issued | 2012 | |
dc.department | Işık Üniversitesi, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümü | en_US |
dc.department | Işık University, Faculty of Engineering, Department of Computer Engineering | en_US |
dc.description.abstract | 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. | en_US |
dc.description.sponsorship | This work is supported by TUBITAK 109E186 and Bogazici University Scientific Research Project BAP5701. | en_US |
dc.description.version | Publisher's Version | en_US |
dc.identifier.citation | İ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. | en_US |
dc.identifier.endpage | 1822 | |
dc.identifier.isbn | 9784990644109 | |
dc.identifier.isbn | 9781467322164 | |
dc.identifier.issn | 1051-4651 | |
dc.identifier.scopusquality | 2-s2.0-84874569105 | |
dc.identifier.scopusquality | N/A | |
dc.identifier.startpage | 1819 | |
dc.identifier.uri | https://hdl.handle.net/11729/1649 | |
dc.identifier.wos | WOS:000343660601224 | |
dc.identifier.wosquality | N/A | |
dc.indekslendigikaynak | Web of Science | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.indekslendigikaynak | Conference Proceedings Citation Index – Science (CPCI-S) | en_US |
dc.institutionauthor | Yıldız, Olcay Taner | en_US |
dc.institutionauthorid | 0000-0001-5838-4615 | |
dc.language.iso | en | en_US |
dc.peerreviewed | Yes | en_US |
dc.publicationstatus | Published | en_US |
dc.publisher | IEEE | en_US |
dc.relation.ispartof | International Conference on Pattern Recognition | en_US |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Regression tree analysis | en_US |
dc.subject | Accuracy | en_US |
dc.subject | Training | en_US |
dc.subject | Pattern recognition | en_US |
dc.subject | Educational institutions | en_US |
dc.subject | Interpolation | en_US |
dc.subject | Data visualisation | en_US |
dc.subject | Decision trees | en_US |
dc.subject | Gradient methods | en_US |
dc.subject | Pattern classification | en_US |
dc.subject | Probability | en_US |
dc.subject | Regression analysis | en_US |
dc.subject | Soft decision tree architecture | en_US |
dc.subject | Internal nodes | en_US |
dc.subject | Probabilities | en_US |
dc.subject | Sigmoid gating function | en_US |
dc.subject | Incremental algorithm | en_US |
dc.subject | Gradient-descent algorithm | en_US |
dc.subject | Toy data set | en_US |
dc.subject | Regression data sets | en_US |
dc.subject | Classification data sets | en_US |
dc.subject | Classification (of information) | en_US |
dc.subject | Data mining | en_US |
dc.subject | Gating functions | en_US |
dc.subject | Gradient-descent | en_US |
dc.subject | Hard decisions | en_US |
dc.subject | Soft decision | en_US |
dc.subject | Toy data | en_US |
dc.subject | Tree architectures | en_US |
dc.title | Soft decision trees | en_US |
dc.type | Conference Object | en_US |
dspace.entity.type | Publication |