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/c7ai41qbzzvy0smlypfjy194myxzalri-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/nd8xfs8wza4fkfjhll8gmg761qd7dl0r-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/wbyn0dsa8j328nsxx5myagcv4mg0dly5-r-xyz-0.2.drv | ||
i586-gnu | /gnu/store/d3y35i1aa18lfpabj0cjv277jdnidjrp-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/a6lpfmn6cfg6kbwv9h9891cys0kr09sd-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/3mfd3mmksjnfahnjggppc6n0wwcnl8z1-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 |