This Article Full Text (PDF) All Versions of this Article: 0165551506064363v1 32/4/309    most recent References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Similar articles in Web of Science Alert me to new issues of the journal Add to Saved Citations Download to citation manager Request Permissions Request Reprints Add to My Marked Citations Citing Articles Citing Articles via HighWire Citing Articles via Web of Science (2) Citing Articles via Google Scholar Citing Articles via Scopus Google Scholar Articles by Ding, S. Articles by Shi, Z. Search for Related Content Social Bookmarking                         What's this?

Supervised feature extraction algorithm based on improved polynomial entropy

College of Information Science and Engineering, Shandong Agricultural University, Taian, 271018, China, Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080, China, sfding{at}sdau.edu.cn

Zhongzhi Shi

Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080, China

Based on information entropy theory, a novel feature extraction algorithm based on improved polynomial entropy (IPE) is set up. Firstly, the concepts and their properties of information entropy and cross entropy (CE) are analysed and studied. On this foundation, we prove that symmetrical cross entropy (SCE) proposed here based on CE satisfies three axioms of the distance, i.e. nonnegativity, symmetry and triangle inequation. So SCE is a kind of distance measure, which can be used to measure the degree of variation between two random variables. Secondly, for convenience, we propose a new concept of improved polynomial entropy (IPE) based on polynomial entropy (PE), and explain that IPE is equivalent to SCE. Thirdly, we make IPE separability criterion of the classes for feature extraction, and design a novel feature extraction algorithm based on IPE. Fianlly, the experimental results demonstrate that the algorithm proposed here is valid and reliable, and it provides a new research approach for feature extraction, data mining and pattern recognition.

Key Words: information entropy theory • cross entropy (CE) • symmetrical cross entropy (SCE) • polynomial entropy (PE) • improved polynomial entropy (IPE) • supervised feature extraction

This version was published on August 1, 2006

Journal of Information Science, Vol. 32, No. 4, 309-315 (2006)
DOI: 10.1177/0165551506064363


CiteULike    Complore    Connotea    Del.icio.us    Digg    Reddit    Technorati    Twitter    What's this?

This article has been cited by other articles:

				Shifei Ding, Yongping Zhang, Xiaofeng Lei, Xinzheng Xu, Xin Wang, Li Wang, and Qing He Research on a principal components decision algorithm based on information entropy Journal of Information Science, February 1, 2009; 35(1): 120 - 127. [Abstract] [PDF]

				S.-F. Ding, S.-X. Xia, F.-X. Jin, and Z.-Z. Shi Novel fuzzy information proximity measures Journal of Information Science, December 1, 2007; 33(6): 678 - 685. [Abstract] [PDF]