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/8ql5x8dg3566y5k2ky3fshshm7ncx2y9-r-xyz-0.2.drv | ||
powerpc64le-linux | /gnu/store/b74k0bbykj6zac3ycqd9xy1i3zr2n7ip-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/c6fqwv6pxjpzlawnzx6j86vxcjglxfd0-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/ixmrdi95wqfbqs9rxhq38v7rrwq2qsgc-r-xyz-0.2.drv | ||
i586-gnu | /gnu/store/66p7q0ch455rfr14gvcd5w7r0yi552pc-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/m8cg4hiz0cf8saz2vngm0kp5s4a3idvl-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/yc7iincrdzc4ryf1qdgfxj8dhdxqwv2j-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 |