/***********************************************************************
This file is part of KEEL-software, the Data Mining tool for regression,
classification, clustering, pattern mining and so on.
Copyright (C) 2004-2010
F. Herrera (herrera@decsai.ugr.es)
L. S�nchez (luciano@uniovi.es)
J. Alcal�-Fdez (jalcala@decsai.ugr.es)
S. Garc�a (sglopez@ujaen.es)
A. Fern�ndez (alberto.fernandez@ujaen.es)
J. Luengo (julianlm@decsai.ugr.es)
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 3 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, see http://www.gnu.org/licenses/
**********************************************************************/
/**
* <p>
* @author Written by Luciano S�nchez (University of Oviedo) 21/01/2004
* @author Modified by M.R. Su�rez (University of Oviedo) 18/12/2008
* @author Modified by Enrique A. de la Cal (University of Oviedo) 21/12/2008
* @version 1.0
* @since JDK1.5
* </p>
*/
package keel.Algorithms.Fuzzy_Rule_Learning.Genetic.Shared.Node;
import keel.Algorithms.Fuzzy_Rule_Learning.Shared.Fuzzy.*;
public class NodeRuleBase extends Node {
/**
* <p>
* Class for management of a node rule base
* </p>
*/
// Internal Node (root node, in general)
// A vector of pairs integer/weight is evaluated
/**
* <p>
* Constructor. Generate a new node rule base from list of rule node
* </p>
* @param br The list of rule node
*/
public NodeRuleBase(NodeRule []br) {
super(br.length,NRuleBase);
for (int i=0;i<br.length;i++) children[i]=br[i].clone();
}
/**
* <p>
* Constructor. Generate a new node rule base from another one
* </p>
* @param br The node rule base
*/
public NodeRuleBase(NodeRuleBase br) {
super(br.children.length,NRuleBase);
for (int i=0;i<br.children.length;i++) children[i]=br.children[i].clone();
}
/**
* <p>
* This method sets a node rule base to another one
* </p>
* @param br The node rule base
*/
public void set(NodeRuleBase br) {
super.set(br);
for (int i=0;i<br.children.length;i++) children[i]=br.children[i].clone();
}
/**
* <p>
* This method clones a node from a node rule base
* </p>
* @return The node cloned
*/
public Node clone() {
return new NodeRuleBase(this);
}
/**
* <p>
* This method evaluates if two nodes are the same type
* </p>
* @return True or false
*/
protected boolean compatibleData(Node n) {
if (mytypeid!=n.mytypeid) return false;
return true;
}
/**
* <p>
* This method evaluates the node rule base
* </p>
* @return The set of pairs consequent-weight
*/
public IntDouble[] CrispEval() {
if (children.length==0) return new IntDouble[0];
else {
IntDouble[] result=new IntDouble[children.length];
for (int i=0;i<result.length;i++) {
NodeRule tmp=(NodeRule)children[i];
result[i]=tmp.CrispEval();
}
return result;
}
}
/**
* <p>
* This method is for debug
* </p>
*/
public void debug() {
for (int i=0;i<children.length;i++) {
children[i].debug();
}
}
/**
* <p>
* This method is for debug
* @return output the nodeRuleBase
* </p>
*/
public String output() {
String output = new String();
for (int i=0;i<children.length;i++) {
output += children[i].output();
}
return output;
}
}