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/7njh0v8fnxvv6jmvw3cnmcgkwxihyvmm-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/6zbvvbg56xkymd7nvzg9wsvdhykk84d5-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/qsb4dpcswhi040vwpni1r56n761a3nbm-r-xyz-0.2.drv | ||
i586-gnu | /gnu/store/zmbf6crq0q9jsm5j5vwxw1qrj6x1ln22-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/jmsgvsw85qmxvv74njfhfixh0fv7ii4w-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/yx4i7q9ggv1c732f53a4w39282jjbchn-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 |