<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
	<channel>
		<title>Ml-Class on Dr. Hitesh Sarda</title>
		<link>https://hitesh.in/tags/ml-class/</link>
		<description>Recent content in Ml-Class on Dr. Hitesh Sarda</description>
		<generator>Hugo</generator>
		<language>en-US</language>
		
		
		
		
			<lastBuildDate>Fri, 30 Dec 2011 00:00:00 +0000</lastBuildDate>
		
			<atom:link href="https://hitesh.in/tags/ml-class/index.xml" rel="self" type="application/rss+xml" />
			<item>
				<title>Logistic regression</title>
				<link>https://hitesh.in/2011/logistic-regression/</link>
				<pubDate>Fri, 30 Dec 2011 00:00:00 +0000</pubDate>
				<guid>https://hitesh.in/2011/logistic-regression/</guid>
				<description>&lt;p&gt;Logistic regression is used to classify things into positive case or negative case. It is a special case of linear regression which outputs value between 0 and 1, which denote the probability or the likelihood of the given sample being positive. For e.g. what is the probability of the given email being a spam?&lt;/p&gt;&#xA;&lt;p&gt;We can then predict a positive case if the hypothesis outputs a value above a certain threshold, which normally is 0.5 but could be more or less. The ideal threshold can be derived based on the cross validation result. More on this in a later post.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Linear regression</title>
				<link>https://hitesh.in/2011/linear-regression/</link>
				<pubDate>Tue, 27 Dec 2011 00:00:00 +0000</pubDate>
				<guid>https://hitesh.in/2011/linear-regression/</guid>
				<description>&lt;p&gt;Linear regression is a fancy name to a simple technique. This algorithm (model) predicts the most likely result (&lt;strong&gt;y&lt;/strong&gt;) given the input features (&lt;strong&gt;x&lt;/strong&gt;). To be able to predict, the model needs (lots of) historical data with the correct output (thus it is supervised learning).&lt;/p&gt;&#xA;&lt;p&gt;This model finds weights (&lt;strong&gt;θ&lt;/strong&gt;) to be assigned to each feature, such that sum of the weighted features is closest to the given answer &lt;strong&gt;y&lt;/strong&gt;.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Machine Learning: My notes.</title>
				<link>https://hitesh.in/2011/machine-learning-my-notes./</link>
				<pubDate>Sat, 24 Dec 2011 00:00:00 +0000</pubDate>
				<guid>https://hitesh.in/2011/machine-learning-my-notes./</guid>
				<description>&lt;p&gt;I recently finished the &lt;a href=&#34;http://www.ml-class.org/&#34;&gt;machine learning class&lt;/a&gt; offered online by Stanford. It was a great experience. Since I would not be using ML any time soon, I plan to make a few blog posts to capture my learning while they are still current. This should help me recollect the concepts on a later date. If someone finds these notes useful, that is an added benefit.&lt;/p&gt;&#xA;&lt;h2 id=&#34;machine-learning&#34;&gt;Machine learning&lt;/h2&gt;&#xA;&lt;p&gt;Arthur Samuel (1959): Field of study that gives computers the ability to learn without being explicitly programmed.&lt;/p&gt;</description>
			</item>
	</channel>
</rss>
