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/6nc0wj1cxwlc36wgrll4m0dd01g4xma0-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/sfr2v7639w2bwdw5w1cs0jvkda0s7lk3-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/q3zymjd1bd6pnlgkam4y89pld9j1yvs8-r-xyz-0.2.drv | ||
i586-gnu | /gnu/store/w34l77siaja2fxkzmw48xhb9i20zkq2w-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/566iwnqwv6d0ws24drvl0ky9l71nmd5i-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/2cd6gvrdr2v3fh204jmd2spkl61v9sz5-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 |