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/a94svfjn8q1qz07v6a171nmgk1wjb0wl-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/5kw1cgnsp4nh3h2bydyda4xnjzdpkprz-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/852qsy068c598cvn6a49198dp74f2li9-r-xyz-0.2.drv | ||
i586-gnu | /gnu/store/gvvya7js98aiz61a65g9n7x6liykdbdn-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/70bzpifnjlh2q74h1g2cq5x4kvg4qsiq-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/qai6lg2qh2g4b364y3wyisspsinirbgk-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 |