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/prqcc4iqbkxh6n40d9sgzsyx8wr0560c-r-xyz-0.2.drv | ||
riscv64-linux | /gnu/store/rbwxn5nwl65sky9wcish5lwksrnv5cdj-r-xyz-0.2.drv | ||
powerpc-linux | /gnu/store/4jaxf9xz15p4lmzkk5rla5psbcjy5yl4-r-xyz-0.2.drv | ||
powerpc64le-linux | /gnu/store/bqh7mh64m4lwy89d1vv6ga671l6qxp4g-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/h7svpcqn3q3g66pk5rw2rmyjcz3ighl6-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/03c84mhhy6kv4k6hi3rx76nw1pn2wrls-r-xyz-0.2.drv | ||
i586-gnu | /gnu/store/dxaajhyilfcdl940f97l570xmn74sg63-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/jb16zhdn3ylvvyrp2bc88vbkdfq0apk3-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/3z4dd9ghr5wpq9b8pbsqfixr1p1w4l0h-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 |