binarynumericalgenerator.java

一个很好的LIBSVM的JAVA源码。对于要研究和改进SVM算法的学者。可以参考。来自数据挖掘工具YALE工具包。

/*
 *  YALE - Yet Another Learning Environment
 *  Copyright (C) 2001-2004
 *      Simon Fischer, Ralf Klinkenberg, Ingo Mierswa, 
 *          Katharina Morik, Oliver Ritthoff
 *      Artificial Intelligence Unit
 *      Computer Science Department
 *      University of Dortmund
 *      44221 Dortmund,  Germany
 *  email: [e-mail]
 *  web:   http://yale.cs.uni-dortmund.de/
 *
 *  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., 59 Temple Place, Suite 330, Boston, MA 02111-1307
 *  USA.
 */
package edu.udo.cs.yale.generator;

import edu.udo.cs.yale.tools.LogService;
import edu.udo.cs.yale.tools.Ontology;
import edu.udo.cs.yale.example.ExampleTable;
import edu.udo.cs.yale.example.Attribute;
import edu.udo.cs.yale.example.DataRow;
import edu.udo.cs.yale.example.ExampleSet;

import java.util.List;
import java.util.ArrayList;

/** Objects of this generator class have two numerical input attributes and one output attribute. 
 *
 *  @version $Id: BinaryNumericalGenerator.java,v 2.5 2004/08/27 11:57:32 ingomierswa Exp $
 */
public abstract class BinaryNumericalGenerator extends FeatureGenerator {  

    private static final Attribute[] INPUT_ATTR = { new Attribute(Ontology.NUMERICAL, Ontology.SINGLE_VALUE),
						    new Attribute(Ontology.NUMERICAL, Ontology.SINGLE_VALUE) };


    public abstract double calculateValue(double value1, double value2);

    /** Must return true if this generator is commutative. */
    public abstract boolean isCommutative();

    /** Must return true if this generator is self applicable. */
    public abstract boolean isSelfApplicable();

    public Attribute[] getInputAttributes() {
	return INPUT_ATTR;
    }

    public Attribute[] getOutputAttributes(ExampleTable input) {
	Attribute a1 = getArgument(0);
	Attribute a2 = getArgument(1);
	Attribute ao = new Attribute(Ontology.NUMERICAL, Ontology.SINGLE_VALUE,
				     getFunction(), new Attribute[] { a1, a2 }, true,
				     //input.getNextFreeBlockNr(),
				     Attribute.UNDEFINED_BLOCK_NR,
				     null);
	return new Attribute[] { ao };
    }

//     /** Returns the number of attributes which matches the desired input attributes (numerical single value). */
//     public int getNumberOfApplicableGenerations(ExampleSet exampleSet) {
// 	int n1 = 0;
// 	int n2 = 0;
// 	int both = 0;
//   	for (int i = 0; i < exampleSet.getNumberOfAttributes(); i++) {
//   	    Attribute attribute = exampleSet.getAttribute(i);
//   	    if (attribute.compatible(INPUT_ATTR[0])) n1++;
//   	    if (attribute.compatible(INPUT_ATTR[1])) n2++;
// 	    if ((attribute.compatible(INPUT_ATTR[0])) && (attribute.compatible(INPUT_ATTR[1]))) both++;
//   	}
// 	if (getSelectionMode() == SELECTION_MODE_ALL) return n1*n2;
// 	else {
// 	    if (isCommutative() && isSelfApplicable())   return n1*n2 - ((both -1) * both)/2;
// 	    if (isCommutative() && !isSelfApplicable())  return n1*n2 - ((both -1) * both)/2 - both;
// 	    if (!isCommutative() && isSelfApplicable())  return n1*n2;
// 	    if (!isCommutative() && !isSelfApplicable()) return n1*n2 - both;
// 	    return 0;
// 	}
//     }


