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/3z92hzn4lrp6iyp46aymkhx6lh07qdzk-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/l1ay7acwf4xb1aps12ms6529pd71a39j-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/l00g9la57p48jxhy80alfi5dai1b0vj4-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/pr8yjvmdldd1s6ibwzikh71k36mcwj9a-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/g0wcbpf8kz3hbvqgccy56djjrajma69y-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 |