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/40xdr616jz1n2gz209r5aipj5al3hb4p-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/36g4jhqj3bh66g7m4gyzxa43l4zj53xh-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/33sf0wycxby4r8isn1s6bhjiqr658v5y-r-xyz-0.2.drv | ||
i586-gnu | /gnu/store/25azd2j8ng2q5v5vigkqxrcnj6dk5z3f-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/6rw9y1rw8bd988cb5aks8rbqvhv70x2g-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/26vzfxk2v1wdh12p7xg8211h2xal93w4-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 |