1
$\begingroup$

I am looking for one or more algorithms that cluster points in non-euclidian vector space.

My axes, specifically, are X and Y in space and Z in time.

I was thinking about first clustering in X and Y only, then going ahead and internally clustering these by time.

I only know of graph-clustering algorithms so I'd be glad if anyone can give me some pointers.

  • 0
    What do you mean by a "non-Euclidean vector space"?2012-12-09
  • 0
    I mean that the distance between points is not defined. e.g. the distance between two points in space is |a-b| = sqrt(x*x+y*y) where x=a_x-b_x and y=a_y-b_y, the distance in time is simply |a-b| measured in a timespan. But you can't put a distance to a point in space *and* time at the same time. At least not that I knew of. (well I think that logically you can, but I dunno if it makes sense)2012-12-09

1 Answers 1