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/074l55sm4bgmiykinnab4jcqlqgk00pr-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/bskkwc3wb40gzip63yjrk3fkkfjgcpff-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/77bj2yh4r8sh7qcg7ypap75g7agmksjs-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/vs8zmd9kw6mcjxh3vabnlgijj6249mkp-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/wir76wnlkaazhbpxg6rn5zfjghck5ij6-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 |