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/xpjalx5xli3370j0d036ala4vkai6bff-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/s8am5air7z3vbygmn73wpsdcnvvbf78i-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/yk2ffr340pzncjj3l1rzfb42cqqrybjm-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/kw9xrlirhgakygxnpd07yclnp4mlsqkh-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/xpg74424ip73b4rg3wbw33576wcpvnmm-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 |