<?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 K-Means Clustering Machine Learning Algorithm</title> <atom:link href="http://www.puremango.co.uk/2010/01/k-means-clustering-machine-learning/feed/" rel="self" type="application/rss+xml" /><link>http://www.puremango.co.uk/2010/01/k-means-clustering-machine-learning/</link> <description>innovative coding, tutorials, web stuff. celebrating 6 years online.</description> <lastBuildDate>Mon, 06 Feb 2012 07:31:40 +0000</lastBuildDate> <sy:updatePeriod>hourly</sy:updatePeriod> <sy:updateFrequency>1</sy:updateFrequency> <generator>http://wordpress.org/?v=3.3.1</generator> <item><title>By: themindflow.eu</title><link>http://www.puremango.co.uk/2010/01/k-means-clustering-machine-learning/comment-page-1/#comment-92311</link> <dc:creator>themindflow.eu</dc:creator> <pubDate>Fri, 30 Dec 2011 11:04:32 +0000</pubDate> <guid
isPermaLink="false">http://www.puremango.co.uk/?p=714#comment-92311</guid> <description>#6: google for &quot;document classification&quot;. It is most often done with supervised learning algorithms, namely Naive Bayes. Dont worry, it is almost as easy to grasp as k-means .</description> <content:encoded><![CDATA[<p>#6: google for &#8220;document classification&#8221;. It is most often done with supervised learning algorithms, namely Naive Bayes. Dont worry, it is almost as easy to grasp as k-means .</p> ]]></content:encoded> </item> <item><title>By: anichkuwar</title><link>http://www.puremango.co.uk/2010/01/k-means-clustering-machine-learning/comment-page-1/#comment-85172</link> <dc:creator>anichkuwar</dc:creator> <pubDate>Wed, 07 Dec 2011 19:10:49 +0000</pubDate> <guid
isPermaLink="false">http://www.puremango.co.uk/?p=714#comment-85172</guid> <description>hey..great post..
but i was just wondering..if we were given around 20,000 articles..and we need to cluster them acc to their category say music,movies,news,etc,. (obviously two intersecting cluster can be used for recommendation)..but how would i do that ??
i am not able to start code..as soon as i start coding, i again end up reading algorithms..
so can you help me in this ??
One more doubt don&#039;t you think this approach would be complex in real time scenario and will have higher computation time ??</description> <content:encoded><![CDATA[<p>hey..great post..<br
/> but i was just wondering..if we were given around 20,000 articles..and we need to cluster them acc to their category say music,movies,news,etc,. (obviously two intersecting cluster can be used for recommendation)..but how would i do that ??<br
/> i am not able to start code..as soon as i start coding, i again end up reading algorithms..<br
/> so can you help me in this ??<br
/> One more doubt don&#8217;t you think this approach would be complex in real time scenario and will have higher computation time ??</p> ]]></content:encoded> </item> <item><title>By: bcmoney</title><link>http://www.puremango.co.uk/2010/01/k-means-clustering-machine-learning/comment-page-1/#comment-67487</link> <dc:creator>bcmoney</dc:creator> <pubDate>Fri, 16 Sep 2011 17:49:44 +0000</pubDate> <guid
isPermaLink="false">http://www.puremango.co.uk/?p=714#comment-67487</guid> <description>Great info, I don&#039;t suppose you have a link to your JS or PHP implementations of the K-Means Clustering algorithm?</description> <content:encoded><![CDATA[<p>Great info, I don&#8217;t suppose you have a link to your JS or PHP implementations of the K-Means Clustering algorithm?</p> ]]></content:encoded> </item> <item><title>By: John Syrinek</title><link>http://www.puremango.co.uk/2010/01/k-means-clustering-machine-learning/comment-page-1/#comment-57742</link> <dc:creator>John Syrinek</dc:creator> <pubDate>Tue, 12 Jul 2011 05:53:49 +0000</pubDate> <guid
isPermaLink="false">http://www.puremango.co.uk/?p=714#comment-57742</guid> <description>I just wrote a quick k-cluster algorithm in PHP for demo purposes: http://johntron.com/programming/k-cluster-algorithm-in-php/</description> <content:encoded><![CDATA[<p>I just wrote a quick k-cluster algorithm in PHP for demo purposes: <a
href="http://johntron.com/programming/k-cluster-algorithm-in-php/" rel="nofollow">http://johntron.com/programming/k-cluster-algorithm-in-php/</a></p> ]]></content:encoded> </item> <item><title>By: A quick overview of machine learning techniques &#171; puremango.co.uk</title><link>http://www.puremango.co.uk/2010/01/k-means-clustering-machine-learning/comment-page-1/#comment-23467</link> <dc:creator>A quick overview of machine learning techniques &#171; puremango.co.uk</dc:creator> <pubDate>Sat, 27 Nov 2010 16:43:41 +0000</pubDate> <guid
isPermaLink="false">http://www.puremango.co.uk/?p=714#comment-23467</guid> <description>[...] Categorisation techniques allow you to group things with similar attributes together. For example, if gender, eye colour and bank balance are attributes of people, we can plot these into a 3 dimensional space and automatically identify clusters of people with similar attributes. Perhaps we&#8217;d find that blue eyed people are generally richer. Categorisation can reveal traits and connections in your data that you hadn&#8217;t even thought about before. Once we&#8217;ve identified clusters, we can also quickly assign new people to the clusters. So when a new person arrives, we can quickly see whether they&#8217;re closer to the &#8216;rich and blue eyed&#8217; box or the &#8216;poor and male&#8217; box. Imagine that we could cluster web pages, with topics as the dimensions. Then when we see a new web page we can quickly assign it a likely topic. I&#8217;ve already spoken about one categorisation technique called k-means clustering. [...]</description> <content:encoded><![CDATA[<p>[...] Categorisation techniques allow you to group things with similar attributes together. For example, if gender, eye colour and bank balance are attributes of people, we can plot these into a 3 dimensional space and automatically identify clusters of people with similar attributes. Perhaps we&#8217;d find that blue eyed people are generally richer. Categorisation can reveal traits and connections in your data that you hadn&#8217;t even thought about before. Once we&#8217;ve identified clusters, we can also quickly assign new people to the clusters. So when a new person arrives, we can quickly see whether they&#8217;re closer to the &#8216;rich and blue eyed&#8217; box or the &#8216;poor and male&#8217; box. Imagine that we could cluster web pages, with topics as the dimensions. Then when we see a new web page we can quickly assign it a likely topic. I&#8217;ve already spoken about one categorisation technique called k-means clustering. [...]</p> ]]></content:encoded> </item> <item><title>By: hrushi</title><link>http://www.puremango.co.uk/2010/01/k-means-clustering-machine-learning/comment-page-1/#comment-18564</link> <dc:creator>hrushi</dc:creator> <pubDate>Wed, 22 Sep 2010 09:33:38 +0000</pubDate> <guid
isPermaLink="false">http://www.puremango.co.uk/?p=714#comment-18564</guid> <description>i want kmeans clustering for n dimensions with large ste of data</description> <content:encoded><![CDATA[<p>i want kmeans clustering for n dimensions with large ste of data</p> ]]></content:encoded> </item> <item><title>By: Javascript K-Mean algorithm &#171; My Messed Up Mind</title><link>http://www.puremango.co.uk/2010/01/k-means-clustering-machine-learning/comment-page-1/#comment-9691</link> <dc:creator>Javascript K-Mean algorithm &#171; My Messed Up Mind</dc:creator> <pubDate>Tue, 06 Apr 2010 20:35:51 +0000</pubDate> <guid
isPermaLink="false">http://www.puremango.co.uk/?p=714#comment-9691</guid> <description>[...] reading an article by Howard Yeend (Pure Mango) I decided I would try to write a version of the basic learn [...]</description> <content:encoded><![CDATA[<p>[...] reading an article by Howard Yeend (Pure Mango) I decided I would try to write a version of the basic learn [...]</p> ]]></content:encoded> </item> <item><title>By: Howard Yeend</title><link>http://www.puremango.co.uk/2010/01/k-means-clustering-machine-learning/comment-page-1/#comment-9010</link> <dc:creator>Howard Yeend</dc:creator> <pubDate>Fri, 19 Mar 2010 08:13:33 +0000</pubDate> <guid
isPermaLink="false">http://www.puremango.co.uk/?p=714#comment-9010</guid> <description>:D Thanks!</description> <content:encoded><![CDATA[<p>:D Thanks!</p> ]]></content:encoded> </item> <item><title>By: Happy User</title><link>http://www.puremango.co.uk/2010/01/k-means-clustering-machine-learning/comment-page-1/#comment-9007</link> <dc:creator>Happy User</dc:creator> <pubDate>Fri, 19 Mar 2010 05:48:03 +0000</pubDate> <guid
isPermaLink="false">http://www.puremango.co.uk/?p=714#comment-9007</guid> <description>Great writeup!</description> <content:encoded><![CDATA[<p>Great writeup!</p> ]]></content:encoded> </item> </channel> </rss>
