TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Ask HN: Working with GPS Cord to find distance and clusters.

1 点作者 redslazer超过 13 年前
I have been tasked with a rather interesting project, in an area where I don't really have much experience.<p>I was given the address of 10,000 customers and reverse geocoded (GPS Cordinates) them but now i am interested in finding clusters of customers. I really have no clue how to start other than to visually plot them on google maps api and search visually.<p>They are all in 1 city so they will be pretty condensed anyway but there will be clusters. How would i go about program-matically finding these clusters. I have done some google searches and nothing has really turned up.<p>Thanks for any help.

1 comment

bartonfink超过 13 年前
What you want to look at is k-means clustering. It's a machine learning technique that will abstract to any number of vectors, but it will handle what you're looking for.<p><a href="http://en.wikipedia.org/wiki/K-means_clustering" rel="nofollow">http://en.wikipedia.org/wiki/K-means_clustering</a>
评论 #3592892 未加载