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/1r8m1mrlbnrv418nsz8mv867fwbszdwn-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/17pf4ss4l3f8gy85465p7nrlam1acnyj-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/v9kmmi0mcq6ssq9i5xxpmllv5qgazd6j-r-xyz-0.2.drv | ||
i586-gnu | /gnu/store/9h7bgbsc2a9kd2gwzhny5yybdnkn4x6n-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/05imab1kvw1fv91v0mwdp1cz18kv64nz-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/1q1gh8imy2i67hga2nhkxg698j17bd2c-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 |