Divergence-Based Supervised Information Feature Compression Algorithm
In this paper, a novel supervised information feature compression algorithm based on divergence is set up. Firstly, according to the information theory, the concept and its properties of the divergence, i.e. average separability information (ASI) is studied, and a concept of symmetry average separability information (SASI) is proposed, and proved that the SASI here is a kind of distance measure, i.e. the SASI satisfies three requests of distance axiomatization, which can be used to measure the difference degree of a two-class problem. Secondly, based on the SASI, a compression theorem is given, and can be used to design information feature compression algorithm. Based on these discussions, we design a novel supervised information feature compression algorithm based on the SASI. At last, the experimental results demonstrate that the algorithm here is valid and reliable.
KeywordsFeature Vector Pattern Vector True Distance Feature Compression Information Compression
Unable to display preview. Download preview PDF.
- 6.Yang, J., Yang, J.Y.: A Generalized K-L Expansion Method That Can Deal with Small Sample Size and High-dimensional Problems. Pattern Analysis Applications 6(6), 47-54 (2003)Google Scholar
- 8.Ding, S.F., Shi, Z.Z.: Symmetric Cross Entropy and Information Feature Compression Algorithm. Journal of Computational Information Systems 1(2), 247–252 (2005)Google Scholar
- 9.Chen, S.H., Lu, C.L.: An Entropic Approach to Dimensionality Reduction in the Representation Space on Discrete Processes. Journal of Nanjing Institute of Meteorology 24(1), 74–82 (2001)Google Scholar