Our great sponsors
-
Working in spatial data science, I rarely find applications where k-means is the best tool. The problem is that it is difficult to know how many clusters you can expect on maps. Is it 5, 500, or 10,000? Here HDBSCAN [1] shines because it will cluster _and_ select the most suitable number of clusters, to cut the single linkage cluster tree.
-
Note also that specifically for one-dimensional data, there is a globally optimal solution to the k-means clustering problem. There is an R package that implements it using a C++ core implementation [1], and also a Python wrapper [2].
-
WorkOS
The modern identity platform for B2B SaaS. The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.
-
If anyone is interested, I have two projects that uses k-means
https://github.com/victorqribeiro/groupImg
https://github.com/victorqribeiro/budget
Being one of the first ML algorithms that I learned, I spend some time finding use cases for it
If I'm not mistaken I've also used in to classify deforestation in an exercise
-
If anyone is interested, I have two projects that uses k-means
https://github.com/victorqribeiro/groupImg
https://github.com/victorqribeiro/budget
Being one of the first ML algorithms that I learned, I spend some time finding use cases for it
If I'm not mistaken I've also used in to classify deforestation in an exercise
-
It is not necessarily the case.
For example, word2vec uses k-means clustering using cosine similarity measure [1]. It works very, very well. The caveat is not many optimization variations of k-means will work with that "distance".
[1] https://github.com/tmikolov/word2vec/blob/master/word2vec.c#...
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.