Information theoretic covariance complexity and its relation to pattern recognition

DOI10.1109/TSMC.1985.6313437MaRDI QIDQ3704714zbMATH OpenFDO

Authors Salvatore D. Morgera

Publication date 1985

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

Full work available at URL https://doi.org/10.1109/TSMC.1985.6313437

zbMATH Keywords

algorithmboundscharacteristic rootscovariance complexitydata compressiondiscrimination informationfeature selectioninformation theoretic complexitymaximum distancepattern recognitionstructural complexityToeplitz matrices

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10)

Recommendations

• scientific article; zbMATH DE number 3874655
• Information approach to the problems of pattern recognition
• On rates of convergence of general information criteria in signal processing when the noise covariance matrix is arbitrary
• scientific article; zbMATH DE number 3971958
• scientific article; zbMATH DE number 4041079

Cited in

(8)

• Testing for nonlinearity using redundancies: Quantitative and qualitative aspects
• Detecting nonlinearity in multivariate time series
• Akaike's information criterion and recent developments in information complexity
• On Tsallis extropy with an application to pattern recognition
• On the information-based measure of covariance complexity and its application to the evaluation of multivariate linear models
• On the Choice of the Kernel Function in Kernel Discriminant Analysis Using Information Complexity
• scientific article; zbMATH DE number 3874655 (Why is no real title available?)
• Information Theory in Computer Vision and Pattern Recognition

This page was built for publication: Information theoretic covariance complexity and its relation to pattern recognition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3704714)