classification of reduction invariants with improved backpropagation减少不变量的分类与改进的反向传播.pdfVIP

IJMMS 30:4 (2002) 239–247 PII. S0161171202006117 © Hindawi Publishing Corp. CLASSIFICATION OF REDUCTION INVARIANTS WITH IMPROVED BACKPROPAGATION S. M. SHAMSUDDIN, M. DARUS, and M. N. SULAIMAN Received 3 November 2000 Data reduction is a process of feature extraction that transforms the data space into a feature space of much lower dimension compared to the original data space, yet it retains most of the intrinsic information content of the data. This can be done by using a num- ber of methods, such as principal component analysis (PCA), factor analysis, and feature clustering. Principal components are extracted from a collection of multivariate cases as a way of accounting for as much of the variation in that collection as possible by means of as few variables as possible. On the other hand, backpropagation network has been used extensively in classification problems such as XOR problems, share prices prediction, and pattern recognition. This paper proposes an improved error signal of backpropagation network for classification of the reduction invariants using principal component analysis, for extracting the bulk of the useful information present in moment invariants of hand- written digits, leaving the redundant information behind. Higher order centralised scale- invariants are used to extract features of handwritten digits before PCA, and the reduction invariants are sent to the improved backpropagation model for classification purposes. 2000 Mathematics Subject Classification: 68T10. 1. Introduction. The curse of many or most neural network applications is that the number of potentially important variables can be overwhelming. There are problems whenever we deal with a very large number of variables. These include the sheer size of the computational burden ca