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/c7kpvsyign9kbf8qmihf6spc88gvyzb5-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/8lm4nc36bgammki78l6vpdkmhb7zpfz2-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/6dyla298i51i74i97mnsakfnaakp0wwb-r-xyz-0.2.drv | ||
i586-gnu | /gnu/store/p4psk0l9lb0bw72bl88apjl4ah538knm-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/mh21yq8cnhy85dj14d271cwayh13jb2x-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/53mb2fvh8kl7bd38gpvda22r8fir5ylb-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 |