An improved algorithm for optimal subset selection in chain graphical models
Qi Qi, Yi Shang, Hongchi Shi · 2010
The VoIDP algorithm is the first optimal algorithm for efficiently selecting the subset of observations in chain graphical models. The original VoIDP algorithm has a mistake in the process of recovering the optimal selections, and fails to produce correct outputs. In this paper, we present an improved version of the algorithm; which fixes the mistakes and verifies the solutions in experiments. Further more, we discuss some recent works in the area of subset selection problems, and present a simplified solution for computing the maximum expected total reward for a sub chain under certain circumstances.