Skip to Main Content
A computationally feasible parametric procedure for unsupervised learning has been given by Agrawala . The procedure eliminates the computational difficulties associated with updating using a mixture density by making use of a probabilistic labeling scheme. Shanmugam  has given a similar parametric procedure using probabilistic labeling for the more general problem of imperfectly supervised learning. Both procedures assume known class probabilities. In this correspondence a computationally feasible parametric procedure using probabilistic labeling is given for imperfectly supervised learning when the class probabilities are among the unknown statistical parameters.