I have a problem as follows: I have a collection of samples which I wish to cluster. The sample points are acquired in "groups/batches", and we know that samples from the same "group" cannot be ...
I'm trying to evaluate what is the right number of cluster needed for clusterize some data. I know that this is possible using Davies–Bouldin Index (DBI). To using DBI you have to compute it for any ...
Let's say that I have a set of datapoints. Let's say I also have a set of pairs of these points, where a single point can be in multiple pairs. Let's say I also have a set of triples, etc with the ...
I am looking for a clustering algorithm similar to DBSCAN but with a limitation on the intra-cluster distance. i.e. the input will be a set of points, a minimal distance, and a the minimal number of ...