Package: KPC
Type: Package
Title: Kernel Partial Correlation Coefficient
Version: 0.1.2
Authors@R: c(person("Zhen", "Huang", email = "zh2395@columbia.edu",
    role = c("aut", "cre")),
    person("Nabarun", "Deb", email = "nd2560@columbia.edu",
    role = "ctb"),
    person("Bodhisattva", "Sen", email = "bodhi@stat.columbia.edu",
    role = "ctb"))
Maintainer: Zhen Huang <zh2395@columbia.edu>
Description: Implementations of two empirical versions the kernel partial correlation (KPC) coefficient
    and the associated variable selection algorithms. KPC is a measure of the strength of conditional
    association between Y and Z given X, with X, Y, Z being random variables taking values in
    general topological spaces. As the name suggests, KPC is defined in terms of kernels on
    reproducing kernel Hilbert spaces (RKHSs). The population KPC is a deterministic number
    between 0 and 1; it is 0 if and only if Y is conditionally independent of Z given X, and it is 1 if
    and only if Y is a measurable function of Z and X. One empirical KPC estimator is based on
    geometric graphs, such as K-nearest neighbor graphs and minimum spanning trees, and is
    consistent under very weak conditions. The other empirical estimator, defined using conditional
    mean embeddings (CMEs) as used in the RKHS literature, is also consistent under suitable
    conditions. Using KPC, a stepwise forward variable selection algorithm KFOCI (using the graph
    based estimator of KPC) is provided, as well as a similar stepwise forward selection algorithm
    based on the RKHS based estimator. For more details on KPC, its empirical estimators and its
    application on variable selection, see Huang, Z., N. Deb, and B. Sen (2022). “Kernel partial
    correlation coefficient – a measure of conditional dependence” (URL listed below). When X is
    empty, KPC measures the unconditional dependence between Y and Z, which has been described
    in Deb, N., P. Ghosal, and B. Sen (2020), “Measuring association on topological spaces using
    kernels and geometric graphs” <arXiv:2010.01768>, and it is implemented in the functions
    KMAc() and Klin() in this package. The latter can be computed in near linear time.
License: GPL-3
Encoding: UTF-8
URL: https://www.jmlr.org/papers/v23/21-493.html,
        https://arxiv.org/abs/2012.14804
LazyData: true
RoxygenNote: 7.1.2
Depends: R (>= 4.0.0), data.table, kernlab
Imports: RANN, proxy, parallel, mlpack
NeedsCompilation: no
Packaged: 2022-10-05 19:55:05 UTC; huangzhen
Author: Zhen Huang [aut, cre],
  Nabarun Deb [ctb],
  Bodhisattva Sen [ctb]
Repository: CRAN
Date/Publication: 2022-10-05 20:20:03 UTC
Built: R 4.6.0; ; 2026-04-26 01:02:17 UTC; unix
