package jsat.distributions.multivariate;

import java.util.ArrayList;
import java.util.List;
import java.util.Random;
import jsat.classifiers.DataPoint;
import jsat.linear.CholeskyDecomposition;
import jsat.linear.DenseMatrix;
import jsat.linear.DenseVector;
import jsat.linear.LUPDecomposition;
import jsat.linear.Matrix;
import jsat.linear.MatrixStatistics;
import jsat.linear.SingularValueDecomposition;
import jsat.linear.Vec;
import static java.lang.Math.*;
import static jsat.linear.MatrixStatistics.*;

/**
 * Class for the multivariate Normal distribution. It is often called the Multivariate Gaussian distribution. 
 * 
 * @author Edward Raff
 */
public class NormalM extends MultivariateDistributionSkeleton
{

    private static final long serialVersionUID = -7043369396743253382L;
    /**
     * When computing the PDF of some x, part of the equation is only dependent on the covariance matrix. This part is
     * 
     *       -k
     *       --          -1
     *        2          --
     * /  __\             2
     * \2 ||/   (|Sigma|)
     * 
* where k is the dimension, Sigma is the covariance matrix, and || denotes the determinant.
* Taking the negative log of this gives *
     *         /  __\
     * (-k) log\2 ||/ - log(|Sigma|)
     * -----------------------------
     *               2
     * 
* * This can then be added to the log of the x dependent part, which, when exponentiated, gives the correct result of dividing by this term. */ private double logPDFConst; /** * When we compute the constant {@link #logPDFConst}, we only need the inverse of the covariance matrix. */ private Matrix invCovariance; private Vec mean; /** * Lower triangular cholesky decomposition used for sampling such that L * LT = Covariance Matrix */ private Matrix L; public NormalM(Vec mean, Matrix covariance) { setMeanCovariance(mean, covariance); } public NormalM() { } /** * Sets the mean and covariance for this distribution. For an n dimensional distribution, * mean should be of length n and covariance should be an n by n matrix. * It is also a requirement that the matrix be symmetric positive definite. * @param mean the mean for the distribution. A copy will be used. * @param covariance the covariance for this distribution. A copy will be used. * @throws ArithmeticException if the mean and covariance do not agree, or the covariance is not * positive definite. An exception may not be throw for all bad matrices. */ public void setMeanCovariance(Vec mean, Matrix covariance) { if(!covariance.isSquare()) throw new ArithmeticException("Covariance matrix must be square"); else if(mean.length() != covariance.rows()) throw new ArithmeticException("The mean vector and matrix must have the same dimension," + mean.length() + " does not match [" + covariance.rows() + ", " + covariance.rows() +"]" ); //Else, we are good! this.mean = mean.clone(); setCovariance(covariance); } /** * Sets the covariance matrix for this matrix. * @param covMatrix set the covariance matrix used for this distribution * @throws ArithmeticException if the covariance matrix is not square, * does not agree with the mean, or is not positive definite. An * exception may not be throw for all bad matrices. */ public void setCovariance(Matrix covMatrix) { if(!covMatrix.isSquare()) throw new ArithmeticException("Covariance matrix must be square"); else if(covMatrix.rows() != this.mean.length()) throw new ArithmeticException("Covariance matrix does not agree with the mean"); CholeskyDecomposition cd = new CholeskyDecomposition(covMatrix.clone()); L = cd.getLT(); L.mutableTranspose(); LUPDecomposition lup = new LUPDecomposition(covMatrix.clone()); int k = mean.length(); double det = lup.det(); if(Double.isNaN(det) || det < 1e-10) { //Numerical unstable or sub rank matrix. Use the SVD to work with the more stable pesudo matrix SingularValueDecomposition svd = new SingularValueDecomposition(covMatrix.clone()); //We need the rank deficient PDF and pesude inverse this.logPDFConst = 0.5*log(svd.getPseudoDet() * pow(2*PI, svd.getRank())); this.invCovariance = svd.getPseudoInverse(); } else { this.logPDFConst = (-k*log(2*PI)-log(det))*0.5; this.invCovariance = lup.solve(Matrix.eye(k)); } } @Override public double logPdf(Vec x) { if(mean == null) throw new ArithmeticException("No mean or variance set"); Vec xMinusMean = x.subtract(mean); //Compute the part that is depdentent on x double xDependent = xMinusMean.dot(invCovariance.multiply(xMinusMean))*-0.5; return logPDFConst + xDependent; } @Override public double pdf(Vec x) { double pdf = exp(logPdf(x)); if(Double.isInfinite(pdf) || Double.isNaN(pdf))//Ugly numerical error has occured return 0; return pdf; } @Override public boolean setUsingData(List dataSet, boolean parallel) { Vec origMean = this.mean; try { Vec newMean = MatrixStatistics.meanVector(dataSet); Matrix covariance = MatrixStatistics.covarianceMatrix(newMean, dataSet); this.mean = newMean; setCovariance(covariance); return true; } catch(ArithmeticException ex) { this.mean = origMean; return false; } } @Override public NormalM clone() { NormalM clone = new NormalM(); if(this.invCovariance != null) clone.invCovariance = this.invCovariance.clone(); if(this.mean != null) clone.mean = this.mean.clone(); clone.logPDFConst = this.logPDFConst; return clone; } @Override public List sample(int count, Random rand) { List samples = new ArrayList<>(count); Vec Z = new DenseVector(L.rows()); for(int i = 0; i < count; i++) { for(int j = 0; j < Z.length(); j++) Z.set(j, rand.nextGaussian()); Vec sample = L.multiply(Z); sample.mutableAdd(mean); samples.add(sample); } return samples; } }

Ads help maintain this website.