hVOIDP: Optimal variable selection in chain graphical model.
An implementation of the VOIDP algorithm that selects the optimal observations in chain graphical models.
References:
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
Downloads
- hVOIDP-1.0.2.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
Versions [RSS] | 1.0, 1.0.1, 1.0.2 |
---|---|
Dependencies | array, base (>=3 && <5), hmatrix [details] |
License | LicenseRef-GPL |
Author | Qi Qi <qiqi789@gmail.com> |
Maintainer | Qi Qi <qiqi789@gmail.com> |
Category | AI |
Home page | http://dslsrv4.cs.missouri.edu/~qqbm9 |
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-26T17:43:50Z |
Distributions | |
Reverse Dependencies | 1 direct, 0 indirect [details] |
Executables | hVOIDP |
Downloads | 2724 total (2 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs uploaded by user Build status unknown [no reports yet] |