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.

","plain":"High dimensional interaction search by brute force requires a quadratic\ncomputational cost in the number of variables. The xyz algorithm\nprovably finds strong interactions in almost linear time. For details\nof the algorithm see: G. Thanei, N. Meinshausen and R. Shah (2016).\nThe xyz algorithm for fast interaction search in high-dimensional data.\n\n","locale":"en_US.UTF-8"},"home-page":"https://cran.r-project.org/web/packages/xyz/","derivations":[{"system":"x86_64-linux","target":"","derivation":"/gnu/store/n1dr4g937lryw7qhdidxwmim2ff9sj7f-r-xyz-0.2.drv"},{"system":"powerpc64le-linux","target":"","derivation":"/gnu/store/03mwkf9mxdfmbnrz0w0ab3ybsraigm1f-r-xyz-0.2.drv"},{"system":"mips64el-linux","target":"","derivation":"/gnu/store/v5llr2njnvkwrvnk3rakxybq4z8pfkil-r-xyz-0.2.drv"},{"system":"i686-linux","target":"","derivation":"/gnu/store/kh6wgl91kh4flmpbf20nlz7h5kw95s21-r-xyz-0.2.drv"},{"system":"i586-gnu","target":"","derivation":"/gnu/store/d6lqc3n33xrh6wmq5qh2sw0kz2p00jb2-r-xyz-0.2.drv"},{"system":"armhf-linux","target":"","derivation":"/gnu/store/zc3lq0lkyr2zhkihvb2xbfcim9zw8w07-r-xyz-0.2.drv"},{"system":"aarch64-linux","target":"","derivation":"/gnu/store/7c33yxpyvw513n9l0qh693c7kb5vgz9i-r-xyz-0.2.drv"}]}