<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Helioid &#187; refinement</title>
	<atom:link href="http://blog.helioid.com/tag/refinement/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.helioid.com</link>
	<description>Search Refined</description>
	<lastBuildDate>Fri, 16 Dec 2011 06:02:33 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.1</generator>
		<item>
		<title>Literature Review 2008 &#8211; 2009</title>
		<link>http://blog.helioid.com/2009/11/literature-review-2008-2009/</link>
		<comments>http://blog.helioid.com/2009/11/literature-review-2008-2009/#comments</comments>
		<pubDate>Sat, 07 Nov 2009 04:46:26 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[General]]></category>
		<category><![CDATA[learning]]></category>
		<category><![CDATA[models]]></category>
		<category><![CDATA[refinement]]></category>

		<guid isPermaLink="false">http://www.helioid.net/?p=62</guid>
		<description><![CDATA[<p>The research we do at Helioid involves a lot of reading.  With some notes and summaries included, here is a list of the literature we've focused on from 2008 to 2009:</p>

<p>
  <font size=2><b>Machine Learning</b></font>
</p>
<p>
  <font size=2><a href=http://www.cc.gatech.edu/%7Elebanon/ id=jrbv title="G. Lebanon">G. Lebanon</a>, <a href=http://web.ics.purdue.edu/%7Eymao/>Y. Mao</a>, and <a href=http://web.ics.purdue.edu/%7Ejvdillon/>J. Dillon</a>. <a href=http://jmlr.csail.mit.edu/papers/v8/lebanon07a.html>The Locally Weighted Bag of Words Framework for Document Representation</a>. <i>Journal of Machine Learning Research</i> <b>8</b> (Oct):2405-2441, 2007.</font>
</p>]]></description>
		<wfw:commentRss>http://blog.helioid.com/2009/11/literature-review-2008-2009/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>How Helioid Benefits Users</title>
		<link>http://blog.helioid.com/2009/11/how-helioid-benefits-users/</link>
		<comments>http://blog.helioid.com/2009/11/how-helioid-benefits-users/#comments</comments>
		<pubDate>Wed, 04 Nov 2009 04:45:25 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[General]]></category>
		<category><![CDATA[personalization]]></category>
		<category><![CDATA[refinement]]></category>

		<guid isPermaLink="false">http://www.helioid.net/?p=59</guid>
		<description><![CDATA[The simple answer to how Helioid benefits users is that Helioid represents information and information navigation in a more efficient manner.  This gets a complex when looking at how each individual uses the internet and searches for information, but still the core is the same.  A current issue with web search, as Google's Marissa Mayer "explains":http://www.techcrunch.com/2008/09/10/marissa-mayer-clarifies-search-is-only-10-done-not-90/, is that it is undeveloped and not advanced, "Think of it like biology and physics in the 1500s or 1600s: it's a new science where we make big and exciting breakthroughs all the time."]]></description>
		<wfw:commentRss>http://blog.helioid.com/2009/11/how-helioid-benefits-users/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>On Kosmix and Needles in Haystacks</title>
		<link>http://blog.helioid.com/2009/01/on-kosmix-and-needles-in-haystacks/</link>
		<comments>http://blog.helioid.com/2009/01/on-kosmix-and-needles-in-haystacks/#comments</comments>
		<pubDate>Sat, 17 Jan 2009 04:36:09 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[General]]></category>
		<category><![CDATA[kosmix]]></category>
		<category><![CDATA[refinement]]></category>

		<guid isPermaLink="false">http://www.helioid.net/?p=42</guid>
		<description><![CDATA[A little over a week ago, TechCrunch featured an "article":http://www.techcrunch.com/2008/12/08/kosmix-raises-20-million-more-for-its-universal-search-engine/ on the latest round of funding raise by rising star in web search, Kosmix.  In said latest round, Kosmix managed to rake in an impressive $20 million from a wide range of investors, led by Time Warner, bringing the search engine's total funding to $55 million.  Upon paying a visit to their site, it becomes immediately apparent what all the hoopla's about.  Kosmix pulls the top search results from a variety of popular sources in a variety of different categories, including video sites YouTube and Truveo, info sites like Wikipedia and HowStuffWorks, and shopping sites like Amazon and Ebay, in order to create a mash-up of all the possible kinds of information you might be interested in.   A collection of related subjects are also presented in the left margin of the results page, in order to facilitate some degree of search refinement.  Without a doubt, Kosmix provides a search experience quite distinct from the major search engines, and I feel fairly safe in saying that most searches performed with Ask would yield more fulfilling results with Kosmix. And yet, after playing with Kosmix for a while, I felt as though something was amiss. 

]]></description>
		<wfw:commentRss>http://blog.helioid.com/2009/01/on-kosmix-and-needles-in-haystacks/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Composing Inverse Functions to Measure Model Fitness</title>
		<link>http://blog.helioid.com/2008/12/composing-inverse-functions-to-measure-model-fitness/</link>
		<comments>http://blog.helioid.com/2008/12/composing-inverse-functions-to-measure-model-fitness/#comments</comments>
		<pubDate>Sat, 06 Dec 2008 02:11:56 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[General]]></category>
		<category><![CDATA[learning]]></category>
		<category><![CDATA[models]]></category>
		<category><![CDATA[refinement]]></category>

		<guid isPermaLink="false">http://www.helioid.net/?p=22</guid>
		<description><![CDATA[This articles concerns a method for evaluating the fitness of content topic models and document topic models based on the dissonance between a set of documents and the set of documents generated by composing inverse functions and applying them to the original set of documents.  A document generating function is applied to a topic generating function that is applied to the original set of documents.  In order to compare topics, one can look at the original set of topics compared to set of topics generated by apply a topic generating function to the documents generated by applying a document generating function to the original set of topics.]]></description>
		<wfw:commentRss>http://blog.helioid.com/2008/12/composing-inverse-functions-to-measure-model-fitness/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
	</channel>
</rss>

