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/9bh1zbwckymp8pdkrg5k5z6vifjjfj3q-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/px8kglqjk6kqf7kbdfmjcs845h2n3h48-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/4s4z57wb93yjb4zxpmvpyxn36h2zwvs8-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/nmy6qz87w3w5q4x1k7r61qnf2fm9jn9l-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/czwb3qakjnmxsyz92kh1yhlr392b9mgk-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 |