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/1znsw1gab13fc7fvlamlacqdbwwf3abk-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/wgbsvpcijyy9lbzhx8fs2a47a1bnlm49-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/ir4k2bgcys281lbmshxbf04m2qkhiwzz-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/nb55j9ysymbqyw1m4nx3k6w20lm6rbsv-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/ylsn99vy07jpyqkls717940w52qj9rbw-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 |