Uses of Class
edu.cmu.tetrad.graph.IndependenceFact
Packages that use IndependenceFact
Package
Description
This package contains classes for causal graph search algorithms.
This package contains classes for testing causal graph search algorithms.
This package contains utility classes for causal graph search algorithms.
A package for algorithms that are not ready for prime time.
-
Uses of IndependenceFact in edu.cmu.tetrad.data
Methods in edu.cmu.tetrad.data that return types with arguments of type IndependenceFactMethods in edu.cmu.tetrad.data with parameters of type IndependenceFactModifier and TypeMethodDescriptionvoidIndependenceFacts.add(IndependenceFact fact) add.voidIndependenceFacts.remove(IndependenceFact fact) remove. -
Uses of IndependenceFact in edu.cmu.tetrad.graph
Classes in edu.cmu.tetrad.graph that implement interfaces with type arguments of type IndependenceFactModifier and TypeClassDescriptionfinal classStores a triple (x, y, z) of nodes.Methods in edu.cmu.tetrad.graph that return IndependenceFactModifier and TypeMethodDescriptionstatic IndependenceFactIndependenceFact.serializableInstance()Generates a simple exemplar of this class to test serialization.Methods in edu.cmu.tetrad.graph with parameters of type IndependenceFact -
Uses of IndependenceFact in edu.cmu.tetrad.search
Methods in edu.cmu.tetrad.search that return types with arguments of type IndependenceFactModifier and TypeMethodDescriptionMarkovCheck.checkIndependenceForTargetNode(Node x) Retrieves the list of local independence facts for a given node.static Set<IndependenceFact> MarkovCheck.computeAllImpliedFacts(Graph g, ConditioningSetType setType) Computes all implied independence facts for the given graph based on the specified conditioning set type.static Map<String, List<IndependenceFact>> MarkovCheck.computeImpliedFactsByVertex(Graph graph, ConditioningSetType setType) Computes the implied independence facts for EVERY vertex ofgraphat once, keyed by vertex name.static List<IndependenceFact> MarkovCheck.computeImpliedFactsForVertex(Graph graph, Node x, ConditioningSetType conditioningSetType) Computes the implied independence facts for a given vertex within the specified graph based on the provided conditioning set type.static List<IndependenceFact> MarkovCheck.computeImpliedFactsForVertex(Graph graph, Node x, ConditioningSetType conditioningSetType, Graph preparedMag) Variant ofMarkovCheck.computeImpliedFactsForVertex(Graph, Node, ConditioningSetType)accepting a MAG prepared once per graph byMarkovCheck.prepareMagForVertexFacts(Graph, ConditioningSetType).static List<IndependenceFact> MarkovCheck.factsForUniformZ(Graph g, Node x, Set<Node> z) Generates a list of independence facts for a given node with respect to a given graph and a conditioning set.MarkovCheck.AllSubsetsIndependenceFacts.getMconn()Returns the set of m-connection facts.static Set<IndependenceFact> Computes the complete OLMP model for the given ADMG.static Set<IndependenceFact> Computes the ordered local Markov property for a maximal ancestral graph (MAG).static Set<IndependenceFact> Computes the pairwise Markov property for the given ADMG.static Set<IndependenceFact> OrderedLocalMarkovProperty.getModelForNode(Graph admg, Node x) Returns the subset of OLMP independence facts that havexas one endpoint (i.e., facts of the form x ⊥ y | Z or y ⊥ x | Z), normalised so that x is always the left-hand (getX()) node.static Set<IndependenceFact> OrderedLocalMarkovPropertySinkElimination.getModelForNode(Graph mag, Node x) Returns the subset of ordered-local-Markov independence facts whose "sink" is the given nodex.static Set<IndependenceFact> PairwiseMarkovProperty.getModelForNode(Graph admg, Node x) Returns the subset of pairwise independence facts that involve nodex(as either the left or right endpoint), normalised so thatxis always the left-hand (getX()) node.MarkovCheck.AllSubsetsIndependenceFacts.getMsep()Returns the set of m-separation facts.Methods in edu.cmu.tetrad.search with parameters of type IndependenceFactModifier and TypeMethodDescriptionstatic StringVertexRepairSearch.factKey(IndependenceFact f) Builds a canonical fact-key for deduplication.Method parameters in edu.cmu.tetrad.search with type arguments of type IndependenceFactModifier and TypeMethodDescriptionWildBootstrapMarkovCheck.checkFacts(List<IndependenceFact> facts) Run the joint wild-bootstrap check against an explicit list of independence facts.MarkovCheck.getLocalPValues(IndependenceTest independenceTest, List<IndependenceFact> facts) Calculates the local p-values for a given independence test and a list of independence facts.MarkovCheck.getLocalPValues(IndependenceTest independenceTest, List<IndependenceFact> facts, Double shuffleThreshold) Get Local P values with shuffle threshold provided.Constructor parameters in edu.cmu.tetrad.search with type arguments of type IndependenceFactModifierConstructorDescriptionAllSubsetsIndependenceFacts(Set<IndependenceFact> msep, Set<IndependenceFact> mconn) Constructor. -
Uses of IndependenceFact in edu.cmu.tetrad.search.harness
Methods in edu.cmu.tetrad.search.harness that return types with arguments of type IndependenceFactModifier and TypeMethodDescriptionstatic Set<IndependenceFact> GraphoidClosureHarness.computeClosure(Set<IndependenceFact> facts, List<Node> variables, GraphoidClosureHarness.ClosureType closure) Computes the closure of a set ofIndependenceFacts under the given graphoid assumption type, using the variables in the provided list as the full variable universe.Method parameters in edu.cmu.tetrad.search.harness with type arguments of type IndependenceFactModifier and TypeMethodDescriptionstatic Set<IndependenceFact> GraphoidClosureHarness.computeClosure(Set<IndependenceFact> facts, List<Node> variables, GraphoidClosureHarness.ClosureType closure) Computes the closure of a set ofIndependenceFacts under the given graphoid assumption type, using the variables in the provided list as the full variable universe. -
Uses of IndependenceFact in edu.cmu.tetrad.search.is
Methods in edu.cmu.tetrad.search.is that return types with arguments of type IndependenceFact -
Uses of IndependenceFact in edu.cmu.tetrad.search.test
Methods in edu.cmu.tetrad.search.test that return IndependenceFactModifier and TypeMethodDescriptionIndependenceResult.getFact()Returns the independence fact being stored.Methods in edu.cmu.tetrad.search.test that return types with arguments of type IndependenceFactModifier and TypeMethodDescriptionIndTestProbabilistic.getH()Returns a map from independence facts to their posterior probabilities of independence.CachedIndependenceQueries.ImpliedFactProvider.impliedFactsForVertex(Node vertex) Retrieves the list of impliedIndependenceFactobjects for the given vertex.Methods in edu.cmu.tetrad.search.test with parameters of type IndependenceFactModifier and TypeMethodDescriptionstatic IndependenceResultDiscreteIndependenceUtils.conditionalChiSquare(DataSet dataSet, List<Node> variables, List<Integer> rows, Node x, Node y, List<Node> z, IndependenceFact fact, double alpha) Conditional chi-square test for X _||_ Y | Z, stratifying on Z value tuples.CachedIndependenceQueries.eval(IndependenceFact fact) Evaluates the independence fact using a cached or computed result.booleanCachedIndependenceQueries.isIndependent(IndependenceFact fact) Determines whether the given IndependenceFact represents an independent state.doubleCachedIndependenceQueries.pValue(IndependenceFact fact) Computes the p-value associated with a given independence fact by evaluating its statistical significance.Method parameters in edu.cmu.tetrad.search.test with type arguments of type IndependenceFactModifier and TypeMethodDescriptionCachedIndependenceQueries.evalAll(Collection<IndependenceFact> facts, CachedIndependenceQueries.Dedup dedup) Evaluates a collection of independence facts and returns a list of evaluation results.CachedIndependenceQueries.pValuesForFacts(Collection<IndependenceFact> facts, CachedIndependenceQueries.Dedup dedup) Computes the p-values for a collection of independence facts after evaluating them.Constructors in edu.cmu.tetrad.search.test with parameters of type IndependenceFactModifierConstructorDescriptionIndependenceResult(IndependenceFact fact, boolean indep, double pValue, double score) Constructor.IndependenceResult(IndependenceFact fact, boolean indep, double pValue, double score, boolean isValid) Constructor. -
Uses of IndependenceFact in edu.cmu.tetrad.search.utils
Methods in edu.cmu.tetrad.search.utils with parameters of type IndependenceFactModifier and TypeMethodDescriptionstatic intPerFactEss.effectiveSampleSize(DataSet data, int[] blockIds, IndependenceFact fact) Computes the per-fact effective sample size for X _||_ Y | Z under the given block structure. -
Uses of IndependenceFact in edu.cmu.tetrad.search.work_in_progress
Methods in edu.cmu.tetrad.search.work_in_progress that return types with arguments of type IndependenceFact