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/qbk7y5l1cwvhqm5m37chd1z6rblmic7j-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/ykjrbcwzkw6l19kcdbl3l5hv1q6l9kza-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/35nkl3j8sh2jj7c52fn4vlcyj2453mp4-r-xyz-0.2.drv | ||
i586-gnu | /gnu/store/asx0q3a0zvgnywzsgagzl7954rxh0brq-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/6yfxs4y0pklqc2cfdjrnn7fph3dqr3x1-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/rmcs4arp3myy589d1af6gsjm0g1jckm7-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 |