package jsat.classifiers.bayesian;

import java.util.Arrays;
import jsat.classifiers.*;
import jsat.distributions.Normal;
import jsat.exceptions.UntrainedModelException;
import jsat.linear.IndexValue;
import jsat.linear.Vec;
import jsat.math.OnLineStatistics;
import static java.lang.Math.*;
import jsat.math.MathTricks;

/**
 * An implementation of Gaussian Naive Bayes that can be updated in an online 
 * fashion. The ability to be updated comes at the cost to slower training and 
 * classification time. However NB is already very fast, so the difference is 
 * not significant. 
* The more advanced distribution detection of {@link NaiveBayes} is not * possible in online form. * * @author Edward Raff */ public class NaiveBayesUpdateable extends BaseUpdateableClassifier { private static final long serialVersionUID = 1835073945715343486L; /** * Counts for each option */ private double[][][] apriori; /** * Online stats about the variable values */ private OnLineStatistics[][] valueStats; private double priorSum = 0; private double[] priors; /** * Handles how vectors are handled. If true, it is assumed vectors are sparce - and zero values will be ignored when training and classifying. */ private boolean sparseInput = true; /** * Creates a new Naive Bayes classifier that assumes sparce input vectors */ public NaiveBayesUpdateable() { this(true); } /** * Creates a new Naive Bayes classifier * @param sparse whether or not to assume input vectors are sparce */ public NaiveBayesUpdateable(boolean sparse) { setSparse(sparse); } /** * Copy Constructor * @param other the classifier to make a copy of */ protected NaiveBayesUpdateable(NaiveBayesUpdateable other) { this(other.sparseInput); if(other.apriori != null) { this.apriori = new double[other.apriori.length][][]; this.valueStats = new OnLineStatistics[other.valueStats.length][]; for(int i = 0; i < other.apriori.length; i++) { this.apriori[i] = new double[other.apriori[i].length][]; for(int j = 0; j < other.apriori[i].length; j++) this.apriori[i][j] = Arrays.copyOf(other.apriori[i][j], other.apriori[i][j].length); this.valueStats[i] = new OnLineStatistics[other.valueStats[i].length]; for(int j = 0; j < this.valueStats[i].length; j++) this.valueStats[i][j] = new OnLineStatistics(other.valueStats[i][j]); } this.priorSum = other.priorSum; this.priors = Arrays.copyOf(other.priors, other.priors.length); } } @Override public NaiveBayesUpdateable clone() { return new NaiveBayesUpdateable(this); } @Override public void setUp(CategoricalData[] categoricalAttributes, int numericAttributes, CategoricalData predicting) { int nCat = predicting.getNumOfCategories(); apriori = new double[nCat][categoricalAttributes.length][]; valueStats = new OnLineStatistics[nCat][numericAttributes]; priors = new double[nCat]; priorSum = nCat; Arrays.fill(priors, 1.0); for (int i = 0; i < nCat; i++) { //Iterate through the categorical variables for (int j = 0; j < categoricalAttributes.length; j++) { apriori[i][j] = new double[categoricalAttributes[j].getNumOfCategories()]; //Laplace correction, put in an extra occurance for each variable for (int z = 0; z < apriori[i][j].length; z++) apriori[i][j][z] = 1; } for(int j = 0; j < numericAttributes; j++) valueStats[i][j] = new OnLineStatistics(); } } @Override public void update(DataPoint dataPoint, int targetClass) { double weight = dataPoint.getWeight(); Vec x = dataPoint.getNumericalValues(); if (sparseInput) for (IndexValue iv : x) valueStats[targetClass][iv.getIndex()].add(iv.getValue(), weight); else for (int j = 0; j < x.length(); j++) valueStats[targetClass][j].add(x.get(j), weight); //Categorical value updates int[] catValues = dataPoint.getCategoricalValues(); for(int j = 0; j < apriori[targetClass].length; j++) apriori[targetClass][j][catValues[j]]++; priorSum++; priors[targetClass]++; } @Override public CategoricalResults classify(DataPoint data) { if(apriori == null) throw new UntrainedModelException("Model has not been intialized"); CategoricalResults results = new CategoricalResults(apriori.length); double[] logProbs = new double[apriori.length]; double maxLogProg = Double.NEGATIVE_INFINITY; Vec numVals = data.getNumericalValues(); for( int i = 0; i < valueStats.length; i++) { double logProb = 0; if(sparseInput) { for(IndexValue iv : numVals) { int indx = iv.getIndex(); double mean = valueStats[i][indx].getMean(); double stndDev = valueStats[i][indx].getStandardDeviation(); double logPDF = Normal.logPdf(iv.getValue(), mean, stndDev); if(Double.isNaN(logPDF)) logProb += Math.log(1e-16); else if(Double.isInfinite(logPDF))//Avoid propigation -infinty when the probability is zero logProb += Math.log(1e-16); else logProb += logPDF; } } else { for(int j = 0; j < valueStats[i].length; j++) { double mean = valueStats[i][j].getMean(); double stdDev = valueStats[i][j].getStandardDeviation(); double logPDF = Normal.logPdf(numVals.get(j), mean, stdDev); if(Double.isInfinite(logPDF))//Avoid propigation -infinty when the probability is zero logProb += Math.log(1e-16);// else logProb += logPDF; } } //the i goes up to the number of categories, same for aprioror for(int j = 0; j < apriori[i].length; j++) { double sum = 0; for(int z = 0; z < apriori[i][j].length; z++) sum += apriori[i][j][z]; double p = apriori[i][j][data.getCategoricalValue(j)]; logProb += Math.log(p/sum); } logProb += Math.log(priors[i]/priorSum); logProbs[i] = logProb; maxLogProg = Math.max(maxLogProg, logProb); } double denom =MathTricks.logSumExp(logProbs, maxLogProg); for(int i = 0; i < results.size(); i++) results.setProb(i, exp(logProbs[i]-denom)); results.normalize(); return results; } @Override public boolean supportsWeightedData() { return true; } /** * Returns true if the input is assume sparse * @return true if the input is assume sparse */ public boolean isSparseInput() { return sparseInput; } /** * Sets whether or not that classifier should behave as if the input vectors * are sparse. This means zero values in the input will be ignored when * performing classification. * * @param sparseInput true to use a sparse model */ public void setSparse(boolean sparseInput) { this.sparseInput = sparseInput; } }

Ads help maintain this website.