<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" media="screen" href="/~d/styles/rss2full.xsl"?><?xml-stylesheet type="text/css" media="screen" href="http://feeds.feedburner.com/~d/styles/itemcontent.css"?><rss xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:sy="http://purl.org/rss/1.0/modules/syndication/" version="2.0">
<channel>
	<title>Comments for Four Years Remaining</title>
	
	<link>http://fouryears.eu</link>
	<description>Preparing the consequences</description>
	<lastBuildDate>Sun, 19 Feb 2012 18:53:43 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.1</generator>
	<atom10:link xmlns:atom10="http://www.w3.org/2005/Atom" rel="self" type="application/rss+xml" href="http://feeds.feedburner.com/CommentsForFourYearsRemaining" /><feedburner:info xmlns:feedburner="http://rssnamespace.org/feedburner/ext/1.0" uri="commentsforfouryearsremaining" /><atom10:link xmlns:atom10="http://www.w3.org/2005/Atom" rel="hub" href="http://pubsubhubbub.appspot.com/" /><item>
		<title>Comment on ROC Area-Under-the-Curve Explained by Konstantin</title>
		<link>http://fouryears.eu/2011/10/12/roc-area-under-the-curve-explained/comment-page-1/#comment-759</link>
		<dc:creator>Konstantin</dc:creator>
		<pubDate>Sun, 19 Feb 2012 18:53:43 +0000</pubDate>
		<guid isPermaLink="false">http://fouryears.eu/?p=699#comment-759</guid>
		<description>As far as I know, ROC analysis only makes sense for binary classifiers. As soon as you have to classify things into more than two classes things become more complicated. 

Let's say you are classifying candy into "Milk", "Dark", "White" and "Other" types of chocolate. In this case it is not enough to simply have a function which ranks chocolates into some order, because, in contrast to the binary case, the rankings with respect to "milkness", "darkness" and "whiteness" do not necessarily correlate in some particular way.

There are two common ways to cast a multi-class problem in a set of binary classifications - "one versus all" and "all versus all". Those can be used both to construct multi-class classifiers from several binary classifiers and to analyze a given multi-class classifier by "decomposing" it.

In the first case ("one versus all") you take your multi-class classifier and turn it into several binary classifiers, one for each class. E.g. "milk vs non-milk", "dark vs non-dark", etc. You can then study all of those classifiers separately (e.g. compute ROC AUC, precision, recall, accuracy, for each of them). If you need to have one number in the end, you can average the results (weighted by the proportion of each class).

The second case ("all vs all") suggests you regard each pair of classes as a separate binary classification problem. E.g. you'd examine how good is your classifier at discriminating "milk vs dark", "milk vs white", "dark vs white", etc. Actually, I haven't actually seen this approach used to assess classifiers in practice, but it makes sense in theory.

