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>.

AuthorGian-Andrea Thanei
Date of publication2016-11-05 00:43:10
MaintainerGian-Andrea Thanei <thanei@stat.math.ethz.ch>
LicenseGPL
Version0.1

View on CRAN

Files in this package

xyz
xyz/inst
xyz/inst/doc
xyz/inst/doc/xyz-vignette.R
xyz/inst/doc/xyz-vignette.Rmd
xyz/inst/doc/xyz-vignette.html
xyz/src
xyz/src/core.cpp
xyz/src/RcppExports.cpp
xyz/NAMESPACE
xyz/R
xyz/R/regression.R xyz/R/xyz.R xyz/R/search.R xyz/R/RcppExports.R
xyz/vignettes
xyz/vignettes/regression.R
xyz/vignettes/vignettecode.R
xyz/vignettes/search.R
xyz/vignettes/core.cpp
xyz/vignettes/xyz-vignette.Rmd
xyz/README.md
xyz/MD5
xyz/build
xyz/build/vignette.rds
xyz/DESCRIPTION
xyz/man
xyz/man/xyz_regression.Rd xyz/man/xyz.Rd xyz/man/xyz_search.Rd

Questions? Problems? Suggestions? or email at ian@mutexlabs.com.

All documentation is copyright its authors; we didn't write any of that.