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/hzvhx47ivy9q34i6wycw3h5bijiwwhl8-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/w64b8ykm1qvn284dlf9pqp36jkz2zgzp-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/pdrc5irvds6mcfs4cs4z3nf22yb0af1g-r-xyz-0.2.drv | ||
i586-gnu | /gnu/store/ynn9hikdsmw4y50kp9jqxhl85nm7gmhw-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/1xpi6pgz2jpwn4jcmyrkzicf7mdd1413-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/h9x7zl9w57yzs9mw34caw2ky21vnfasa-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 |