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/m90h609vgws9gbiqsmx7x0m74akaysx9-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/knj5n2x4fd3yg689lvk6ss4p4d2wwqwb-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/v474bi4bsdnji2pff1zw0n8ymlb3crh5-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/l4pfh2vah2i0sk1lryv2fzyq46mfjv8m-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/y2rr45azddw0i7dg8pfwlp5ka0risbwg-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 |