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/rlfzk8fywy4gbd1zbrpki1m4bijfc07v-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/smc8j6a7c0h0sfz15ss6ppy73gwyvry0-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/i71qqc6bbc9rmjfdy1693zn4ap652aj4-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/47lbf5bz0sabi2xilhjmzwivbr4hmxr9-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/6g0ga8r6fqg34nsfhpay5asmabpykn7w-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 |