Uses of Interface
edu.cmu.tetrad.search.IndependenceTest
Packages that use IndependenceTest
Package
Description
-
Uses of IndependenceTest in edu.cmu.tetrad.algcomparison.independence
Methods in edu.cmu.tetrad.algcomparison.independence that return IndependenceTestModifier and TypeMethodDescriptionBdeuTest.getTest(DataModel dataSet, Parameters parameters) CciLingamTest.getTest(DataModel dataSet, Parameters parameters) CciTest.getTest(DataModel dataSet, Parameters parameters) ChiSquare.getTest(DataModel dataSet, Parameters parameters) Codec.getTest(DataModel dataSet, Parameters parameters) ConditionalGaussianLRT.getTest(DataModel dataSet, Parameters parameters) DegenerateGaussianLRT.getTest(DataModel dataSet, Parameters parameters) DiscreteBicTest.getTest(DataModel dataSet, Parameters parameters) DSeparationTest.getTest(DataModel dataSet, Parameters parameters) FisherZ.getTest(DataModel dataSet, Parameters parameters) Gsquare.getTest(DataModel dataSet, Parameters parameters) IndependenceWrapper.getTest(DataModel dataSet, Parameters parameters) Returns true iff x and y are independent conditional on z for the given data set.Kci.getTest(DataModel dataSet, Parameters parameters) KimEtAlScoreTests.getTest(DataModel dataSet, Parameters parameters) MagSemBicTest.getTest(DataModel dataSet, Parameters parameters) Mnlrlrt.getTest(DataModel dataSet, Parameters parameters) MultinomialLogisticRegressionWald.getTest(DataModel dataSet, Parameters parameters) Mvplrt.getTest(DataModel dataSet, Parameters parameters) PositiveCorr.getTest(DataModel dataSet, Parameters parameters) ProbabilisticTest.getTest(DataModel dataSet, Parameters parameters) SemBicDTest.getTest(DataModel dataSet, Parameters parameters) SemBicTest.getTest(DataModel dataSet, Parameters parameters) -
Uses of IndependenceTest in edu.cmu.tetrad.graph
Methods in edu.cmu.tetrad.graph with parameters of type IndependenceTestModifier and TypeMethodDescriptionvoidPaths.removeByPossibleDsep(IndependenceTest test, SepsetMap sepsets) Remove edges by the possible d-separation rule. -
Uses of IndependenceTest in edu.cmu.tetrad.search
Classes in edu.cmu.tetrad.search that implement IndependenceTestModifier and TypeClassDescriptionfinal classChecks the conditional independence X _||_ Y | S, where S is a set of discrete variable, and X and Y are discrete variable not in S, by applying a conditional Chi Square test.final classChecks conditional independence of variable in a continuous data set using Fisher's Z test.final classChecks conditional independence of variable in a continuous data set using a conditional correlation test for the nonlinear nonGaussian case.final classChecks conditional independence of variable in a continuous data set using a conditional correlation test for the nonlinear nonGaussian case.classPerforms a test of conditional independence X _||_ Y | Z1...Zn where all searchVariables are either continuous or discrete.final classChecks conditional independence for continuous variables using Cramer's T-test formula (Cramer, Mathematical Methods of Statistics (1951), page 413).classclassChecks independence facts for variables associated with the nodes in a given graph by checking d-separation facts on the underlying nodes.final classChecks conditional independence of variable in a continuous data set using Fisher's Z test.final classCalculates independence from pooled residuals.final classCalculates independence from pooled residuals.final classChecks independence of X _||_ Y | Z for variables X and Y and list Z of variables.final classCalculates independence from pooled residuals.final classChecks conditional independence of variable in a continuous data set using Fisher's Z test.final classChecks the conditional independence X _||_ Y | S, where S is a set of discrete variable, and X and Y are discrete variable not in S, by applying a conditional G Square test.final classChecks the conditional independence X _||_ Y | S, where S is a set of continuous variable, and X and Y are discrete variable not in S, using the Hilbert-Schmidth Independence Criterion (HSIC), a kernel based nonparametric test for conditional independence.final classChecks conditional independence against a list of conditional independence facts, manually entered.classPerforms a test of conditional independence X _||_ Y | Z1...Zn where all searchVariables are either continuous or discrete.classPerforms a test of conditional independence X _||_ Y | Z1...Zn where all searchVariables are either continuous or discrete.final classPools together a set of independence tests using a specified methodsclassPerforms a test of conditional independence X _||_ Y | Z1...Zn where all searchVariables are either continuous or discrete.classPerforms a test of conditional independence X _||_ Y | Z1...Zn where all searchVariables are either continuous or discrete.final classChecks conditional independence of variable in a continuous data set using Fisher's Z test.classUses BCInference by Cooper and Bui to calculate probabilistic conditional independence judgments.final classChecks independence of X _||_ Y | Z for variables X and Y and list Z of variables.classInterface implemented by classes that do conditional independence testing.classChecks independence facts for variables associated associated with a sepset by simply querying the sepsetfinal classChecks d-separations in structural model using t-separations over indicators.classKernal Independence Test (KCI).classUses BCInference by Cooper and Bui to calculate probabilistic conditional independence judgments.Methods in edu.cmu.tetrad.search that return IndependenceTestModifier and TypeMethodDescriptionBFci.getIndependenceTest()The independence test.BuildPureClusters.getIndependenceTest()Cpc.getIndependenceTest()CpcStable.getIndependenceTest()Fas.getIndependenceTest()FasConcurrent.getIndependenceTest()Deprecated.FasDeterministic.getIndependenceTest()FasFdr.getIndependenceTest()FasStableConcurrentFdr.getIndependenceTest()Fasts.getIndependenceTest()Fci.getIndependenceTest()The independence test.FciMax.getIndependenceTest()The independence test.GFci.getIndependenceTest()The independence test.GraspFci.getIndependenceTest()The independence test.IFas.getIndependenceTest()Kpc.getIndependenceTest()Pc.getIndependenceTest()PcAll.getIndependenceTest()Pcd.getIndependenceTest()PcLocal.getIndependenceTest()PcMax.getIndependenceTest()PcStable.getIndependenceTest()PcStableMax.getIndependenceTest()Rfci.getIndependenceTest()The independence test.SampleVcpc.getIndependenceTest()SampleVcpcFast.getIndependenceTest()SepsetsConservative.getIndependenceTest()SpFci.getIndependenceTest()The independence test.SvarFci.getIndependenceTest()The independence test.SvarGfci.getIndependenceTest()The independence test.TimeSeriesLagSearch.getIndependenceTest()Vcpc.getIndependenceTest()VcpcAlt.getIndependenceTest()VcpcFast.getIndependenceTest()BfciFoo.getTest()The independence test.BfciTr.getTest()The independence test.Cefs.getTest()PcMb.getTest()TeyssierScorer.getTestObject()default IndependenceTestIndependenceTest.indTestSubset(List<Node> vars) IndTestChiSquare.indTestSubset(List<Node> nodes) Creates a new IndTestChiSquare for a subset of the nodes.IndTestCodec.indTestSubset(List<Node> vars) Creates a new independence test instance for a subset of the variables.IndTestConditionalCorrelation.indTestSubset(List<Node> vars) Creates a new IndTestCramerT instance for a subset of the variables.IndTestConditionalCorrelationLingam.indTestSubset(List<Node> vars) Creates a new IndTestCramerT instance for a subset of the variables.IndTestConditionalGaussianLRT.indTestSubset(List<Node> vars) IndTestCramerT.indTestSubset(List<Node> vars) Creates a new IndTestCramerT instance for a subset of the variables.IndTestDegenerateGaussianLRT.indTestSubset(List<Node> vars) IndTestDSep.indTestSubset(List<Node> vars) Required by IndependenceTest.IndTestFisherZ.indTestSubset(List<Node> vars) Creates a new independence test instance for a subset of the variables.IndTestFisherZConcatenateResiduals.indTestSubset(List<Node> vars) IndTestFisherZFisherPValue.indTestSubset(List<Node> vars) IndTestFisherZGeneralizedInverse.indTestSubset(List<Node> vars) Creates a new IndTestCramerT instance for a subset of the variables.IndTestFisherZPercentIndependent.indTestSubset(List<Node> vars) IndTestFisherZRecursive.indTestSubset(List<Node> vars) Creates a new independence test instance for a subset of the variables.IndTestGSquare.indTestSubset(List<Node> vars) Creates a new IndTestGSquare for a subset of the variables.IndTestHsic.indTestSubset(List<Node> vars) Creates a new IndTestHsic instance for a subset of the variables.IndTestIndependenceFacts.indTestSubset(List<Node> vars) IndTestMixedMultipleTTest.indTestSubset(List<Node> vars) IndTestMNLRLRT.indTestSubset(List<Node> vars) IndTestMulti.indTestSubset(List<Node> vars) IndTestMultinomialLogisticRegression.indTestSubset(List<Node> vars) IndTestMVPLRT.indTestSubset(List<Node> vars) IndTestPositiveCorr.indTestSubset(List<Node> vars) Creates a new independence test instance for a subset of the variables.IndTestProbabilistic.indTestSubset(List<Node> vars) IndTestRegression.indTestSubset(List<Node> vars) Creates a new IndTestCramerT instance for a subset of the variables.IndTestSepset.indTestSubset(List<Node> vars) Required by IndependenceTest.IndTestTrekSep.indTestSubset(List<Node> vars) Creates a new independence test instance for a subset of the variables.Kci.indTestSubset(List<Node> vars) Returns an Independence test for a subset of the variables.ProbabilisticMAPIndependence.indTestSubset(List<Node> vars) Methods in edu.cmu.tetrad.search with parameters of type IndependenceTestModifier and TypeMethodDescriptionstatic booleanSearchGraphUtils.existsLocalSepsetWithout(Node x, Node y, Node z, IndependenceTest test, Graph graph, int depth) MbUtils.generateMbDags(Graph mbCPDAG, boolean orientBidirectedEdges, IndependenceTest test, int depth, Node target) Generates the list of MB DAGs consistent with the MB CPDAG returned by the previous search.SearchGraphUtils.getCpcTripleType(Node x, Node y, Node z, IndependenceTest test, int depth, Graph graph) Vcpc.getPopulationTripleType(Node x, Node y, Node z, IndependenceTest test, int depth, Graph graph, boolean verbose) VcpcFast.getPopulationTripleType(Node x, Node y, Node z, IndependenceTest test, int depth, Graph graph, boolean verbose) Cstar.getRecords(DataSet dataSet, List<Node> possibleCauses, List<Node> possibleEffects, IndependenceTest test) Returns records for a set of variables with expected number of false positives bounded by q.Cstar.getRecords(DataSet dataSet, List<Node> possibleCauses, List<Node> possibleEffects, IndependenceTest test, String path) Returns records for a set of variables with expected number of false positives bounded by q.PossibleDsepFci.getSepset(IndependenceTest test, Node node1, Node node2) SepsetsConservative.getSepsetsLists(Node x, Node y, Node z, IndependenceTest test, int depth, boolean verbose) static booleanSearchGraphUtils.meekR1Locally(Graph graph, Knowledge knowledge, IndependenceTest test, int depth) Orient away from collider.static voidSearchGraphUtils.orientUsingMeekRulesLocally(Knowledge knowledge, Graph graph, IndependenceTest test, int depth) Orients using Meek rules, double checking noncolliders locally.static voidSearchGraphUtils.pcdOrientC(IndependenceTest test, Knowledge knowledge, Graph graph) Performs step C of the algorithm, as indicated on page xxx of CPS, with the modification that X--W--Y is oriented as X-->W<--Y if W is *determined by* the sepset of (X, Y), rather than W just being *in* the sepset of (X, Y).voidBFci.setIndependenceTest(IndependenceTest independenceTest) voidGFci.setIndependenceTest(IndependenceTest independenceTest) voidGraspFci.setIndependenceTest(IndependenceTest independenceTest) voidSpFci.setIndependenceTest(IndependenceTest independenceTest) voidSvarGfci.setIndependenceTest(IndependenceTest independenceTest) voidBfciFoo.setTest(IndependenceTest test) voidBfciTr.setTest(IndependenceTest test) Method parameters in edu.cmu.tetrad.search with type arguments of type IndependenceTestModifier and TypeMethodDescriptionstatic booleanResolveSepsets.isIndependentPooled(ResolveSepsets.Method method, List<IndependenceTest> independenceTests, Node x, Node y, List<Node> condSet) Tests for independence using one of the pooled methodsstatic booleanResolveSepsets.isIndependentPooledAverage(List<IndependenceTest> independenceTests, Node x, Node y, List<Node> condSet) Checks independence from pooled samples by taking the average p valuestatic booleanResolveSepsets.isIndependentPooledAverageTest(List<IndependenceTest> independenceTests, Node x, Node y, List<Node> condSet) Checks independence from pooled samples by taking the average test statistic CURRENTLY ONLY WORKS FOR CHISQUARE TESTstatic booleanResolveSepsets.isIndependentPooledFisher(List<IndependenceTest> independenceTests, Node x, Node y, List<Node> condSet) Checks independence from pooled samples using Fisher's method.static booleanResolveSepsets.isIndependentPooledFisher2(List<IndependenceTest> independenceTests, Node x, Node y, List<Node> condSet) Eliminates from considerations independence tests that cannot be evaluated (due to missing variables mainly).static booleanResolveSepsets.isIndependentPooledMudholkerGeorge(List<IndependenceTest> independenceTests, Node x, Node y, List<Node> condSet) Checks independence from pooled samples using Mudholker and George's methodstatic booleanResolveSepsets.isIndependentPooledMudholkerGeorge2(List<IndependenceTest> independenceTests, Node x, Node y, List<Node> condSet) The same as isIndepenentPooledMudholkerGeoerge, except that only available independence tests are used.static booleanResolveSepsets.isIndependentPooledRandom(List<IndependenceTest> independenceTests, Node x, Node y, List<Node> condSet) Checks independence from pooled samples by randomly selecting a p valuestatic booleanResolveSepsets.isIndependentPooledStouffer(List<IndependenceTest> independenceTests, Node x, Node y, List<Node> condSet) Checks independence from pooled samples using Stouffer et al.'s methodstatic booleanResolveSepsets.isIndependentPooledTippett(List<IndependenceTest> independenceTests, Node x, Node y, List<Node> condSet) Checks independence from pooled samples using Tippett's methodstatic booleanResolveSepsets.isIndependentPooledWilkinson(List<IndependenceTest> independenceTests, Node x, Node y, List<Node> condSet, int r) Checks independence from pooled samples using Wilkinson's methodstatic booleanResolveSepsets.isIndependentPooledWorsleyFriston(List<IndependenceTest> independenceTests, Node x, Node y, List<Node> condSet) Checks independence from pooled samples using Worsley and Friston's methodConstructors in edu.cmu.tetrad.search with parameters of type IndependenceTestModifierConstructorDescriptionBFci(IndependenceTest test, Score score) BfciFoo(IndependenceTest test, Score score) BfciTr(IndependenceTest test, Score score) BossOrig(@NotNull IndependenceTest test, Score score) Ccd(IndependenceTest test) CcdMax(IndependenceTest test) Cefs(IndependenceTest test, int depth) Constructs a new search.Cfci(IndependenceTest independenceTest) Constructs a new FCI search for the given independence test and background knowledge.Cpc(IndependenceTest independenceTest) Constructs a CPC algorithm that uses the given independence test as oracle.CpcOrienter(IndependenceTest independenceTest, Knowledge knowledge) CpcStable(IndependenceTest independenceTest) Constructs a CPC algorithm that uses the given independence test as oracle.Fas(IndependenceTest test) Constructs a new FastAdjacencySearch.Deprecated.Constructs a new FastAdjacencySearch.FasDci(Graph graph, IndependenceTest independenceTest) Constructs a new FastAdjacencySearch for DCI.FasDci(Graph graph, IndependenceTest independenceTest, ResolveSepsets.Method method, List<Set<Node>> marginalVars, List<IndependenceTest> independenceTests, SepsetMapDci knownIndependencies, SepsetMapDci knownAssociations) Constructs a new FastAdjacencySearch for DCI with independence test pooling to resolve inconsistencies.FasDeterministic(Graph graph, IndependenceTest test) Constructs a new FastAdjacencySearch.FasFdr(IndependenceTest test, int numIndependenceTests, int numDependenceJudgement) Constructs a new FastAdjacencySearch.Fask(DataSet dataSet, Score score, IndependenceTest test) FasStableConcurrentFdr(Graph externalGraph, IndependenceTest test) Constructs a new FastAdjacencySearch.Constructs a new FastAdjacencySearch.Fasts(Graph graph, IndependenceTest test) Constructs a new FastAdjacencySearch.Fasts(IndependenceTest test) Fci(IndependenceTest independenceTest) Constructs a new FCI search for the given independence test and background knowledge.Fci(IndependenceTest independenceTest, List<Node> searchVars) Constructs a new FCI search for the given independence test and background knowledge and a list of variables to search over.FciMax(IndependenceTest independenceTest) Constructs a new FCI search for the given independence test and background knowledge.FciMax(IndependenceTest independenceTest, List<Node> searchVars) Constructs a new FCI search for the given independence test and background knowledge and a list of variables to search over.GFci(IndependenceTest test, Score score) Grasp(@NotNull IndependenceTest test) Grasp(@NotNull IndependenceTest test, Score score) GraspFci(IndependenceTest test, Score score) GraspTol(@NotNull IndependenceTest test) GraspTol(@NotNull IndependenceTest test, Score score) GrowShrink(IndependenceTest test) Constructs a new search.OtherPermAlgs(@NotNull IndependenceTest test) OtherPermAlgs(@NotNull IndependenceTest test, Score score) Pc(IndependenceTest independenceTest) Constructs a new PC search using the given independence test as oracle.PcAll(IndependenceTest independenceTest) Constructs a CPC algorithm that uses the given independence test as oracle.Pcd(IndependenceTest independenceTest) Constructs a new PC search using the given independence test as oracle.PcLocal(IndependenceTest independenceTest) Constructs a PC Local search with the given independence oracle.PcLocal(IndependenceTest independenceTest, Graph graph) PcMax(IndependenceTest independenceTest) Constructs a new PC search using the given independence test as oracle.PcMb(IndependenceTest test, int depth) Constructs a new search.PcStable(IndependenceTest independenceTest) Constructs a new PC search using the given independence test as oracle.PcStableMax(IndependenceTest independenceTest) Constructs a new PC search using the given independence test as oracle.PossibleDsepFci(Graph graph, IndependenceTest test) Creates a new SepSet and assumes that none of the variables have yet been checked.Rfci(IndependenceTest independenceTest) Constructs a new FCI search for the given independence test and background knowledge.Rfci(IndependenceTest independenceTest, List<Node> searchVars) Constructs a new FCI search for the given independence test and background knowledge and a list of variables to search over.SampleVcpc(IndependenceTest independenceTest) Constructs a CPC algorithm that uses the given independence test as oracle.SampleVcpcFast(IndependenceTest independenceTest) Constructs a CPC algorithm that uses the given independence test as oracle.Constructs the score using a covariance matrix.SepsetsConservative(Graph graph, IndependenceTest independenceTest, SepsetMap extraSepsets, int depth) SepsetsGreedy(Graph graph, IndependenceTest independenceTest, SepsetMap extraSepsets, int depth) SepsetsGreedy2(Graph graph, IndependenceTest independenceTest, TeyssierScorer scorer, SepsetMap extraSepsets, int depth) SepsetsPossibleDsep(Graph graph, IndependenceTest test, Knowledge knowledge, int depth, int maxPathLength) SepsetsSet(SepsetMap sepsets, IndependenceTest test) SpFci(IndependenceTest test, Score score) SvarFci(IndependenceTest independenceTest) Constructs a new FCI search for the given independence test and background knowledge.SvarFciOrient(SepsetProducer sepsets, IndependenceTest independenceTest) Constructs a new FCI search for the given independence test and background knowledge.SvarGfci(IndependenceTest test, Score score) Constructs a new GFCI search for the given independence test and background knowledge.TeyssierScorer(IndependenceTest test, Score score) TimeSeriesLagSearch(IndependenceTest independenceTest) Constructs a CPC algorithm that uses the given independence test as oracle.Vcfas(IndependenceTest test) Vcpc(IndependenceTest independenceTest) Constructs a CPC algorithm that uses the given independence test as oracle.VcpcAlt(IndependenceTest independenceTest) Constructs a CPC algorithm that uses the given independence test as oracle.VcpcFast(IndependenceTest independenceTest) Constructs a CPC algorithm that uses the given independence test as oracle.Constructor parameters in edu.cmu.tetrad.search with type arguments of type IndependenceTestModifierConstructorDescriptionDci(List<IndependenceTest> tests) Dci(List<IndependenceTest> tests, ResolveSepsets.Method method) IndTestMulti(List<IndependenceTest> independenceTests, ResolveSepsets.Method method) -
Uses of IndependenceTest in edu.cmu.tetrad.search.mb
Methods in edu.cmu.tetrad.search.mb that return IndependenceTestConstructors in edu.cmu.tetrad.search.mb with parameters of type IndependenceTestModifierConstructorDescriptionIamb(IndependenceTest test) Constructs a new search.IambnPc(IndependenceTest test) Constructs a new search.InterIamb(IndependenceTest test) Constructs a new search.Mmhc(IndependenceTest test, DataSet dataSet) Mmmb(IndependenceTest test, int depth, boolean symmetric) Constructs. -
Uses of IndependenceTest in edu.pitt.csb.mgm
Classes in edu.pitt.csb.mgm that implement IndependenceTestModifier and TypeClassDescriptionclassPerforms a test of conditional independence X _||_ Y | Z1...Zn where all searchVariables are either continuous or discrete.Methods in edu.pitt.csb.mgm that return IndependenceTestModifier and TypeMethodDescriptionstatic IndependenceTestMixedUtils.IndTestFromString(String name, DataSet data, double alpha) Returns independence tests by name located in edu.cmu.tetrad.search and edu.pitt.csb.mgm also supports shorthand for LRT ("lrt) and t-tests ("tlin" for prefer linear (fastest) or "tlog" for prefer logistic)IndTestMultinomialLogisticRegressionWald.indTestSubset(List<Node> vars)