On Conditional Branches in Optimal Decision Trees
From Google TechTalks · 44:13
Show by Google TechTalks
Google Tech Talks February 8, 2007AbstractDecision trees are one of the most fundamental programming abstractions, and a commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) "less than"/"greater than or equal to" tests in order to determine an outcome event. The process of finding an optimal alphabetic binary tree for a known probabily distribution on outcome events usually has the underlying assumption that the cost per decision is uniform and thus independent of the outcome of the decision. Algorithms without this assumption generally use one cost if the decision result is "less than" and another cost if it is "greater than." In practice,...Uploaded 08-10-07
More episodes of Google TechTalks
More episodes
- Threat Models for Memorization: Privacy, Copyright, and Everything In-Between
- Technology Assisted Reading Acquisition: Children Acquiring Literacy Naturally
- sex on the internet, the realities of porn, sexual privacy,
- Privacy Auditing of Large Language Models
- The Limits and Possibilities of One Run Auditing
- PhotoTechEDU Day 29: Photographing VR Panoramas
- Privacy Ripple Effects from Adding or Removing Personal Information in Language Model Training
- Inside VMware Fusion
- Java Posse Episode 100 (Live Special)
- Cascading Adversarial Bias from Injection to Distillation in Language Models
PodSearch is a free, independent podcast search engine. Read about PodSearch, the privacy policy or contact us.