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/7pfp54405f6awkj4yfkgmmyhpm4730fy-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/53jmz30a0lsxyfk5gk7328hm27s4vqx9-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/ccxi3iz7xdyyhqhmj7a1z9crgpzzlpbw-r-xyz-0.2.drv | ||
i586-gnu | /gnu/store/1g3iqh6im0y9wj8jv4qyblwgryha40k6-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/jw8gcsg98xkamlkvfksw8pdzavcky225-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/rdb18mbbs4ijs9d69kkncw417rrjljsp-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 |