Skip to main content
replaced http://stackoverflow.com/ with https://stackoverflow.com/
Source Link

I am pretty new to clustering, so please be patient.

I have a set of points, and each point has a weight. I need to group these points into N clusters (N is defined).

I need these clusters to satisfy two conditions:

  • The points of a cluster must be spatially connected.
  • If a cluster has points with high weights, it must be smaller (less points). On the contrary, if the sum of the weights is small, it must have more points.

I have read another postanother post that did something very similar.

It defined the distance between points, inserting the weight as a forth dimension. Then it defined several parameters to give more importance to the distance or to the weights. I cannot define these parameters (I think this would change for each example I try).

Also, this other post did not recommend any clustering algorithm...and I don't know where to start.

Thanks for the help!

PS: By the way, it would help if the algorithm is very fast.

I am pretty new to clustering, so please be patient.

I have a set of points, and each point has a weight. I need to group these points into N clusters (N is defined).

I need these clusters to satisfy two conditions:

  • The points of a cluster must be spatially connected.
  • If a cluster has points with high weights, it must be smaller (less points). On the contrary, if the sum of the weights is small, it must have more points.

I have read another post that did something very similar.

It defined the distance between points, inserting the weight as a forth dimension. Then it defined several parameters to give more importance to the distance or to the weights. I cannot define these parameters (I think this would change for each example I try).

Also, this other post did not recommend any clustering algorithm...and I don't know where to start.

Thanks for the help!

PS: By the way, it would help if the algorithm is very fast.

I am pretty new to clustering, so please be patient.

I have a set of points, and each point has a weight. I need to group these points into N clusters (N is defined).

I need these clusters to satisfy two conditions:

  • The points of a cluster must be spatially connected.
  • If a cluster has points with high weights, it must be smaller (less points). On the contrary, if the sum of the weights is small, it must have more points.

I have read another post that did something very similar.

It defined the distance between points, inserting the weight as a forth dimension. Then it defined several parameters to give more importance to the distance or to the weights. I cannot define these parameters (I think this would change for each example I try).

Also, this other post did not recommend any clustering algorithm...and I don't know where to start.

Thanks for the help!

PS: By the way, it would help if the algorithm is very fast.

Tweeted twitter.com/#!/StackStats/status/108337930283646976
edited title
Link
user88
user88

Weighted Spatial Clusteringspatial clustering

Post Migrated Here from stackoverflow.com (revisions)
Source Link
Sara
Sara

Weighted Spatial Clustering

I am pretty new to clustering, so please be patient.

I have a set of points, and each point has a weight. I need to group these points into N clusters (N is defined).

I need these clusters to satisfy two conditions:

  • The points of a cluster must be spatially connected.
  • If a cluster has points with high weights, it must be smaller (less points). On the contrary, if the sum of the weights is small, it must have more points.

I have read another post that did something very similar.

It defined the distance between points, inserting the weight as a forth dimension. Then it defined several parameters to give more importance to the distance or to the weights. I cannot define these parameters (I think this would change for each example I try).

Also, this other post did not recommend any clustering algorithm...and I don't know where to start.

Thanks for the help!

PS: By the way, it would help if the algorithm is very fast.