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/qj74nnya89b37g2bwasz4vy8m5nwr63p-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/pqbcv1jp64gb72rma5j6qfllwrrgybv2-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/1w3mq7h0bl8q87x72zl14fcdw5k7vyyr-r-xyz-0.2.drv | ||
i586-gnu | /gnu/store/3rxc1az611p92wjmlapgyqcqhx6a9lwd-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/qjwnbrvqq0wlyz349cj34a8fkajfwvx2-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/rarxdxfc98b0dj6vjydd6p6w916xwvl2-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 |