    /** Returns all compatible input attribute arrays for this generator from the given example set as list. */
    public List getInputCandidates(ExampleSet exampleSet, int maxDepth, String[] functions) {
	List result = new ArrayList();
	if (getSelectionMode() == SELECTION_MODE_ALL) {
	    for (int i = 0; i < exampleSet.getNumberOfAttributes(); i++) {
		Attribute first  = exampleSet.getAttribute(i);
		if (!checkCompatibility(first, INPUT_ATTR[0], maxDepth, functions)) continue;
		for (int j = 0; j < exampleSet.getNumberOfAttributes(); j++) {
		    Attribute second = exampleSet.getAttribute(j);
		    if (checkCompatibility(second, INPUT_ATTR[1], maxDepth, functions))
			result.add(new Attribute[] { first, second });
		}
	    }
	} else {
	    if (isCommutative() && isSelfApplicable()) {
		for (int i = 0; i < exampleSet.getNumberOfAttributes(); i++) {
		    Attribute first  = exampleSet.getAttribute(i);
		    if (!checkCompatibility(first, INPUT_ATTR[0], maxDepth, functions)) continue;
		    for (int j = i; j < exampleSet.getNumberOfAttributes(); j++) {
			Attribute second = exampleSet.getAttribute(j);
			if (checkCompatibility(second, INPUT_ATTR[1], maxDepth, functions))
			    result.add(new Attribute[] { first, second });
		    }
		}
	    } else if (isCommutative() && !isSelfApplicable()) {
		for (int i = 0; i < exampleSet.getNumberOfAttributes(); i++) {
		    Attribute first  = exampleSet.getAttribute(i);
		    if (!checkCompatibility(first, INPUT_ATTR[0], maxDepth, functions)) continue;
		    for (int j = i+1; j < exampleSet.getNumberOfAttributes(); j++) {
			Attribute second = exampleSet.getAttribute(j);
			if (checkCompatibility(second, INPUT_ATTR[1], maxDepth, functions))
			    result.add(new Attribute[] { first, second });
		    }
		}
	    } else if (!isCommutative() && isSelfApplicable()) {
		for (int i = 0; i < exampleSet.getNumberOfAttributes(); i++) {
		    Attribute first  = exampleSet.getAttribute(i);
		    if (!checkCompatibility(first, INPUT_ATTR[0], maxDepth, functions)) continue;
		    for (int j = 0; j < exampleSet.getNumberOfAttributes(); j++) {
			Attribute second = exampleSet.getAttribute(j);
			if (checkCompatibility(second, INPUT_ATTR[1], maxDepth, functions))
			    result.add(new Attribute[] { first, second });
		    }
		}
	    } else if (!isCommutative() && !isSelfApplicable()) {
		for (int i = 0; i < exampleSet.getNumberOfAttributes(); i++) {
		    Attribute first  = exampleSet.getAttribute(i);
		    if (!checkCompatibility(first, INPUT_ATTR[0], maxDepth, functions)) continue;
		    for (int j = 0; j < exampleSet.getNumberOfAttributes(); j++) {
			if (i != j) {
			    Attribute second = exampleSet.getAttribute(j);
			    if (checkCompatibility(second, INPUT_ATTR[1], maxDepth, functions))
				result.add(new Attribute[] { first, second });
			}
		    }
		}
	    }
	}
	return result;
    }


    public void generate(DataRow data) throws GenerationException {
	try {
  	    Attribute a0 = getArgument(0);
  	    Attribute a1 = getArgument(1);
	    double o1 = data.get(a0);
	    double o2 = data.get(a1);
	    double r = calculateValue(o1, o2);

	    if (Double.isInfinite(r)) {
		LogService.logMessage(getFunction() + ": Infinite value generated.", LogService.WARNING);
		throw new GenerationException(getFunction() + ": Infinite value generated.");
	    }
	    if (Double.isNaN(r)) {
		LogService.logMessage(getFunction() + ": NaN generated.", LogService.WARNING);
		throw new GenerationException(getFunction() + ": NaN generated.");
	    }

	    if (resultAttributes[0] != null)
		data.set(resultAttributes[0], r);
	} catch (ArrayIndexOutOfBoundsException ex) {
  	    throw new GenerationException("a1:" + getArgument(0) + " a2: " + getArgument(1), ex);
  	}
    }

    public String toString() {
	String s = "binary function (";
	if ((resultAttributes != null) && 
	    (resultAttributes.length > 0) &&
	    (resultAttributes[0] != null))
	    s += resultAttributes[0].getName()+":=";
	if (argumentsSet()) s+=getArgument(0).getName() + " ";
	s += getFunction();
	if (argumentsSet()) s+=" " + getArgument(1).getName();
	s += ")";
	return s;
    }
}