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/8rh5i5cycdqqms30fmj7xpx64knl64qh-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/h07r9crs57w4k9w32cd8hg31lvfagrxf-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/dbkil4nyraa86xfzi4gsc9whxh0ik36z-r-xyz-0.2.drv | ||
i586-gnu | /gnu/store/1fbm1q1vxbrj8pv7s4dbq9gbqxa5f7nz-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/swmgw46w85glhd3wzyy2m8ismjcyhggw-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/w71dbi6dfrdxxqd29h7n0xd8800axfzx-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 |