AcrossTic-package: A Cost-Minimal Regular Spanning Subgraph with TreeClust

In AcrossTic: A Cost-Minimal Regular Spanning Subgraph with TreeClust

Description

Construct minimum-cost regular spanning subgraph as part of a non-parametric two-sample test for equality of distribution.

Details

The DESCRIPTION file: This package was not yet installed at build time.

Index: This package was not yet installed at build time.
This primarily provides rRegMatch, which for arguments X and r produces a minimum-distance r-regular subgraph of the rows of X.

Author(s)

Dave Ruth, Sam Buttrey

Maintainer: Sam Buttrey <[e-mail]>

References

David Ruth, "A new multivariate two-sample test using regular minimum-weight spanning subgraphs," J. Stat. Distributions and Applications (2014)

Examples

set.seed (123)
X <- matrix (rnorm (100), 50, 2) # Create data...
y <- rep (c (1, 2), each=25) # ...and class membership
## Not run: rRegMatch (X, r = 3, y = y)

AcrossTic documentation built on May 2, 2019, 7:32 a.m.