Optimal Training Pattern Selection Using a Cluster-Generating Artificial Neural Network
In this piece of research, the problem of optimal pattern selection for artificial neural network training is investigated. Given an initial set of training patterns, the objective is to extract the minimal subset which accurately represents the initial set.
The training pattern selection strategy which is presented here is based on the clustering capability of the Harmony Theory simulated-annealing harmony-maximisation artificial neural network . Correction and reduction of the training set is achieved by rectifying the repetition and misclassification errors as well as by organising and unifying the training patterns in terms of their similarities.
KeywordsArtificial Neural Network Classification Error Input Pattern Training Pattern Pattern Selection
Unable to display preview. Download preview PDF.
- 1.Smolensky, P., (1986). Information Processing In Dynamical Systems: Foundations Of Harmony Theory pp. 194–281, in D.E. Rumelhart, J.L. McClelland (eds), “Parallel Distributed Processing: Foundations (Vol. 1)”. MIT Press, Cambridge.Google Scholar
- 2.Rumelhart, D.E., McClelland, J.L, (1986). “Parallel Distributed Processing: Explorations in the Microstructure of Cognition (vol. 1)”. MIT Press, Cambridge, MA.Google Scholar
- 3.Munro, P.W., (1992). Repeat Until Bored: A Pattern Selection Strategy in J.E. Moody, S.J. Hanson, R.P. Lippman (eds) “Advances in Neural Information Processing” 4, pp. 1001–1008. Morgan Kaufmann Publishers, San Mateo, CA.Google Scholar
- 6.Tambouratzis, T., (1995). Simulated Annealing Artificial Neural Networks For The Satisfiability (SAT) Problem, in Proceedings of the “International Conference on Artificial Neural Networks and Genetic Algorithms — 1995”, Mines d’ Ales, France.Google Scholar
- 8.Tambouratzis, T., (1993). A Harmony Theory Network Solution To The Map-Coburing Problem, in Proceedings of the “International Joint Conference on Neural Networks 1993”, Nagoya, Japan, pp. 1545–1548.Google Scholar