jidt/java/source/infodynamics/measures/discrete/OInfoCalculatorDiscrete.java

86 lines
3.0 KiB
Java
Executable File

/*
* Java Information Dynamics Toolkit (JIDT)
* Copyright (C) 2012, Joseph T. Lizier
*
* 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/>.
*/
package infodynamics.measures.discrete;
import infodynamics.utils.MathsUtils;
import infodynamics.utils.MatrixUtils;
/**
* <p>Computes the O-information of a given multivariate
* <code>int[][]</code> set of
* observations (extending {@link MultiVariateInfoMeasureCalculatorDiscrete}).</p>
*
* <p>Usage is as per the paradigm outlined for {@link MultiVariateInfoMeasureCalculatorDiscrete}.
* </p>
*
* <p><b>References:</b><br/>
* <ul>
* <li>Rosas, F., Mediano, P., Gastpar, M, Jensen, H.,
* <a href="http://dx.doi.org/10.1103/PhysRevE.100.032305">"Quantifying high-order
* interdependencies via multivariate extensions of the mutual information"</a>,
* Physical Review E 100, (2019) 032305.</li>
* </ul>
*
* @author Pedro A.M. Mediano (<a href="pmediano at pm.me">email</a>,
* <a href="http://www.doc.ic.ac.uk/~pam213">www</a>)
*/
public class OInfoCalculatorDiscrete
extends MultiVariateInfoMeasureCalculatorDiscrete {
/**
* Construct an instance.
*
* @param base number of symbols for each variable.
* E.g. binary variables are in base-2.
* @param numVars numbers of joint variables that DTC
* will be computed over.
*/
public OInfoCalculatorDiscrete(int base, int numVars) {
super(base, numVars);
}
protected double computeLocalValueForTuple(int[] tuple, int jointValue) {
if (jointCount[jointValue] == 0) {
// This joint state does not occur, so it makes no contribution here
return 0;
}
double jointProb = (double) jointCount[jointValue] / (double) observations;
double logValue = (2 - numVars) * Math.log(jointProb);
for (int i = 0; i < numVars; i++) {
int bigMarginalState = computeBigMarginalState(jointValue, i, tuple[i]);
double bigMarginalProb = (double) bigMarginalCounts[i][bigMarginalState] / (double) observations;
double smallMarginalProb = (double) smallMarginalCounts[i][tuple[i]] / (double) observations;
logValue += Math.log(bigMarginalProb) - Math.log(smallMarginalProb);
}
double localValue = logValue / log_2;
if (jointProb > 0.0) {
checkLocals(localValue);
}
return localValue;
}
}