rsgenerator.java

代码是一个分类器的实现,其中使用了部分weka的源代码。可以将项目导入eclipse运行

package com.lqy.GEP;
import java.util.*;
public class RSGenerator{
	public ArrayList<Double> DiscreteDistribution=new ArrayList<Double>();
	public ArrayList<Double> ReverseSearchTable=new ArrayList<Double>();
    public RSGenerator(){}
    public void UpdateDiscreteDistribution(ArrayList<Double> argA){
    //	System.out.println(argA.size());
    	this.DiscreteDistribution.clear();
    	this.ReverseSearchTable.clear();
    	this.Nomalization(argA);
    	this.InitReverseSearchTable();
  //  	System.out.println(this.ReverseSearchTable.size());
    }
    private void Nomalization(ArrayList<Double> argA){
    	double tempS=0;
    	for(int i=0;i<argA.size();i++)
    		tempS+=argA.get(i);
    	if(Math.abs(tempS-1)>=Double.MIN_VALUE){
    		for(int i=0;i<argA.size();i++)
    			this.DiscreteDistribution.add(i, argA.get(i)/tempS);
    	}else{
    		for(int i=0;i<argA.size();i++)
    			this.DiscreteDistribution.add(i,argA.get(i));
    	}
    }
    private void InitReverseSearchTable(){
    	double tempS=0;
    	for(int i=0;i<this.DiscreteDistribution.size();i++){
    		tempS+=this.DiscreteDistribution.get(i);
    		this.ReverseSearchTable.add(i,tempS);
    	}
   // 	System.out.println(this.DiscreteDistribution.size()+" "+this.ReverseSearchTable.size());
    }
    public int NextInt(){
    	try{Thread.sleep(1);}catch(Exception e){e.printStackTrace();}
    	int tempI=0;
    	Random tempR=new Random();
    	double tempD=tempR.nextDouble();
    	for(int i=0;i<this.ReverseSearchTable.size();i++)
    		if(tempD<this.ReverseSearchTable.get(i)){
    			tempI=i;
    			break;
    		}
    	return tempI;
    }
}