The Bootstrap Widrow-Hoff Rule as a Cluster-Formation Algorithm
- 1 September 1990
- journal article
- Published by MIT Press in Neural Computation
- Vol. 2 (3) , 355-362
- https://doi.org/10.1162/neco.1990.2.3.355
Abstract
An algorithm that is widely used for adaptive equalization in current modems is the “bootstrap” or “decision-directed” version of the Widrow-Hoff rule. We show that this algorithm can be viewed as an unsupervised clustering algorithm in which the data points are transformed so that they form two clusters that are as tight as possible. The standard algorithm performs gradient ascent in a crude model of the log likelihood of generating the transformed data points from two gaussian distributions with fixed centers. Better convergence is achieved by using the exact gradient of the log likelihood.Keywords
This publication has 5 references indexed in Scilit:
- Connectionist learning proceduresArtificial Intelligence, 1989
- An Analysis of the Elastic Net Approach to the Traveling Salesman ProblemNeural Computation, 1989
- Adaptive equalizationProceedings of the IEEE, 1985
- The function of dream sleepNature, 1983
- Techniques for Adaptive Equalization of Digital Communication SystemsBell System Technical Journal, 1966