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/vnx1dcnwsav24k4iah2kp5vqkblqar7f-r-xyz-0.2.drv | ||
powerpc64le-linux | /gnu/store/j1197h22hizlvy269pn6ca0az27glwp6-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/gzp79nj2i34ym21v0cr803cldzh6cwg1-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/0dfjr18c68hjdd378x0zsx1s6lrnk88b-r-xyz-0.2.drv | ||
i586-gnu | /gnu/store/k4zm5lb7jid2fk1bpwgz3cb51kv0vha9-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/6f32v2i147w7lmnym72c3x1m7crk2hzv-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/hz03m1prdrppv6k98pa9szr2hqg0xwnb-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 |