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.
System | Target | Derivation | Build status |
---|---|---|---|
x86_64-linux | /gnu/store/sz4fwp2m9b2nikk645i11bb99fllc3wr-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/mjp2kg7nr06fn386685yhxdzmwzm4dfi-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/dj0z6z61avirn52si6s0xqwmzwig2d1z-r-xyz-0.2.drv | ||
i586-gnu | /gnu/store/z4d81b4y74hdx17ky0f34xr4ygvs8vy7-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/4zbgdyqvlqyspkjvrzf77pnx5zj60792-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/i0540z4j5nrn5wwzs8s60mmd87yfn6i9-r-xyz-0.2.drv |
Linter | Message | Location |
---|---|---|
description Validate package descriptions | sentences in description should be followed by two spaces; possible infractions at 232, 243, 262 |