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/w0k0jzn9m5kv912xydrkqklvs0xlv24r-r-xyz-0.2.drv | ||
powerpc64le-linux | /gnu/store/rks1q5m16bi5pq5ki5aiv1m57vv86wkh-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/zwznp44n82y72mn7b99r5df5842lhlj2-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/d4ivcc8ajc1r07dfvh7kngmp9f8h5z5s-r-xyz-0.2.drv | ||
i586-gnu | /gnu/store/8xwh00ijxmm1hddvb2i7camirvs2b3sm-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/8bhnl0kabykr236s0inx4y35rmzximb5-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/9ff22q7hakp1r6fzmahpc2vcqgirliw3-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 |