xyz: The 'xyz' Algorithm for Fast Interaction Search in High-Dimensional Data

High dimensional interaction search by brute force requires a quadratic computational cost in the number of variables. The xyz algorithm provably finds strong interactions in almost linear time. For details of the algorithm see: G. Thanei, N. Meinshausen and R. Shah (2016). The xyz algorithm for fast interaction search in high-dimensional data <https://arxiv.org/pdf/1610.05108v1.pdf>.

Version:	0.2
Imports:	stats, Rcpp (≥ 0.12.6)
LinkingTo:	Rcpp
Suggests:	knitr, rmarkdown
Published:	2017-04-03
Author:	Gian-Andrea Thanei
Maintainer:	Gian-Andrea Thanei <thanei at stat.math.ethz.ch>
License:	GPL-2 | GPL-3 [expanded from: GPL]
NeedsCompilation:	yes
SystemRequirements:	C++11
Materials:	README
CRAN checks:	xyz results

Documentation:

Reference manual:	xyz.pdf
Vignettes:	Vignette Title

Downloads:

Package source:	xyz_0.2.tar.gz
Windows binaries:	r-devel: xyz_0.2.zip, r-release: xyz_0.2.zip, r-oldrel: xyz_0.2.zip
macOS binaries:	r-release (arm64): xyz_0.2.tgz, r-oldrel (arm64): xyz_0.2.tgz, r-release (x86_64): xyz_0.2.tgz, r-oldrel (x86_64): xyz_0.2.tgz
Old sources:	xyz archive

Reverse dependencies:

Reverse suggests:

GRPtests

Linking:

Please use the canonical form https://CRAN.R-project.org/package=xyz to link to this page.