gainratiosplitcrit.java

一个数据挖掘软件ALPHAMINERR的整个过程的JAVA版源代码

/*
 *    This program is free software; you can redistribute it and/or modify
 *    it under the terms of the GNU General Public License as published by
 *    the Free Software Foundation; either version 2 of the License, or
 *    (at your option) any later version.
 *
 *    This program is distributed in the hope that it will be useful,
 *    but WITHOUT ANY WARRANTY; without even the implied warranty of
 *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *    GNU General Public License for more details.
 *
 *    You should have received a copy of the GNU General Public License
 *    along with this program; if not, write to the Free Software
 *    Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 */

/*
 *    GainRatioSplitCrit.java
 *    Copyright (C) 1999 Eibe Frank
 *
 */

package weka.classifiers.trees.j48;

import weka.core.Utils;

/**
 * Class for computing the gain ratio for a given distribution.
 *
 * @author Eibe Frank ([e-mail])
 * @version $Revision$
 */
public final class GainRatioSplitCrit extends EntropyBasedSplitCrit{

  /**
   * This method is a straightforward implementation of the gain
   * ratio criterion for the given distribution.
   */
  public final double splitCritValue(Distribution bags) {

    double numerator;
    double demerator;
    
    numerator = oldEnt(bags)-newEnt(bags);

    // Splits with no gain are useless.
    if (Utils.eq(numerator,0))
      return Double.MAX_VALUE;
    demerator = splitEnt(bags);
    
    // Test if split is trivial.
    if (Utils.eq(demerator,0))
      return Double.MAX_VALUE;
    
    //  We take the reciprocal value because we want to minimize the
    // splitting criterion's value.
    return demerator/numerator;
  }

  /**
   * This method computes the gain ratio in the same way C4.5 does.
   *
   * @param bags the distribution
   * @param totalnoInst the weight of ALL instances
   * @param numerator the info gain
   */
  public final double splitCritValue(Distribution bags, double totalnoInst,
				     double numerator){
    
    double demerator;
    double noUnknown;
    double unknownRate;
    int i;
    
    // Compute split info.
    demerator = splitEnt(bags,totalnoInst);
        
    // Test if split is trivial.
    if (Utils.eq(demerator,0))
      return 0;  
    demerator = demerator/totalnoInst;

    return numerator/demerator;
  }
  
  /**
   * Help method for computing the split entropy.
   */
  private final double splitEnt(Distribution bags,double totalnoInst){
    
    double returnValue = 0;
    double noUnknown;
    int i;
    
    noUnknown = totalnoInst-bags.total();
    if (Utils.gr(bags.total(),0)){
      for (i=0;i<bags.numBags();i++)
	returnValue = returnValue-logFunc(bags.perBag(i));
      returnValue = returnValue-logFunc(noUnknown);
      returnValue = returnValue+logFunc(totalnoInst);
    }
    return returnValue;
  }
}