<?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: k-means and EM clustering algorithms</title>
	<atom:link href="http://www.sematopia.com/2006/04/k-means-and-em-clustering-algorithms/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.sematopia.com/2006/04/k-means-and-em-clustering-algorithms/</link>
	<description></description>
	<lastBuildDate>Thu, 09 Sep 2010 05:36:22 -0400</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Preeti</title>
		<link>http://www.sematopia.com/2006/04/k-means-and-em-clustering-algorithms/comment-page-1/#comment-172519</link>
		<dc:creator>Preeti</dc:creator>
		<pubDate>Mon, 09 Mar 2009 07:58:18 +0000</pubDate>
		<guid isPermaLink="false">http://www.sematopia.com/?p=72#comment-172519</guid>
		<description>Hi, I would like to know how kmeans will be useful in case of incremental clustering. If the information is dynamically changing, then how kmeans or nearest neighbor will handle editing correct cluster. How to handle unlabelled data? if to begin with we have 90% unlabelled data and 10% labelled then how the algorithm looks like? if this ration need to change, 80% and 20% then how will be the said algorithm change? kindly guide in this regards.

Preeti.</description>
		<content:encoded><![CDATA[<p>Hi, I would like to know how kmeans will be useful in case of incremental clustering. If the information is dynamically changing, then how kmeans or nearest neighbor will handle editing correct cluster. How to handle unlabelled data? if to begin with we have 90% unlabelled data and 10% labelled then how the algorithm looks like? if this ration need to change, 80% and 20% then how will be the said algorithm change? kindly guide in this regards.</p>
<p>Preeti.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ravi</title>
		<link>http://www.sematopia.com/2006/04/k-means-and-em-clustering-algorithms/comment-page-1/#comment-22001</link>
		<dc:creator>Ravi</dc:creator>
		<pubDate>Thu, 24 May 2007 16:21:12 +0000</pubDate>
		<guid isPermaLink="false">http://www.sematopia.com/?p=72#comment-22001</guid>
		<description>Hi George 
   Thanks for the excellent work! 
   Just wondering how Kmeans can be extended to more then 2 dimensions.

Thanks

Ravi</description>
		<content:encoded><![CDATA[<p>Hi George<br />
   Thanks for the excellent work!<br />
   Just wondering how Kmeans can be extended to more then 2 dimensions.</p>
<p>Thanks</p>
<p>Ravi</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: George A. Papayiannis</title>
		<link>http://www.sematopia.com/2006/04/k-means-and-em-clustering-algorithms/comment-page-1/#comment-6018</link>
		<dc:creator>George A. Papayiannis</dc:creator>
		<pubDate>Fri, 22 Sep 2006 22:51:33 +0000</pubDate>
		<guid isPermaLink="false">http://www.sematopia.com/?p=72#comment-6018</guid>
		<description>Hi Leilane,

The code is licensed uder &lt;a href=&#039;http://www.gnu.org/licenses/gpl.txt&#039; rel=&quot;nofollow&quot;&gt;GPL v2&lt;/a&gt;.
So go ahead, as long as your confrom to that license.

On a side note, as I said in the post I wrote them both in one night.
The EM version surely has problems, k-means is probably right...

Good luck,
George</description>
		<content:encoded><![CDATA[<p>Hi Leilane,</p>
<p>The code is licensed uder <a href='http://www.gnu.org/licenses/gpl.txt' rel="nofollow">GPL v2</a>.<br />
So go ahead, as long as your confrom to that license.</p>
<p>On a side note, as I said in the post I wrote them both in one night.<br />
The EM version surely has problems, k-means is probably right&#8230;</p>
<p>Good luck,<br />
George</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Leilane Castro</title>
		<link>http://www.sematopia.com/2006/04/k-means-and-em-clustering-algorithms/comment-page-1/#comment-6010</link>
		<dc:creator>Leilane Castro</dc:creator>
		<pubDate>Fri, 22 Sep 2006 19:16:33 +0000</pubDate>
		<guid isPermaLink="false">http://www.sematopia.com/?p=72#comment-6010</guid>
		<description>Hi! I&#039;m working in a research project about video segmentation and like to know if I can use your source code in this. If I change something I&#039;ll let you know, sure. And, in case you say yes, tell me how to thanks you properly in my publication.

Thanks for your attention.</description>
		<content:encoded><![CDATA[<p>Hi! I&#8217;m working in a research project about video segmentation and like to know if I can use your source code in this. If I change something I&#8217;ll let you know, sure. And, in case you say yes, tell me how to thanks you properly in my publication.</p>
<p>Thanks for your attention.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
