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>.
https://anaconda.org/r_test/r-xyz/badges/version.svg
https://anaconda.org/r_test/r-xyz/badges/latest_release_date.svg
https://anaconda.org/r_test/r-xyz/badges/latest_release_relative_date.svg
https://anaconda.org/r_test/r-xyz/badges/platforms.svg
https://anaconda.org/r_test/r-xyz/badges/license.svg
https://anaconda.org/r_test/r-xyz/badges/downloads.svg