node.java

Birch

package clustering_feature_tree;
/**
 * <p>Title: </p>
 *
 * <p>Description: </p>
 *
 * <p>Copyright: Copyright (c) 2006</p>
 *
 * <p>Company: </p>
 *
 * @author not attributable
 * @version 1.0
 */
public class node implements Cloneable{
    node child[];
    boolean leaf;
    int n=0;//有多少个LS项
    double[][] LS;// 第一个[]第几个key值，第二个[]表示表示纬度
    double[] SS;
    int num[];//对于每一个LS项中，所包含的数据点的个数
    public node(int vector,int B_or_T) {
        LS=new double[B_or_T][vector];
        SS=new double[B_or_T];
        num=new int[B_or_T];
    }
    public node(){
    }
    public void value_B_or_T_and_vector(int vector,int B_or_T){
        LS=new double[B_or_T][vector];
        SS=new double[B_or_T];
        num=new int[B_or_T];
    }
    public void child_(int B){
        child=new node[B];
        this.leaf=false;
    }
    public Object clone(){
        node cloned;
        try{
            cloned = (node)super.clone();
            cloned.leaf=this.leaf;
            cloned.n=this.n;
            for(int i=0;i<n;i++){
                cloned.SS[i]=this.SS[i];
                cloned.num[i]=this.num[i];
                cloned.child[i]=this.child[i];
                for(int j=0;j<LS[0].length;j++){
                    cloned.LS[i][j]=this.LS[i][j];
                }
            }
            return cloned;
        }catch(Exception e){
            System.out.print(e.toString());
            return null;
        }
    }
}