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/8qrfk3djc2xrnqzwnbk7q8vxm7slklv2-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/rxd0qww244wzl36a20m97d0dkwfg1mfq-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/khf0wax48ckmpmbm0wkwr31fkv0nwp47-r-xyz-0.2.drv | ||
i586-gnu | /gnu/store/b7s1j6p3rq24hzfhvx90sddxmfw096n5-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/pzhbcjnlkq0zwn26i18hif47hw2ps0a1-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/lg9kzwq54y061i69l02w56ywljgfhdgq-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 |