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/k4g8vax0x49d045x6mj04j87gg0gac7k-r-xyz-0.2.drv"},{"system":"mips64el-linux","target":"","derivation":"/gnu/store/cm0csdj0dcj9fc9dsc454myg6zyjg5ya-r-xyz-0.2.drv"},{"system":"i686-linux","target":"","derivation":"/gnu/store/8m5f0n2wyd36bfr2b1sypp6vlv8g3lx0-r-xyz-0.2.drv"},{"system":"i586-gnu","target":"","derivation":"/gnu/store/f95c949a3xbl2l15aqx4sbhzwsw5zpcj-r-xyz-0.2.drv"},{"system":"armhf-linux","target":"","derivation":"/gnu/store/r15jhv9ak475zjz6kwch0g8a4d0y76r8-r-xyz-0.2.drv"},{"system":"aarch64-linux","target":"","derivation":"/gnu/store/38r09q7xamk34s8jhw5zb2yhia9fq124-r-xyz-0.2.drv"}]}