<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Candidate-Elimination on felladog</title><link>https://utsavdarlami.github.io/blogs/tags/candidate-elimination/</link><description>Recent content in Candidate-Elimination on felladog</description><generator>Hugo -- gohugo.io</generator><language>en</language><lastBuildDate>Fri, 30 Jul 2021 12:25:36 +0545</lastBuildDate><atom:link href="https://utsavdarlami.github.io/blogs/tags/candidate-elimination/index.xml" rel="self" type="application/rss+xml"/><item><title>concept learning</title><link>https://utsavdarlami.github.io/blogs/notes/2021-06-04--14-08-26z--concept_learning/</link><pubDate>Fri, 04 Jun 2021 19:53:00 +0545</pubDate><guid>https://utsavdarlami.github.io/blogs/notes/2021-06-04--14-08-26z--concept_learning/</guid><description>References : Reading: Tom Mitchell Lectures slides of chapter 2 Tom Mitchell, Machine Learning Chapter 2 To Read: Candidate elimination algorithm with an example Questions : Inferring boolean valued function from training examples of its input and outputs. A problem of searching through a predefined space of potential hypotheses for the hypothesis that best fits the training examples Example Traget concept or function: Concept or function to be learned. For our example - &amp;ldquo;days on which &amp;ldquo;A&amp;rdquo; can enjoy water sport&amp;rdquo;, EnjoySport Denoted by \(c\) c can be any boolean valued function defined over the instances X; \( c : X \rightarrow \{ 0,1 \} \) Instances The set of items over which the concept is defined.</description></item></channel></rss>