Efficient selection of undirected graphical models for high-dimensional datasets


[Up] [Top]

Documentation for package ‘gRapHD’ version 0.2.2

Help Pages

gRapHD-package The gRapHD package
adjMat Adjacency matrix
calcStat Pairwise weights
ccoeff Clustering coefficient
chStat Internal use
CI.test Test of conditional independence
convData Converts dataset
Degree Degree
DFS Depth-first search
dsCont Test dataset
dsDiscr Test dataset
dsMixed Test dataset
findEd Finds add-eligible edges
fit Log-likelihood, AIC, BIC
gRapHD The gRapHD package
gRapHD-class Class "gRapHD"
gRapHD.graphNEL Class "gRapHD"
graphNEL.gRapHD Class "gRapHD"
initialize.gRapHD Class "gRapHD"
jTree Junction tree
matrix.gRapHD Class "gRapHD"
MCS Maximum cardinality search
minForest Minimum forest
modelDim Model's dimension
modelFormula Model's formula
neighbourhood Neighbourhood of a vertex
neighbours Finds all direct neighbours
perfSets Finds a perfect sequence
plot.gRapHD Plots a gRapHD object
print.gRapHD Class "gRapHD"
randTree Random tree
rowProds Row products
shortPath Shortest path
show.gRapHD Class "gRapHD"
sortMat Sort matrix
stepw Stepwise forward selection
SubGraph Generates a subgraph
summary.gRapHD Class "gRapHD"