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/1glhgw9yi771fkyflr6kg55zrsibcgx2-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/7nzidr4q5b34h9crccyx8y2fjlkkmvcm-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/05xcslzhm8fdbg72n139d176a602wgvi-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/4yp4b8k54fmjwkqjh5vlhz0v9dwnf8zv-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/yc34nrh35hi7s9yk41pb5h0rx7634aic-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 |