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/n5j243p1wfaxp58rji2fpa7c320dhmwb-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/cgpxwz17d14i3byfnlj53jfm10plvl6z-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/b2bsgqszxry5ikrq3n0rajkmi9wy15gm-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/i7nvnjn69w4rj5fpbwzpzyllc54jjwi8-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/cbzdpixih6ziwwrjqc40lakpd11qdrcw-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 |