pcalg News

CHANGES IN VERSION 2.7-8 (2022-12-17, svn r528)

• Fix idaFast() regression tests, using all.equal() instead of round(*) == round(*), notably for ATLAS-using BLAS/Lapack.

CHANGES IN VERSION 2.7-7 (2022-10-04, svn r526)

• Tiny bug fix for fci.

CHANGES IN VERSION 2.7-6 (2022-04-04, svn r525)

• ‘Proper’ registration of .Call()ed C routines.

• Not using if(class(.) = "...")

• Adapt to upcoming deprecation of C++ str::binary_function()

• dagitty masking randomDAG().

CHANGES IN VERSION 2.7-5 (2022-02-21, svn r518)

• fixing bug.

CHANGES IN VERSION 2.7-4 (2021-11-24, svn r517)

• updated links, removed old vignette.

CHANGES IN VERSION 2.7-3 (2021-05-20, svn r516)

• adapt to R-devel's new/changed warning of matrix(<non-matching-length>, n,m).

CHANGES IN VERSION 2.4-2 (2016-09-22, svn r403)

• print() and summary() methods for pc(), fci(), etc.

• new as(*, "amat") methods to get the adjacency matrix of a model, including a print() method for "amat"s.

  ?amatType documents the different kinds of adjacency matrices in pcalg.

• New functions ......

• Deprecated LINGAM() in favor of new lingam().

• Deprecated allDags() in favor of pdag2allDags().

CHANGES IN VERSION 2.2-4 (2015-07-22, svn r344)

• Bug fix in simulate(<gies>).

• Bug fix in LINGAM(., verbose=FALSE) (the default, now tested).

• Fix plot(pc(..), zvalue.lwd=TRUE), and better document that plot method.

• Much faster gSquareDis() and gSquareBin() for |S| in 1:4 or so.

• More test coverage, notably for pcSelect() and mcor().

• r.gauss.pardag() gets an optional argument labels.

CHANGES IN VERSION 2.2-3 (2015-07-12, svn r322)

• Adapt to API change in igraph package.

• More test coverage and first speed tweaks.

CHANGES IN VERSION 2.2-2 (2015-06-24, svn r304)

• Function gac for testing if a set of nodes satisfies the Generalized Adjustment Criterion (GAC). GAC is a sufficient and necessary criterion for estimating causal effects via covariate adjustment in DAGs, CPDAGs, MAGs and PAGs.

CHANGES IN VERSION 2.2-0

• Function randDAG for generating random directed acyclic graphs (DAGs) with fixed expected number of neighbours. Several different methods are provided, each intentionally biased towards certain properties. The methods are based on the analogue functions in the igraph package.

• Function unifDAG and unifDAG.approx for uniform sampling of a labelled directed acyclic graph (DAG) with combinatorial enumeration.

CHANGES IN VERSION 2.1-0

• Function LINGAM for estimating the structure of Linear non-Gaussian Additive Models

CHANGES IN VERSION 2.0-4

• Function fciPlus for a fast (but accurate) version of fci (note that the already existing function rfci is a fast approximation of fci)

CHANGES IN VERSION 2.0-1

• Functions gds, gies, ges for score based learning

• Function backdoor for generalized backdoor criterion

• Bugfix in function wgtMatrix; this affects functions trueCov and rmvDAG; to reproduce old version, use option 'back.compatible = TRUE'

• skeleton, pc, fci and rfci now have 'alpha' as third argument, then 'labels, p' where 'p' is optional; namely, derived from 'labels' when these are specified.

• The default for extending the skeleton to a CPDAG is now udag2pdagRelaxed, which is completely deterministic (was udag2pdag before, which can use random orientations if sampling errors occur).