rulesetlist.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:        prudsys basket analysis
 * Description:  Basket analysis algorithms
 * Copyright:    Copyright (c) 2001
 * Company:      PRUDENTIAL SYSTEMS SOFTWARE GmbH
 * @author Stefan Ludwig
 * @author Michael Thess
 * @version 1.0
 */

package com.prudsys.pdm.Models.AssociationRules.Algorithms.AprioriSimple;

import java.util.Vector;

import com.prudsys.pdm.Models.AssociationRules.RuleSet;

/**
 * Handling of list of association rules.
 *
 * @author Stefan Ludwig
 * @author Michael Thess
 * @version 2.0, 2001/04/21
 */
public class RuleSetList {

    public Vector ruleset; // contains RuleSets
    int startfrom;

    /**
     * Constructor.
     */
    public RuleSetList() {

      ruleset   = new Vector();
      startfrom = 0;
    }

    /**
     * Add rule to list.
     *
     * @param rule rule to be added
     */
    public void addRule(RuleSet rule) {

      ruleset.addElement(rule);
    }

    /**
     * Checks whether a rule is contained in the list.
     *
     * @param rule rule to be checked
     * @return true if rule is contained, else false
     */
    public boolean contains(RuleSet rule) {

      for (int i = startfrom; i < ruleset.size(); i++) {
       if (rule.premise.equals(((RuleSet)(ruleset.elementAt(i))).premise)) {
         if (rule.conclusion.equals(((RuleSet)(ruleset.elementAt(i))).conclusion))
            return true;
       }
      }
      return false;
    }

   /**
    * Get the number of rulesets in list.
    *
    * @return number of rulesets
    */
    public int getSize() {

      return ruleset.size();
    }

    /**
     * Gets ruleset at specified index.
     *
     * @param index position of ruleset
     * @return ruleset at specified position
     */
    public RuleSet getRuleSetAt(int index) {

      return (RuleSet) ruleset.elementAt(index);
    }

  /**
   * String representation of rule set list.
   *
   * @return String representation
   */
  public String toString() {

    String text = "";
    for (int i = 0; i < ruleset.size(); i++) {
      text = text + ((RuleSet)ruleset.elementAt(i)).toString();
      if (i < ruleset.size() - 1)
        text = text + "\n";
    };

    return text;
  }

    /**
     * Print all association rules.
     */
    public void print() {

      System.out.println(toString());
    }
}