Search

The feature selection problem often occurs in pattern recognition and, more specifically, classification. Although these patterns could contain a large number of features, some of them could prove to be irrelevant, redundant or even detrimental to classification accuracy. Thus, it is important to remove these kinds of features, which in turn leads to problem dimensionality reduction and could eventually improve the classification accuracy. In this paper an approach to dimensionality reduction based on differential evolution which represents a wrapper and explores the solution space is presented. The solutions, subsets of the whole feature set, are evaluated using the k-nearest neighbour algorithm. High quality solutions found during execution of the differential evolution fill the archive. A final solution is obtained by conducting k-fold crossvalidation on the archive solutions and selecting the best one. Experimental analysis is conducted on several standard test sets. The classification accuracy of the k-nearest neighbour algorithm using the full feature set and the accuracy of the same algorithm using only the subset provided by the proposed approach and some other optimization algorithms which were used as wrappers are compared. The analysis shows that the proposed approach successfully determines good feature subsets which may increase the classification accuracy. [ABSTRACT FROM AUTHOR]

In [2] the multilinear components of the prime varieties of the matrix type 2 were classified in terms of the multilinear generators, but the generators were not calculated. In this paper we calculate with the help of PC the generators of one of these multilinear components. The result shows that the problem of description of the prime varieties in terms of generators is quite wild. [ABSTRACT FROM AUTHOR]

This paper presents new algorithms of iterative error correction codes. The algorithms have applications in the error correction problems which may appear on the communication channel and in the cipher text reconstruction in the hypothesis that we know the statistic of plain text p ≠ 0.5. [ABSTRACT FROM AUTHOR]