K-means algorithm variation with minimum measure of size
Posted
by
user1464628
on Stack Overflow
See other posts from Stack Overflow
or by user1464628
Published on 2012-06-18T20:04:45Z
Indexed on
2012/06/18
21:16 UTC
Read the original article
Hit count: 233
I'm looking for some algorithm such as k-means for grouping points on a map into a fixed number of groups, by distance. The number of groups has already been decided, but the trick part (at least for me) is to meet the criteria that the sum of MOS of each group should in the certain range, say bigger than 1. Is there any way to make that happen?
ID MOS X Y
1 0.47 39.27846 -76.77101
2 0.43 39.22704 -76.70272
3 1.48 39.24719 -76.68485
4 0.15 39.25172 -76.69729
5 0.09 39.24341 -76.69884
© Stack Overflow or respective owner