Hope that relates to your question.</description>
		<content:encoded><![CDATA[<p>As far as I know, ROC analysis only makes sense for binary classifiers. As soon as you have to classify things into more than two classes things become more complicated. </p>
<p>Let&#8217;s say you are classifying candy into &#8220;Milk&#8221;, &#8220;Dark&#8221;, &#8220;White&#8221; and &#8220;Other&#8221; types of chocolate. In this case it is not enough to simply have a function which ranks chocolates into some order, because, in contrast to the binary case, the rankings with respect to &#8220;milkness&#8221;, &#8220;darkness&#8221; and &#8220;whiteness&#8221; do not necessarily correlate in some particular way.</p>
<p>There are two common ways to cast a multi-class problem in a set of binary classifications &#8211; &#8220;one versus all&#8221; and &#8220;all versus all&#8221;. Those can be used both to construct multi-class classifiers from several binary classifiers and to analyze a given multi-class classifier by &#8220;decomposing&#8221; it.</p>
<p>In the first case (&#8220;one versus all&#8221;) you take your multi-class classifier and turn it into several binary classifiers, one for each class. E.g. &#8220;milk vs non-milk&#8221;, &#8220;dark vs non-dark&#8221;, etc. You can then study all of those classifiers separately (e.g. compute ROC AUC, precision, recall, accuracy, for each of them). If you need to have one number in the end, you can average the results (weighted by the proportion of each class).</p>
<p>The second case (&#8220;all vs all&#8221;) suggests you regard each pair of classes as a separate binary classification problem. E.g. you&#8217;d examine how good is your classifier at discriminating &#8220;milk vs dark&#8221;, &#8220;milk vs white&#8221;, &#8220;dark vs white&#8221;, etc. Actually, I haven&#8217;t actually seen this approach used to assess classifiers in practice, but it makes sense in theory.</p>
<p>Hope that relates to your question.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on ROC Area-Under-the-Curve Explained by Divya</title>
		<link>http://fouryears.eu/2011/10/12/roc-area-under-the-curve-explained/comment-page-1/#comment-758</link>
		<dc:creator>Divya</dc:creator>
		<pubDate>Sun, 19 Feb 2012 18:31:33 +0000</pubDate>
		<guid isPermaLink="false">http://fouryears.eu/?p=699#comment-758</guid>
		<description>Very nice and clear explanation.
Just a question : What would happen in case you considered more than 2 ranks - say, 0,1,2.. how would you explain that ranking with ROC curves? (To make it more clear, considered rating the chocolates 'Bad' also, in addition)</description>
		<content:encoded><![CDATA[<p>Very nice and clear explanation.<br />
Just a question : What would happen in case you considered more than 2 ranks &#8211; say, 0,1,2.. how would you explain that ranking with ROC curves? (To make it more clear, considered rating the chocolates &#8216;Bad&#8217; also, in addition)</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on On Visualization and Data Analysis by Ahmad</title>
		<link>http://fouryears.eu/2012/01/23/on-visualization-and-data-analysis/comment-page-1/#comment-740</link>
		<dc:creator>Ahmad</dc:creator>
		<pubDate>Mon, 06 Feb 2012 16:16:50 +0000</pubDate>
		<guid isPermaLink="false">http://fouryears.eu/?p=878#comment-740</guid>
		<description>Nice Post! Very interesting</description>
		<content:encoded><![CDATA[<p>Nice Post! Very interesting</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on On Visualization and Data Analysis by Kevin Lynagh</title>
		<link>http://fouryears.eu/2012/01/23/on-visualization-and-data-analysis/comment-page-1/#comment-728</link>
		<dc:creator>Kevin Lynagh</dc:creator>
		<pubDate>Fri, 27 Jan 2012 16:59:31 +0000</pubDate>
		<guid isPermaLink="false">http://fouryears.eu/?p=878#comment-728</guid>
		<description>A year or so ago I applied some compressed sensing facial-recognition algorithms to the problem of recognizing protein 3d structure.
There's a writeup here:

    http://www.dirigibleflightcraft.com/prote.cs/

and full source code here:

    https://github.com/lynaghk/prote.cs/

if you're interested in this kind of visualization  machine learning sort of thing.</description>
		<content:encoded><![CDATA[<p>A year or so ago I applied some compressed sensing facial-recognition algorithms to the problem of recognizing protein 3d structure.<br />
There&#8217;s a writeup here:</p>
<p>    <a href="http://www.dirigibleflightcraft.com/prote.cs/" rel="nofollow">http://www.dirigibleflightcraft.com/prote.cs/</a></p>
<p>and full source code here:</p>
<p>    <a href="https://github.com/lynaghk/prote.cs/" rel="nofollow">https://github.com/lynaghk/prote.cs/</a></p>
<p>if you&#8217;re interested in this kind of visualization  machine learning sort of thing.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on One Over Square Root of N by Ankur</title>
		<link>http://fouryears.eu/2011/12/04/one-over-square-root-of-n/comment-page-1/#comment-691</link>
		<dc:creator>Ankur</dc:creator>
		<pubDate>Wed, 11 Jan 2012 12:53:58 +0000</pubDate>
		<guid isPermaLink="false">http://fouryears.eu/?p=766#comment-691</guid>
		<description>Hallo Konstantin,

thanks for the post. I remember learning this during my masters but couldnt remember what this thumb rule wass called or why it is so.. so I finally searched for 'one over root n'. Apparently Google only works if you know what you're looking for :)

I think it's a super helpful tool because of its simplicity! (Not easy to explain to laymen or people in the business world why the 1/root(n) but good for a confidence estimation for oneself!)

Best
Ankur</description>
		<content:encoded><![CDATA[<p>Hallo Konstantin,</p>
<p>thanks for the post. I remember learning this during my masters but couldnt remember what this thumb rule wass called or why it is so.. so I finally searched for &#8216;one over root n&#8217;. Apparently Google only works if you know what you&#8217;re looking for <img src='http://fouryears.eu/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
<p>I think it&#8217;s a super helpful tool because of its simplicity! (Not easy to explain to laymen or people in the business world why the 1/root(n) but good for a confidence estimation for oneself!)</p>
<p>Best<br />
Ankur</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on How to Send an SMS by Vincent</title>
		<link>http://fouryears.eu/2011/05/09/how-to-send-an-sms/comment-page-1/#comment-396</link>
		<dc:creator>Vincent</dc:creator>
		<pubDate>Tue, 14 Jun 2011 14:49:20 +0000</pubDate>
		<guid isPermaLink="false">http://fouryears.eu/?p=660#comment-396</guid>
		<description>Whenever you need your PUK code, you will see this:

 +CPIN: SIM PUK

To enter a new pin using your PUK code, enter the following:

 AT+CPIN=12345678,1234 (PUK,NEW PIN).

For monitoring purposes, it's best to disable the PIN alltogether, so will not have to re-enter it after a power failure:

 AT+CLCK="SC",0,"1234"</description>
		<content:encoded><![CDATA[<p>Whenever you need your PUK code, you will see this:</p>
<p> +CPIN: SIM PUK</p>
<p>To enter a new pin using your PUK code, enter the following:</p>
<p> AT+CPIN=12345678,1234 (PUK,NEW PIN).</p>
<p>For monitoring purposes, it&#8217;s best to disable the PIN alltogether, so will not have to re-enter it after a power failure:</p>
<p> AT+CLCK=&#8221;SC&#8221;,0,&#8221;1234&#8243;</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on The Great Swinging Bucket Conspiracy by Konstantin</title>
		<link>http://fouryears.eu/2009/02/12/the-great-swinging-bucket-conspiracy/comment-page-1/#comment-351</link>
		<dc:creator>Konstantin</dc:creator>
		<pubDate>Sun, 15 May 2011 10:10:44 +0000</pubDate>
		<guid isPermaLink="false">http://fouryears.eu/?p=339#comment-351</guid>
		<description>Oh I do. I question the probability that your comment exists at the time I am writing this response. Or am I?</description>
		<content:encoded><![CDATA[<p>Oh I do. I question the probability that your comment exists at the time I am writing this response. Or am I?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on The Great Swinging Bucket Conspiracy by 5PM Friday</title>
		<link>http://fouryears.eu/2009/02/12/the-great-swinging-bucket-conspiracy/comment-page-1/#comment-350</link>
		<dc:creator>5PM Friday</dc:creator>
		<pubDate>Sun, 15 May 2011 06:40:59 +0000</pubDate>
		<guid isPermaLink="false">http://fouryears.eu/?p=339#comment-350</guid>
		<description>Well... if you knew anything about quantum mechanics, you quation the probility that the bucket, or the water for that matter, even exists, at the time place where the person doing the swinging.</description>
		<content:encoded><![CDATA[<p>Well&#8230; if you knew anything about quantum mechanics, you quation the probility that the bucket, or the water for that matter, even exists, at the time place where the person doing the swinging.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Magical Dynamic Python Expressions by Andrei Sosnin</title>
		<link>http://fouryears.eu/2010/06/19/magical-dynamic-python-expressions/comment-page-1/#comment-305</link>
		<dc:creator>Andrei Sosnin</dc:creator>
		<pubDate>Mon, 20 Dec 2010 21:16:43 +0000</pubDate>
		<guid isPermaLink="false">http://fouryears.eu/?p=528#comment-305</guid>
		<description>I did enjoy it, thanks!</description>
		<content:encoded><![CDATA[<p>I did enjoy it, thanks!</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on How to Tame Python and Uninstall Packages in Mac OS X by rj</title>
		<link>http://fouryears.eu/2008/11/27/how-to-tame-python-and-uninstall-packages-in-mac-os-x/comment-page-1/#comment-304</link>
		<dc:creator>rj</dc:creator>
		<pubDate>Tue, 20 Jul 2010 23:06:50 +0000</pubDate>
		<guid isPermaLink="false">http://fouryears.eu/?p=208#comment-304</guid>
		<description>Thank you! Without this I never would have gotten through installing numpy and scipy. There's really a lack of good instructions out there.</description>
		<content:encoded><![CDATA[<p>Thank you! Without this I never would have gotten through installing numpy and scipy. There&#8217;s really a lack of good instructions out there.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

