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/2rrz8ygcv5hj97j7sl639jhix0ivvx5y-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/0gwgdklccwqbzly2qk04y2aghjnfxq1f-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/kp3cz2n9lfcmcpk75jy6z2m18pv006sn-r-xyz-0.2.drv | ||
i586-gnu | /gnu/store/dphhwsmx8ygsd57brlipka402ajibz94-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/4q0g6mw50film8qcji6hz3lwi1wlxyfn-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/5m8hdn90r0lg6jdza388flhzczrksas5-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 |