Next Article in Journal
Alternation of Defects and Phase Turbulence Induces Extreme Events in an Extended Microcavity Laser
Previous Article in Journal
Variations à la Fourier-Weyl-Wigner on Quantizations of the Plane and the Half-Plane
Article

A Fast Feature Selection Algorithm by Accelerating Computation of Fuzzy Rough Set-Based Information Entropy

by 1,*, 1 and 2
1
Department of Applied Mathematics, School of Sciences, Xi’an University of Technology, Xi’an 710048, China
2
Department of Automation, Tsinghua University, Beijing 100084, China
*
Author to whom correspondence should be addressed.
Entropy 2018, 20(10), 788; https://doi.org/10.3390/e20100788
Received: 30 August 2018 / Revised: 21 September 2018 / Accepted: 9 October 2018 / Published: 13 October 2018
(This article belongs to the Section Information Theory, Probability and Statistics)
The information entropy developed by Shannon is an effective measure of uncertainty in data, and the rough set theory is a useful tool of computer applications to deal with vagueness and uncertainty data circumstances. At present, the information entropy has been extensively applied in the rough set theory, and different information entropy models have also been proposed in rough sets. In this paper, based on the existing feature selection method by using a fuzzy rough set-based information entropy, a corresponding fast algorithm is provided to achieve efficient implementation, in which the fuzzy rough set-based information entropy taking as the evaluation measure for selecting features is computed by an improved mechanism with lower complexity. The essence of the acceleration algorithm is to use iterative reduced instances to compute the lambda-conditional entropy. Numerical experiments are further conducted to show the performance of the proposed fast algorithm, and the results demonstrate that the algorithm acquires the same feature subset to its original counterpart, but with significantly less time. View Full-Text
Keywords: information entropy; fuzzy rough set theory; feature selection; fast algorithm information entropy; fuzzy rough set theory; feature selection; fast algorithm
Show Figures

Figure 1

MDPI and ACS Style

Zhang, X.; Liu, X.; Yang, Y. A Fast Feature Selection Algorithm by Accelerating Computation of Fuzzy Rough Set-Based Information Entropy. Entropy 2018, 20, 788. https://doi.org/10.3390/e20100788

AMA Style

Zhang X, Liu X, Yang Y. A Fast Feature Selection Algorithm by Accelerating Computation of Fuzzy Rough Set-Based Information Entropy. Entropy. 2018; 20(10):788. https://doi.org/10.3390/e20100788

Chicago/Turabian Style

Zhang, Xiao, Xia Liu, and Yanyan Yang. 2018. "A Fast Feature Selection Algorithm by Accelerating Computation of Fuzzy Rough Set-Based Information Entropy" Entropy 20, no. 10: 788. https://doi.org/10.3390/e20100788

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop