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/cq3z4kvjnn2m5vhv75lmxi5wbv8rwlf3-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/xgklrarn828hbql1wrld0a04h5xrvfxr-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/7v82hcjgli20gslz3kjksr07lj1banin-r-xyz-0.2.drv | ||
i586-gnu | /gnu/store/klazaxvcapyvzwqdiwkf9zjk8nkx4kgr-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/gjaxks46ib26wcx4dwkqrx962pj30rxk-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/8xgv0jc6hn3pscg9dmxlzgf5jq7f8ga5-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 |