This week's book giveaway is in the Servlets forum.
We're giving away four copies of Murach's Java Servlets and JSP and have Joel Murach on-line!
See this thread for details.
The moose likes General Computing and the fly likes clustering sets based on minimal distance Big Moose Saloon
  Search | Java FAQ | Recent Topics | Flagged Topics | Hot Topics | Zero Replies
Register / Login


Win a copy of Murach's Java Servlets and JSP this week in the Servlets forum!
JavaRanch » Java Forums » Engineering » General Computing
Bookmark "clustering sets based on minimal distance" Watch "clustering sets based on minimal distance" New topic
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..
 
I agree. Here's the link: http://aspose.com/file-tools
 
subject: clustering sets based on minimal distance
 
Similar Threads
Calculating the distance between two points problem
IBM mock
Need math/trig(?) help for Java game
Turning String into int
use of Wrappers in switch() and case x: statements