The Bayesian learning scheme is computationally infeasible for most of the unsupervised learning problems. This paper suggests a learning scheme, "learning with a probabilistic teacher," which works with unclassified samples and is computationally feasible for many practical problems. In this scheme a sample is probabilistically assigned with a class with appropriate probabilities computed using all the information available: Then the sample is used in learning the parameter values given this assignment of the class. The convergence of the scheme is established and a comparison with the best linear estimator is presented.
[1]
J. Spragins.
REPRODUCING DISTRIBUTIONS FOR MACHINE LEARNING
,
1963
.
[2]
Norman M. Abramson,et al.
Learning to recognize patterns in a random environment
,
1962,
IRE Trans. Inf. Theory.
[3]
Stanley C. Fralick,et al.
Learning to recognize patterns without a teacher
,
1967,
IEEE Trans. Inf. Theory.
[4]
Yu-Chi Ho,et al.
On pattern classification algorithms--Introduction and survey
,
1968
.
[5]
Nasser E. Nahi,et al.
Optimal recursive estimation with uncertain observation
,
1969,
IEEE Trans. Inf. Theory.