Learn R Programming

cna (version 0.1-3)

cna: Coincidence Analysis (CNA)

Description

cna performs a Coincidence Analysis (CNA). See Baumgartner (2009a, 2009b) for a detailed desription and discussion of the methodology.

Usage

cna(x, ordering = NULL, strict = FALSE, con = 1, cov = 1, 
    maxstep = 5, suff.only = TRUE)

## S3 method for class 'cna': print(x, what = "mac", digits = 3, nsolutions = 5, row.names = FALSE, ...)

Arguments

x
A truth table or data frame. If not already a truth table truthTab is initially applied to x.
ordering
ordering defines a causal ordering of the factors in x as a list of character vectors containing the factor names. For example, ordering = list(c("A", "B"), "C") postulates that A and B are
strict
Logial. If TRUE factors on the same level of the causal ordering are potential causes of each other.
con
Minimum consistency of a sufficient condition.
cov
Minimum coverage of a necessary condition.
maxstep
Maximum number of steps in the algorithm for finding atomic solution formulas. See details below.
suff.only
Logical. If TRUE the function only finds minimally neccessary conditions and does not search for atomic and complex solution formulas.
what
A character string specifying what to print: If what contains a t, the truth table is printed, if it contains an m, the msc are printed, if it contains an a
digits
Number of digits to print in consistencies and coverages.
nsolutions
Maximum number of conditions to print. Applies sepeartely to minimally sufficient conditions, atomic solution formulas (both for each outcome seperately) and complex solution formulas.
row.names, ...
Are passed to print.data.frame.

Value

  • cna returns an object of class cna, a list containing the relevant results of the analysis.

Details

Separately for each potential outcome factor, cna first finds all minimally necessary conditions (msc) according to con, and then searches for disjunctions of these msc that are minimally necessary according to cov, the atomic solution formulas (asf). The search for atomic solution formulas is effected as follows: In a first step, the msc themselves are considered, in a second step disjunctions of two msc, then of three, etc. The argument maxstep defines the number of such steps to be carried out, i.e. disjunctions of up to maxstep msc are examined as potential asf.

References

See the references listed in cna-package.

See Also

A general overview of the facilities in the cna package is given in cna-package.