tag:blogger.com,1999:blog-7994087232040033267.post2400415893429084182..comments2024-03-03T00:23:26.457-08:00Comments on Pragmatic Programming Techniques: K-Means Clustering in Map ReduceRicky Hohttp://www.blogger.com/profile/03793674536997651667noreply@blogger.comBlogger10125tag:blogger.com,1999:blog-7994087232040033267.post-59488097066729033962015-02-09T02:11:34.027-08:002015-02-09T02:11:34.027-08:00Hi guys, Excellent article...
I am trying to imple...Hi guys, Excellent article...<br />I am trying to implement k means algorithm for clustering web users with similar interests or behavior for which i have extracted required data points.i want to implement it in mapreduce framework but i am very new to this concept can any one send the code for it so that i can analyze and understand the things<br />my emailid is udaykmr0311@gmail.comUdayhttps://www.blogger.com/profile/16146753682788895522noreply@blogger.comtag:blogger.com,1999:blog-7994087232040033267.post-29061132439929072412013-02-04T11:40:22.780-08:002013-02-04T11:40:22.780-08:00Hi guys
Does anybody have the code for k-means cl...Hi guys<br /><br />Does anybody have the code for k-means clustering for map locations?<br /><br />Thanks,<br />CharanChaRaN AuLakHhttps://www.blogger.com/profile/05965761980810716437noreply@blogger.comtag:blogger.com,1999:blog-7994087232040033267.post-84911010538946143752012-11-20T21:46:13.310-08:002012-11-20T21:46:13.310-08:00Hi,
first of all, thank you perfect your informat...Hi, <br />first of all, thank you perfect your information.<br />i must implemented k-means cluster in big data system. <br />but i have problem map reduce modeling.<br /><br />this is very useful to me. <br /><br />thank you very much :)Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-7994087232040033267.post-85242705698399303622012-08-02T10:40:31.578-07:002012-08-02T10:40:31.578-07:00Hi all...
I need a favour from u...
If any one has...Hi all...<br />I need a favour from u...<br />If any one has k-means code for C <br />can any one plz share it with me....<br />plz plz its urgent..<br /><br />my email id is<br />engr.jana@hotmail.com<br /><br />Best regardsjiahttps://www.blogger.com/profile/11749709556447757522noreply@blogger.comtag:blogger.com,1999:blog-7994087232040033267.post-13406802352302614952012-08-02T10:38:50.539-07:002012-08-02T10:38:50.539-07:00Hi all,,,
does any one have k-means algorithm code...Hi all,,,<br />does any one have k-means algorithm code for c language...<br />please please do share it with me <br />At engr.jana@hotmail.com<br /><br />Best regardsjiahttps://www.blogger.com/profile/11749709556447757522noreply@blogger.comtag:blogger.com,1999:blog-7994087232040033267.post-62622151231164851112011-11-14T22:00:15.952-08:002011-11-14T22:00:15.952-08:00do you think the following might be useful to sele...do you think the following might be useful to select T1 and T2 - sort the points by ascending distance from the canopy center and set T2 = upper threshold of first quartile and T1 = lower threshold of third quartile. So all points that are in the first quartile are removed from further canopy processing. That way the T1, T2 would be dynamically decided based on the distribution of points from the canopy centerrohithttps://www.blogger.com/profile/06661762975024053125noreply@blogger.comtag:blogger.com,1999:blog-7994087232040033267.post-27819041162574555072011-10-16T10:31:34.010-07:002011-10-16T10:31:34.010-07:00Excellent article on k-means and canopy clustering...Excellent article on k-means and canopy clustering. I'd like to use canopy clustering to speed up my own clustering implementations, but I'm concerned about performing a sensitivity analysis with the two thresholds, T1 and T2, every time I apply the algorithm to a new data set. Do you think it is possible to automate the selection of these two thresholds? Have you read any articles on the topic?Micah L. Abramshttps://www.blogger.com/profile/04514476139661824580noreply@blogger.comtag:blogger.com,1999:blog-7994087232040033267.post-28017522580599789932011-09-20T02:37:18.644-07:002011-09-20T02:37:18.644-07:00Thanks for wonderfull information. I would like to...Thanks for wonderfull information. I would like to know about <br />K-medoids.<br />ThanksJaved Anjum Sheikhhttps://www.blogger.com/profile/00588396799828100508noreply@blogger.comtag:blogger.com,1999:blog-7994087232040033267.post-92128551080391695182011-04-30T17:47:31.353-07:002011-04-30T17:47:31.353-07:00Never mind my previous comment. Just realized that...Never mind my previous comment. Just realized that k-means runs over all the points as before over k randomly selected centroids. But the distance calculation is reduced in a way. So for example pt p is assigned to canopy m , and kmeans centroid n, then is p and n are not in canopy then we return a large value or disregard the centroid n.Gaurav Guptahttps://www.blogger.com/profile/04675093242143106103noreply@blogger.comtag:blogger.com,1999:blog-7994087232040033267.post-24198827746317685182011-04-30T14:04:04.894-07:002011-04-30T14:04:04.894-07:00Hi
I am trying to implement k-means + canopy clu...Hi <br /><br />I am trying to implement k-means + canopy clustering algorithm for a class project on reuter news data set. <br /><br />The question I had was after the canopy clustering step there could be say 10 canopy centers. Suppose in k-means algorithm k=5 , how would you merge the canopy centers to just 5.<br /><br />GauravGaurav Guptahttps://www.blogger.com/profile/04675093242143106103noreply@blogger.com