Skip to main content

cluster analysis - Clustering a set of points


I have a set of 2D points in the square defined by {-1, -1} and {1, 1}. These points typically form compact groups. I need to break them into clusters in such a way that the rectangular bounding boxes of the clusters will not overlap. The bounding boxes are expanded by a pre-specified margin, denoted dist.


I managed to implement this by computing the pairwise Manhattan distance, building a corresponding graph and taking the connected components of the graph (see attached code).


I was hoping that there would be a simper solution which avoids computing the complete pairwise distance matrix. I tried using FindClusters, but not having any experience with the underlying methods I did not manage to get it to return the appropriate number of clusters (it typically lumps everything together, even when points are "visually" separate). So the question is: Is it possible to implement this using FindClusters? The key is in choosing the correct Method option for FindClusters, which is unfortunately not documented in a way that's easy to understand for someone not familiar with these methods.


Requirements: The clustering does not need to be precise. If the method returns a bit fewer clusters than what I show in the image below, that's okay. I need the results for a heuristic decision anyway. But it should not lump together things which are rather far compared to the size of the visually perceived clusters. It is very easy for us humans to recognize these clusters, and I'd like to get the computer to give me same output one would naturally construct by hand after looking at the image. All points sets I have have a very similar structure to the one I show below, but the groups may have different size scales. This is why it makes sense to ask "I'd like to have the clusters similar to what I perceive visually". The method must work without any user intervention (manual estimation of parameters).



pts = Import["http://ge.tt/api/1/files/7sHEVob/0/blob?download", "WDX"];

dist = 0.01;


comp = ConnectedComponents@
   AdjacencyGraph[
    UnitStep[2 dist - Outer[ManhattanDistance, pts, pts, 1]]];

Graphics@MapIndexed[
  With[{p = pts[[#1]]}, {{GrayLevel[.9], 
      Rectangle[{Min[p[[All, 1]]], Min[p[[All, 2]]]} - 
        dist, {Max[p[[All, 1]]], Max[p[[All, 2]]]} + 
        dist]}, {ColorData[3][First[#2]], Point[p]}}] &, comp]


Click for a larger image:




Answer



This is roughly 30 times faster than your approach and can be tuned easier than FindClusters[]:


getOneCluster[pts_List, maxDist_?NumericQ] :=(*Returns a cluster*)
 Module[{f},
  f = Nearest[pts];
  FixedPoint[Union@Flatten[f[#, {Infinity, maxDist}] & /@ #, 1] &, {First@pts}]]
clusters[data_] := Module[{f, dist},

  (* Some Characteristic Distance, assuming no isolated points*)
  f = Nearest[data];
  dist = 3 Max[EuclideanDistance[Last@f[#, 2], #] & /@ data];
  Flatten[Reap[NestWhile[Complement[#, Sow@getOneCluster[#, dist]] &, data, 
                         # != {} &]][[2]], 1]
  ]

(* Gen some data *)

SeedRandom[42];

numberOfClusters = 42;
clustersCenters = RandomReal[{0, 1}, {numberOfClusters, 2}];
data = Flatten[RandomVariate[BinormalDistribution[#, .002 {1, 1}, .1], 100] & /@ 
                            clustersCenters, 1];
pad = .01;

Plotting the results:


Graphics[MapIndexed[With[{p = #1}, {{GrayLevel[.9], 
                   Rectangle[{Min[p[[All, 1]]], Min[p[[All, 2]]]} - pad, 
                             {Max[p[[All, 1]]], Max[p[[All, 2]]]} + pad]}, 

                             {ColorData[3][First[#2]], Point[p]}}] &, clusters[data]], 
         Axes -> True]

Mathematica graphics


The problem with "merging" those clusters so that the bounding boxes don't overlap needs some heuristic and I think it should better be done as a post-processing step. The caveat is that the merging process done blindly (and worst, recursively) can aggregate much more points than seems reasonable. Take a look:


Mathematica graphics


Comments

Post a Comment

Popular posts from this blog

plotting - Plot 4D data with color as 4th dimension

I have a list of 4D data (x position, y position, amplitude, wavelength). I want to plot x, y, and amplitude on a 3D plot and have the color of the points correspond to the wavelength. I have seen many examples using functions to define color but my wavelength cannot be expressed by an analytic function. Is there a simple way to do this? Answer Here a another possible way to visualize 4D data: data = Flatten[Table[{x, y, x^2 + y^2, Sin[x - y]}, {x, -Pi, Pi,Pi/10}, {y,-Pi,Pi, Pi/10}], 1]; You can use the function Point along with VertexColors . Now the points are places using the first three elements and the color is determined by the fourth. In this case I used Hue, but you can use whatever you prefer. Graphics3D[ Point[data[[All, 1 ;; 3]], VertexColors -> Hue /@ data[[All, 4]]], Axes -> True, BoxRatios -> {1, 1, 1/GoldenRatio}]
Post a Comment
Read more

plotting - Filling between two spheres in SphericalPlot3D

Manipulate[ SphericalPlot3D[{1, 2 - n}, {θ, 0, Pi}, {ϕ, 0, 1.5 Pi}, Mesh -> None, PlotPoints -> 15, PlotRange -> {-2.2, 2.2}], {n, 0, 1}] I cant' seem to be able to make a filling between two spheres. I've already tried the obvious Filling -> {1 -> {2}} but Mathematica doesn't seem to like that option. Is there any easy way around this or ... Answer There is no built-in filling in SphericalPlot3D . One option is to use ParametricPlot3D to draw the surfaces between the two shells: Manipulate[ Show[SphericalPlot3D[{1, 2 - n}, {θ, 0, Pi}, {ϕ, 0, 1.5 Pi}, PlotPoints -> 15, PlotRange -> {-2.2, 2.2}], ParametricPlot3D[{ r {Sin[t] Cos[1.5 Pi], Sin[t] Sin[1.5 Pi], Cos[t]}, r {Sin[t] Cos[0 Pi], Sin[t] Sin[0 Pi], Cos[t]}}, {r, 1, 2 - n}, {t, 0, Pi}, PlotStyle -> Yellow, Mesh -> {2, 15}]], {n, 0, 1}]
Post a Comment
Read more

plotting - Mathematica: 3D plot based on combined 2D graphs

I have several sigmoidal fits to 3 different datasets, with mean fit predictions plus the 95% confidence limits (not symmetrical around the mean) and the actual data. I would now like to show these different 2D plots projected in 3D as in but then using proper perspective. In the link here they give some solutions to combine the plots using isometric perspective, but I would like to use proper 3 point perspective. Any thoughts? Also any way to show the mean points per time point for each series plus or minus the standard error on the mean would be cool too, either using points+vertical bars, or using spheres plus tubes. Below are some test data and the fit function I am using. Note that I am working on a logit(proportion) scale and that the final vertical scale is Log10(percentage). (* some test data *) data = Table[Null, {i, 4}]; data[[1]] = {{1, -5.8}, {2, -5.4}, {3, -0.8}, {4, -0.2}, {5, 4.6}, {1, -6.4}, {2, -5.6}, {3, -0.7}, {4, 0.04}, {5, 1.0}, {1, -6.8}, {2, -4.7}, {3, -1....
Post a Comment
Read more