conttable.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.
 */

/**
 * Title: XELOPES Data Mining Library
 * Description: The XELOPES library is an open platform-independent and data-source-independent library for Embedded Data Mining.
 * Copyright: Copyright (c) 2002 Prudential Systems Software GmbH
 * Company: ZSoft (www.zsoft.ru), Prudsys (www.prudsys.com)
 * @author Sascha Trautzsch
 * @author Michael Thess
 * @version 1.0
 */

package com.prudsys.pdm.Models.Classification.DecisionTree.Algorithms.GenTree;

/**
 * Contingency table contains class distributions of vectors for all
 * categories (categorical attribute) or intervals (numeric attribute).
 */
public class ContTable
{
  /** Contingency entries for all categories. Last entry for whole attribute. */
  public ContEntry[] ce;

  /** Numbers of vectors in classes. */
  public int[] classNumb;

  /** Number of all vectors. */
  public int sum;

  /**
   * Empty constructor.
   */
  public ContTable()
  {
  }

  /**
   * Constructor from a given array of contingency entries.
   *
   * @param ce array of contingency entries
   */
  public ContTable(ContEntry[] ce) {

    this.ce = ce;
    this.classNumb = null;
    int nsum = 0;
    if (ce != null && ce.length > 0) {
      int nclass = ce[0].getNumberOfClasses();
      classNumb = new int[ nclass ];
      for (int i = 0; i < ce.length; i++) {
        for (int j = 0; j < nclass; j++)
          classNumb[j] = classNumb[j] + ce[i].classNumb[j];
        nsum = nsum + ce[i].getSum();
      };
    };
    this.sum = nsum;
  }

  /**
   * Returns number of all vectors.
   *
   * @return number of all vectors
   */
  public int getSum()
  {
    return sum;
  }

  /**
   * Returns numbers of vectors for all classes.
   *
   * @return array of number of vectors for all classes
   */
  public int[] getClassNumb()
  {
    return classNumb;
  }

  /**
   * Returns number of all categories.
   *
   * @return number of all categories
   */
  public int getNumberOfCont() {

    if (ce == null)
      return 0;
    else
      return ce.length;
  }

  /**
   * Returns number of all classes.
   *
   * @return number of all classes
   */
  public int getNumberOfClasses() {

    int nclass = 0;
    if (ce != null && ce.length > 0)
      nclass = ce[0].getNumberOfClasses();

    return nclass;
  }

  /**
   * Returns contingence table as string.
   *
   * @return string representation of this class
   */
  public String toString() {

    String desc = "\n";
    for (int i = 0; i < getNumberOfCont(); i++)
      desc = desc + ce[i] + "\n";
    desc = desc + " Summary: " + "\n";
    for (int i = 0; i < getNumberOfClasses(); i++)
      desc = desc + "c" + String.valueOf(i) + ": " + classNumb[i] + " ";
    desc = desc + "sum = " + sum;

    return desc;
  }
}