Man pages for MalteLond/rfcd
Random Forest Change Point Detection

binary_segmentationbinary_segmentation
ChainNetworkChainNetwork
compare_change_pointsRand type performance indices
create_modelCreate GGM with changepoints
delete_valuesDelete values from a design matrix
DiagMatrixDiagMatrix
draw_segmentsDraw Random segments
find_best_split_rankfind_best_split_rank
find_best_split_shift_in_meanfind_best_split_shift_in_mean
find_best_split_shift_in_mean_and_variancefind best split shift in mean and variance
get_best_split_function_from_gain_functionget_best_split_function_from_gain_function
get_change_points_from_treeGet Change Points from a binary_segmentation_tree
get_cov_matCalculate a covariance matrix
get_gain_function_from_loss_functionget_gain_function_from_loss_function
get_glasso_fitGet a glasso fit
get_glasso_gain_functionClosure generating function to calculate gains when splitting...
get_rf_gain_functionClosure generating function to calculate gains for splits...
get_u_statistic_model_selection_functionu_statistic_model_selection_funciton
hdcdChange Point Detection Algorithm
hdcd_controlCreate an object of class hdcd_control to supply parameters...
line_searchLine search optimisation algorithm
loglikelihoodNegative loglikelihood of a multivariate normal
log_spaceLogarithmically Scaled Sequence Generation
MoveEdgesMoveEdges
plot_missingness_structurePlot the missingness structure of a design matrix
print.binary_segmentation_treeprint.binary_segmentation_tree
RandomNetworkRandomNetwork
RegrowNetworkRegrowNetwork
sample_foldsSample Folds
ScaleNetworkScaleNetwork
section_searchSection search optimisation algorithm
simulate_from_modelSimulate Observations from a model created by create_model
two_step_searchTwo step search optimisation algorithm
wild_binary_segmentationwild_binary_segmentation
MalteLond/rfcd documentation built on June 19, 2019, 2:52 p.m.