Application of entropic measures of stochastic dependence in pattern recognition

Kapur, J. N. (1986) Application of entropic measures of stochastic dependence in pattern recognition Pattern Recognition, 19 (6). pp. 473-476. ISSN 0031-3203

Full text not available from this repository.

Official URL: http://linkinghub.elsevier.com/retrieve/pii/003132...

Related URL: http://dx.doi.org/10.1016/0031-3203(86)90046-4

Abstract

It is shown that the new entropic measures of stochastic dependence among m variates recently introduced by Watanabe can be usefully employed in the solution of the feature extraction problem of pattern recognition. In particular it is shown that for minimizing the correlations among the components of the random vector in the feature space, in the Gaussian distribution case, the transformation matrix should be formed by using the m eigenvectors corresponding to the m largest eigenvalues of the correlation matrix, rather than the corresponding eigenvalues of the covariance matrix.

Item Type:Article
Source:Copyright of this article belongs to Elsevier Science.
Keywords:Entropy; Stochastic Dependence; Pattern Recognition; Correlation Matrix; Minimum Interdependence
ID Code:28846
Deposited On:20 Dec 2010 08:12
Last Modified:04 Jun 2011 06:20

Repository Staff Only: item control page