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
|Date of publication||2017-04-03 16:39:20 UTC|
|Maintainer||Gian-Andrea Thanei <firstname.lastname@example.org>|
|Package repository||View on CRAN|
Install the latest version of this package by entering the following in R:
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.