Inference of Pair-Copula Bayesian Networks


[Up] [Top]

Documentation for package ‘PCBN’ version 0.1.1

Help Pages

active_cycles Checks if a graph contains active cycles
BiCopCondFit Fits the copula joining w and v given cond_set abiding by the conditional independencies of the graph
B_sets_are_increasing Checks if the B-sets for a particular node form an increasing sequence.
B_sets_cut_increments Find the decomposition of B-sets
B_sets_make_unique Compress a given collection of B-sets
complete_and_check_orders Complete an order and check whether these are valid orders on parents sets
ComputeCondMargin Fits the copula joining w and v given cond_set abiding by the conditional independencies of the graph
compute_sample_margin Computes a conditional margin during sampling
create_empty_DAG Create empty DAG
DAG_to_restrictedDAG Turns a general graph into a restricted graph.
default_envir Fits the copula joining w and v given cond_set abiding by the conditional independencies of the graph
dsep_set D-separation of two nodes given a set in a DAG
extend_orders Fills in all possible orders for the next node for each possible order
find_all_orders Finds all possible copula assignments given a DAG
find_all_orders_v Finds all possible orders of node v given previous copula assignments
find_B_sets Find all the B-sets of a given DAG
find_B_sets_v Find all the B-sets of a given DAG
find_cond_copula_specified Find among parents of a node, the one that has a conditional copula specified
find_interfering_v_from_B_sets Find all interfering v-structures for a given collection of B-sets
fit_all_orders Fit the copulas of a PCBN given data
fit_copulas Fit the copulas of a PCBN given data
fix_active_cycles Turns a general graph into a restricted graph.
fix_interfering_vstructs Turns a general graph into a restricted graph.
has_active_cycles Checks if a graph contains active cycles
has_interfering_vstrucs Checks if graph has interfering v-structures
is_cond_copula_specified Checks if a given (conditional) copula has already been specified
is_order_abiding_Bsets Check whether a certain order abides by the B-sets
is_order_abiding_Bsets_v Check whether a certain order abides by the B-sets
is_restrictedDAG Does a DAG satisfy the restrictions of no active cycle and no interfering v-structures
logLik.PCBN Log-likelihood of a PCBN object
new_PCBN Initializes PCBN class
path_hasChords Checks a path for converging connections and chords.
path_hasConvergingConnections Checks a path for converging connections and chords.
PCBN_PDF PDF of a PCBN model
PCBN_sim Simulate data from a specified PCBN
plot.PCBN Print and plot PCBN objects
plot_active_cycles Checks if a graph contains active cycles
possible_candidates Possible candidates to be added to a partial order
possible_candidate_incoming_arc Possible candidates to be added to a partial order
possible_candidate_outgoing_arc Possible candidates to be added to a partial order
print.PCBN Print and plot PCBN objects
remove_CondInd Remove elements from a conditioning set by using conditional independence