hVOIDP: Optimal variable selection in chain graphical model.
[ ai, library, program ] [ Propose Tags ]
An implementation of the VOIDP algorithm that selects the optimal observations in chain graphical models.
Andreas Krause and Carlos Guestrin. 2009. Optimal value of information in graphical models. J. Artif. Int. Res. 35, 1 (July 2009), 557-591.
Qi Qi; Yi Shang; Hongchi Shi; , "An improved algorithm for optimal subset selection in chain graphical models," Evolutionary Computation (CEC), 2010 IEEE Congress on , vol., no., pp.1-6, 18-23 July 2010
- hVOIDP-1.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
For package maintainers and hackage trustees
- No Candidates
|Versions [RSS]||1.0, 1.0.1, 1.0.2|
|Dependencies||array, base (>=3 && <5), hmatrix [details]|
|Author||Qi Qi <email@example.com>|
|Maintainer||Qi Qi <firstname.lastname@example.org>|
|Source repo||head: git clone git://github.com/qiqi789/VOIDP--haskell-implementation-for-the-optimal-value-of-information-in-chain-models.git|
|Uploaded||by QiQi at 2011-08-26T16:48:33Z|
|Reverse Dependencies||1 direct, 0 indirect [details]|
|Downloads||2597 total (5 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
|Status||Docs not available [build log]
All reported builds failed as of 2016-12-27 [all 7 reports]