开发者

k-means clustering implementation in Javascript? [closed]

Closed. This question is seeking recommendations for books, tools, software libraries, and more. It does not meet Stack Overflow guidelines. It is开发者_JS百科 not currently accepting answers.

We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.

Closed 2 years ago.

Improve this question

I'm in need for a Javascript implementation of the k-means clustering algorithm. I only have 1-dimensional data and rarely more than 100 items, so performance is not an issue.

PS: I could only find one but it seems extremely unsteady, resulting in completely different clusters on virtually every call.


k-means in Javascript:

http://code.google.com/p/hdict/source/browse/gae/files/kmeans.js

http://www.mymessedupmind.co.uk/index.php/javascript-k-mean-algorithm

Applet:

http://www.math.le.ac.uk/people/ag153/homepage/KmeansKmedoids/kmeans.jar


In node and the browser:

https://github.com/harthur/clusterfck

You have a choice between k-means or hierarchical clustering with these distance functions:

  1. euclidean
  2. manhattan
  3. max


Simple K-Means implementation: dimas-kmeans

var kmeans = require('dimas-kmeans')

var clusters = kmeans.getClusters(data);
0

上一篇:

下一篇:

精彩评论

暂无评论...
验证码 换一张
取 消

最新问答

问答排行榜