Open AccessThis article is
- freely available
Multi-Granulation Entropy and Its Applications
School of Computer Science & Engineering, University of Electronic Science and Technology of China, Sichuan, Chengdu 611731, China
* Author to whom correspondence should be addressed.
Received: 2 April 2013; in revised form: 22 May 2013 / Accepted: 30 May 2013 / Published: 6 June 2013
Abstract: In the view of granular computing, some general uncertainty measures are proposed through single-granulation by generalizing Shannon’s entropy. However, in the practical environment we need to describe concurrently a target concept through multiple binary relations. In this paper, we extend the classical information entropy model to a multi-granulation entropy model (MGE) by using a series of general binary relations. Two types of MGE are discussed. Moreover, a number of theorems are obtained. It can be concluded that the single-granulation entropy is the special instance of MGE. We employ the proposed model to evaluate the significance of the attributes for classification. A forward greedy search algorithm for feature selection is constructed. The experimental results show that the proposed method presents an effective solution for feature analysis.
Keywords: multi-granulation; entropy; feature selection
Citations to this Article
Cite This Article
MDPI and ACS Style
Zeng, K.; She, K.; Niu, X. Multi-Granulation Entropy and Its Applications. Entropy 2013, 15, 2288-2302.
Zeng K, She K, Niu X. Multi-Granulation Entropy and Its Applications. Entropy. 2013; 15(6):2288-2302.
Zeng, Kai; She, Kun; Niu, Xinzheng. 2013. "Multi-Granulation Entropy and Its Applications." Entropy 15, no. 6: 2288-2302.