datapoint.java

it is java code for k means clustering algorithm

package cluster1;



public class DataPoint {
    private double mX,mY;
    private String mObjName;
    private Cluster mCluster;
    private double mEuDt;

    public DataPoint(double x, double y, String name) {
        this.mX = x;
        this.mY = y;
        this.mObjName = name;
        this.mCluster = null;
    }

    public void setCluster(Cluster cluster) {
        this.mCluster = cluster;
        calcEuclideanDistance();
    }

    public void calcEuclideanDistance() { 
    
    //called when DP is added to a cluster or when a Centroid is recalculated.
//System.out.println("calcu E is (x,y) is  "+mX+","+mY+"and cent is  "+mCluster.getCentroid().getCx()+" , "+mCluster.getCentroid().getCy());
        mEuDt = Math.sqrt(Math.pow((mX - mCluster.getCentroid().getCx()),2) + Math.pow((mY - mCluster.getCentroid().getCy()),2));
    }

    public double testEuclideanDistance(Centroid c) {
      //System.out.println("Test Euc is (x,y) is  "+mX+","+mY+"and cent is  "+c.getCx()+" , "+c.getCy());
  
	return Math.sqrt(Math.pow((mX - c.getCx()), 2) + Math.pow((mY - c.getCy()), 2));
    }

    public double getX() {
        return mX;
    }

    public double getY() {
        return mY;
    }

    public Cluster getCluster() {
        return mCluster;
    }

    public double getCurrentEuDt() {
        return mEuDt;
    }

    public String getObjName() {
        return mObjName;
    }

}