<?xml version="1.0" encoding="utf-8"?><rss version="2.0"
	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/"
		>
<channel>
	<title>Comments on: The Forgetting</title>
	<atom:link href="http://hunch.net/?feed=rss2&#038;p=205" rel="self" type="application/rss+xml" />
	<link>http://hunch.net/?p=205</link>
	<description>Machine learning and learning theory research</description>
	<lastBuildDate>Tue, 07 Sep 2010 23:46:22 -0500</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: chunyu</title>
		<link>http://hunch.net/?p=205&#038;cpage=1#comment-63275</link>
		<dc:creator>chunyu</dc:creator>
		<pubDate>Mon, 19 Mar 2007 15:44:44 +0000</pubDate>
		<guid isPermaLink="false">http://hunch.net/?p=205#comment-63275</guid>
		<description>Fresh researchers usually read the most recent work, and try to keep pace with the research trend in their area. Though there may be many fundamental problems to be solved, the interest bias of the main flow research community may only focus those easy to published ones. If we choose different research areas, it may be dangerous.</description>
		<content:encoded><![CDATA[<p>Fresh researchers usually read the most recent work, and try to keep pace with the research trend in their area. Though there may be many fundamental problems to be solved, the interest bias of the main flow research community may only focus those easy to published ones. If we choose different research areas, it may be dangerous.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Charles</title>
		<link>http://hunch.net/?p=205&#038;cpage=1#comment-56112</link>
		<dc:creator>Charles</dc:creator>
		<pubDate>Thu, 22 Feb 2007 18:54:42 +0000</pubDate>
		<guid isPermaLink="false">http://hunch.net/?p=205#comment-56112</guid>
		<description>I really like the comment that only teachable ideas survive.  That said, it&#039;s not an uncommon research contribution to make an unteachable idea become teachable.  For example, simpler proofs are often found to replace important but complex ones; or complex algorithms are subsumed into a general framework that makes understanding them much simpler.  The forward-backward algorithm is probably a good example of the latter phenomenon.</description>
		<content:encoded><![CDATA[<p>I really like the comment that only teachable ideas survive.  That said, it&#8217;s not an uncommon research contribution to make an unteachable idea become teachable.  For example, simpler proofs are often found to replace important but complex ones; or complex algorithms are subsumed into a general framework that makes understanding them much simpler.  The forward-backward algorithm is probably a good example of the latter phenomenon.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: A Vezhnevets</title>
		<link>http://hunch.net/?p=205&#038;cpage=1#comment-55854</link>
		<dc:creator>A Vezhnevets</dc:creator>
		<pubDate>Wed, 21 Feb 2007 12:20:47 +0000</pubDate>
		<guid isPermaLink="false">http://hunch.net/?p=205#comment-55854</guid>
		<description>I totally agree on the notion about the relation of papers simplicity and its survivability. Most of the papers that had significant impact in the fields I&#039;m familiar with (machine learning and vision) were those, that proposed simple solutions to complicated tasks. It seems that simpler methods also achieve better results then complex once (Occam&#039;s razor?). The first thing that comes to my mind as an example is Boosting - student can understand and implement it in a few hours.</description>
		<content:encoded><![CDATA[<p>I totally agree on the notion about the relation of papers simplicity and its survivability. Most of the papers that had significant impact in the fields I&#8217;m familiar with (machine learning and vision) were those, that proposed simple solutions to complicated tasks. It seems that simpler methods also achieve better results then complex once (Occam&#8217;s razor?). The first thing that comes to my mind as an example is Boosting &#8211; student can understand and implement it in a few hours.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Joe Kondel</title>
		<link>http://hunch.net/?p=205&#038;cpage=1#comment-55738</link>
		<dc:creator>Joe Kondel</dc:creator>
		<pubDate>Tue, 20 Feb 2007 15:31:47 +0000</pubDate>
		<guid isPermaLink="false">http://hunch.net/?p=205#comment-55738</guid>
		<description>There have been some efforts towards this problem from the semantic web / large scale heterogeneous database systems area. One relatively recent one I remember is the Piazza system from U of Washington. &lt;a&gt;Here&#039;s one of the better papers&lt;/a&gt;.</description>
		<content:encoded><![CDATA[<p>There have been some efforts towards this problem from the semantic web / large scale heterogeneous database systems area. One relatively recent one I remember is the Piazza system from U of Washington. <a>Here&#8217;s one of the better papers</a>.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: hal</title>
		<link>http://hunch.net/?p=205&#038;cpage=1#comment-55651</link>
		<dc:creator>hal</dc:creator>
		<pubDate>Tue, 20 Feb 2007 06:12:24 +0000</pubDate>
		<guid isPermaLink="false">http://hunch.net/?p=205#comment-55651</guid>
		<description>I think there are two compounding issues.  (1) old stuff often enters the common vocabulary and escapes citation.  Decision trees often go uncited, for instance, especially in the context of boosting.  (2) recent tutorial/collections/books supercede old papers; eg., many people cite SVMs as the Cristianini and Shawe-Taylor, or even the Vapnik book, rather than the original paper.  Both a signs that an old technique is important, but reduce the recency of citation lists.</description>
		<content:encoded><![CDATA[<p>I think there are two compounding issues.  (1) old stuff often enters the common vocabulary and escapes citation.  Decision trees often go uncited, for instance, especially in the context of boosting.  (2) recent tutorial/collections/books supercede old papers; eg., many people cite SVMs as the Cristianini and Shawe-Taylor, or even the Vapnik book, rather than the original paper.  Both a signs that an old technique is important, but reduce the recency of citation lists.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Bill Jefferys</title>
		<link>http://hunch.net/?p=205&#038;cpage=1#comment-55574</link>
		<dc:creator>Bill Jefferys</dc:creator>
		<pubDate>Tue, 20 Feb 2007 00:14:49 +0000</pubDate>
		<guid isPermaLink="false">http://hunch.net/?p=205#comment-55574</guid>
		<description>On the comment 4. &quot;Old papers arenÃ¢â‚¬â„¢t on the internet.&quot;

This is field-dependent, and circumstances make some fields more fortunate than others. In astronomy, due to NASA money, the major journals...Astronomical Journal, Astrophysical Journal, Monthly Notices of the Royal Astronomical Society, Astronomy and Astrophysics, to mention a few, are on line from their beginning (19th Century in some cases). 

This is possible because the size of these journals was small enough, even with 100+ years&#039; accumulation, to be scanned in a reasonable amount of time.

It may well be that government funds could be used similarly in other fields to advantage, and the cost might not be so large as to be prohibitive.

Type &quot;ADS Abstracts&quot; into your browser to get a sense of what is available in this field.</description>
		<content:encoded><![CDATA[<p>On the comment 4. &#8220;Old papers arenÃ¢â‚¬â„¢t on the internet.&#8221;</p>
<p>This is field-dependent, and circumstances make some fields more fortunate than others. In astronomy, due to NASA money, the major journals&#8230;Astronomical Journal, Astrophysical Journal, Monthly Notices of the Royal Astronomical Society, Astronomy and Astrophysics, to mention a few, are on line from their beginning (19th Century in some cases). </p>
<p>This is possible because the size of these journals was small enough, even with 100+ years&#8217; accumulation, to be scanned in a reasonable amount of time.</p>
<p>It may well be that government funds could be used similarly in other fields to advantage, and the cost might not be so large as to be prohibitive.</p>
<p>Type &#8220;ADS Abstracts&#8221; into your browser to get a sense of what is available in this field.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Statistical Modeling, Causal Inference, and Social Science</title>
		<link>http://hunch.net/?p=205&#038;cpage=1#comment-55548</link>
		<dc:creator>Statistical Modeling, Causal Inference, and Social Science</dc:creator>
		<pubDate>Mon, 19 Feb 2007 21:54:46 +0000</pubDate>
		<guid isPermaLink="false">http://hunch.net/?p=205#comment-55548</guid>
		<description>&lt;strong&gt;Scientific Papers in the Internet Age&lt;/strong&gt;

In a recent discussion at Machine Learning (Theory) blog the website called Faculty of 1000 (Biology) and Faculty of 1000 (Medicine) came up. It works as follows: users submit papers they like, and there is space for supporting and dissenting...</description>
		<content:encoded><![CDATA[<p><strong>Scientific Papers in the Internet Age</strong></p>
<p>In a recent discussion at Machine Learning (Theory) blog the website called Faculty of 1000 (Biology) and Faculty of 1000 (Medicine) came up. It works as follows: users submit papers they like, and there is space for supporting and dissenting&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: furr</title>
		<link>http://hunch.net/?p=205&#038;cpage=1#comment-55184</link>
		<dc:creator>furr</dc:creator>
		<pubDate>Sun, 18 Feb 2007 16:59:34 +0000</pubDate>
		<guid isPermaLink="false">http://hunch.net/?p=205#comment-55184</guid>
		<description>if you try attacking bigger problems you&#039;ll start citing older papers</description>
		<content:encoded><![CDATA[<p>if you try attacking bigger problems you&#8217;ll start citing older papers</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Anonymous</title>
		<link>http://hunch.net/?p=205&#038;cpage=1#comment-54951</link>
		<dc:creator>Anonymous</dc:creator>
		<pubDate>Sun, 18 Feb 2007 00:18:26 +0000</pubDate>
		<guid isPermaLink="false">http://hunch.net/?p=205#comment-54951</guid>
		<description>Kilian - fyi such a paper organization and peer-comment system does exist in biology and medicine, see: http://www.f1000biology.com/start.asp
the flexibility of their topic hierarchy, and the breadth of commenting peers (right now only faculty members, surprising how many people have time to write!) and others may not be perfect, ... who in Google wants to improve this, or in other words, implement a &quot;PaperPedia&quot;?</description>
		<content:encoded><![CDATA[<p>Kilian &#8211; fyi such a paper organization and peer-comment system does exist in biology and medicine, see: <a href="http://www.f1000biology.com/start.asp" rel="nofollow">http://www.f1000biology.com/start.asp</a><br />
the flexibility of their topic hierarchy, and the breadth of commenting peers (right now only faculty members, surprising how many people have time to write!) and others may not be perfect, &#8230; who in Google wants to improve this, or in other words, implement a &#8220;PaperPedia&#8221;?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Kilian W.</title>
		<link>http://hunch.net/?p=205&#038;cpage=1#comment-54855</link>
		<dc:creator>Kilian W.</dc:creator>
		<pubDate>Sat, 17 Feb 2007 18:14:34 +0000</pubDate>
		<guid isPermaLink="false">http://hunch.net/?p=205#comment-54855</guid>
		<description>John, I agree with your last point. The way papers are stored right now is clearly sub-optimal. It is too easy to miss important work because it was published at a conference that you are less familiar with, that was before your time, or because the title threw you off. Ideally, you could imagine a centralized, searchable, hierarchical data base where people and conferences upload their papers. If it is organized in a fine-grained hierarchy, you could subscribe to your topic/sub-tree of interest and receive weekly or daily emails with the latest additions. Going further, you could imagine  allowing users to leave reviews or ratings for the papers (amazon or digg style). 

IsnÃ¢â‚¬â„¢t there somebody at Google still searching for a useful 20% project?</description>
		<content:encoded><![CDATA[<p>John, I agree with your last point. The way papers are stored right now is clearly sub-optimal. It is too easy to miss important work because it was published at a conference that you are less familiar with, that was before your time, or because the title threw you off. Ideally, you could imagine a centralized, searchable, hierarchical data base where people and conferences upload their papers. If it is organized in a fine-grained hierarchy, you could subscribe to your topic/sub-tree of interest and receive weekly or daily emails with the latest additions. Going further, you could imagine  allowing users to leave reviews or ratings for the papers (amazon or digg style). </p>
<p>IsnÃ¢â‚¬â„¢t there somebody at Google still searching for a useful 20% project?</p>
]]></content:encoded>
	</item>
</channel>
</rss>
