Information theoretic covariance complexity and its relation to pattern recognition

DOI10.1109/TSMC.1985.6313437zbMath0582.62003MaRDI QIDQ3704714

Salvatore D. Morgera

Publication date: 1985

Published in: IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)

zbMATH Keywords

algorithmpattern recognitiondata compressionboundscharacteristic rootsToeplitz matricesdiscrimination informationfeature selectionstructural complexitymaximum distancecovariance complexityinformation theoretic complexity

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10)

Related Items

Testing for nonlinearity using redundancies: Quantitative and qualitative aspects, Detecting nonlinearity in multivariate time series, On the Choice of the Kernel Function in Kernel Discriminant Analysis Using Information Complexity, Akaike's information criterion and recent developments in information complexity, On the information-based measure of covariance complexity and its application to the evaluation of multivariate linear models