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/58pdjdcm9dllr8s068r40yc5swnac92x-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/4z68p50v86x7nglqf2y2dx426s1davcp-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/z56irjczd4220xv849crlma38h93wmfh-r-xyz-0.2.drv | ||
i586-gnu | /gnu/store/vc3qg0il4lkvrdczz4fnxq2k26sr6hpg-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/nr5ys137yzx9iggg59kif6idia9sz954-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/37rs6q70cwkrgfaj5yi1jhjbdklm17vq-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 |