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/qq2p7wqxy2p0587h04283w7w8hfx55b2-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/kpr6qns73p6959d64h1i783f8d5cmvfn-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/y9zrmhzqa11nnr1fq240sfqiyfd592n5-r-xyz-0.2.drv | ||
i586-gnu | /gnu/store/zk6f9hhv7i3b78wws2vf2p8yz1njvd8x-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/ihlv08vh6nh4jnxb9b84a44s3rbg7hj9-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/ypqinmg5iyrw6jxjc9lkc58vi8c5ymfh-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 |