CONVERGENCE PROOFS FOR GLUCKSMAN'S PROCEDURE.
Rept. for Dec 66-Aug 67,
STANFORD RESEARCH INST MENLO PARK CALIF
Pagination or Media Count:
The standard error-correction procedures for training a linear machine terminate as soon as the training patterns have been separated. If the training set is small, the resulting hyperplane boundaries may be undesirably close to some of the patterns. To correct this situation, Glucksman has proposed a new training procedure which requires the boundaries to be at least some minimum distance from all of the training patterns. This report gives convergence proofs for two modifications of Glucksmans procedure. In both cases, the distance delta used during training must be less than the maximum possible distance delta m. For the tw-category case, we show that convergence is guaranteed for any delta delta m. For the R-category case, we can guarantee convergence if delta is less than some fraction of delta m. The results of applying Glucksmans procedure to two- and ten-category problems using Highleymans data are given. Author
- Theoretical Mathematics