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/yvjc53kqdfwykd1k538jjpsh0x2xanbp-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/x5y8a7a2qjx9yis7yazcy07rs49hwjhc-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/xas85p63j8sc96qggsbdy29hkdiivgxm-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/yb4m2xzbg6llb9l6zym9ya24bklybl6f-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/vfls2yk6258sii2f28sk01znsyzxazrk-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 |