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/qvb67dsx7q7k7qq0njsfffj8pifl0p42-r-xyz-0.2.drv | ||
mips64el-linux | /gnu/store/0lpvdbbvlfb8i5zjfgil7nvc9jln4jxp-r-xyz-0.2.drv | ||
i686-linux | /gnu/store/i25avd5mmfvy76jyhfbhkczgnnxdn7ri-r-xyz-0.2.drv | ||
i586-gnu | /gnu/store/fcnkl53xzz19cibly4gvh9334cgx0700-r-xyz-0.2.drv | ||
armhf-linux | /gnu/store/cz4qzbyps0yalscsiij0w6g58n3bzkdj-r-xyz-0.2.drv | ||
aarch64-linux | /gnu/store/6dsrnwhzjwn98qzybs8618jdqa7ir9r1-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 |