1 Ocak 2012 Konferans bildirisi Açık Erişim

Irsoy, Ozan; Yildiz, Olcay Taner; Alpaydin, Ethem

Dublin Core

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Irsoy, Ozan</dc:creator>
  <dc:creator>Yildiz, Olcay Taner</dc:creator>
  <dc:creator>Alpaydin, Ethem</dc:creator>
  <dc:date>2012-01-01</dc:date>
  <dc:description>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.</dc:description>
  <dc:identifier>https://aperta.ulakbim.gov.trrecord/86775</dc:identifier>
  <dc:identifier>oai:zenodo.org:86775</dc:identifier>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>http://www.opendefinition.org/licenses/cc-by</dc:rights>
  <dc:title>Soft Decision Trees</dc:title>
  <dc:type>info:eu-repo/semantics/conferencePaper</dc:type>
  <dc:type>publication-conferencepaper</dc:type>
</oai_dc:dc>