| Author |
clustering sets based on minimal distance
|
Ram Ghanta
Greenhorn
Joined: Aug 16, 2011
Posts: 1
|
|
Lets the space s={x1, x2, x3, x4, x5……… xn}, of each element in space is p dimensional vector.
and distance functions can be { D1, D2, D3, D4, D5….. Dk}.. ∀i=1 to k if distance Di(x2-x1) is minimum, then the {x2,x1} is clustered into di. This should be calculated to whole space s.
few distance functions are: euclidean, mahalonobis and so on. I have to implement this in java program..please help me to sort this out..
|
 |
 |
|
|
subject: clustering sets based on minimal distance
|
|
|
0
