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/5hyxyp7hz46qisllnynyv256qnkxn0wv-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/1dslr5ajh4if4727ybryxj2p2v252lgz-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/mi6vfsahx7m16n2cv440yhmmii797xnf-r-xyz-0.2.drv | ||
i586-gnu | /gnu/store/vl2vcbmn89lnv9zl5zab5rlczhzhimk8-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/473kpvpyy1b06fnr24szk48ghq66g9q3-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/ag25agv5by0w0phimiwkwjmbm4v1l0i4-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 |