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/24cynbhrl7y9x467xiri7p4rh55hlp2z-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/byj25s0s4l1vb52632h200fkx7zz3hcw-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/lvzvn0a2aampkl5hp9z0x8wx7gqg6x52-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/8q2wyvf2gx0nb92gyf9qas7jk6gc0iyf-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/778imqv1a12ffp7k6sq8iwawh97389pp-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 |