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/m18625pak48kzrcm7vfffk3y0g9psr3p-r-xyz-0.2.drv | ||
powerpc64le-linux | /gnu/store/64x14lx1gnzpl7as18mx254lyq77d170-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/7x9q24ny6z2yrqfnzwy3cpyl12zvl0zx-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/c5a7mvbwan7mpwa0vhimvszv9iikvmy1-r-xyz-0.2.drv | ||
i586-gnu | /gnu/store/g7n7f13ybpf4ajprzpc2sndbficjgkh5-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/0qia1m73jz8v5r25dhbi27v1l1h5gqmw-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/zrvxx4axipz4na85sjvpx2vfqirq3dk6-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 |