Win a copy of Programmer's Guide to Java SE 8 Oracle Certified Associate (OCA) this week in the OCAJP forum!
  • Post Reply
  • Bookmark Topic Watch Topic
  • New Topic

clustering sets based on minimal distance

 
Ram Ghanta
Greenhorn
Posts: 1
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator

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..
 
  • Post Reply
  • Bookmark Topic Watch Topic
  • New Topic