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/n1dr4g937lryw7qhdidxwmim2ff9sj7f-r-xyz-0.2.drv | ||
powerpc64le-linux | /gnu/store/03mwkf9mxdfmbnrz0w0ab3ybsraigm1f-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/v5llr2njnvkwrvnk3rakxybq4z8pfkil-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/kh6wgl91kh4flmpbf20nlz7h5kw95s21-r-xyz-0.2.drv | ||
i586-gnu | /gnu/store/d6lqc3n33xrh6wmq5qh2sw0kz2p00jb2-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/zc3lq0lkyr2zhkihvb2xbfcim9zw8w07-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/7c33yxpyvw513n9l0qh693c7kb5vgz9i-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 |