Journal
PATTERN RECOGNITION LETTERS
Volume 26, Issue 7, Pages 965-975Publisher
ELSEVIER
DOI: 10.1016/j.patrec.2004.09.044
Keywords
computational complexity; feature selection; fuzzy sets; rough sets
Categories
Ask authors/readers for more resources
In this paper, we have shown that the fuzzy-rough set attribute reduction algorithm [Jenson, R., Shen, Q., 2002. Fuzzy-rough sets for descriptive dimensionality reduction. In: Proceedings of IEEE International Conference on Fuzzy Systems, FUZZ-IEEE ' 02, May 12-17, pp. 29-34] is not convergent on many real datasets due to its poorly designed termination criteria; and the computational complexity of the algorithm increases exponentially with increase in the number of input variables and in multiplication with the size of data patterns. Based on natural properties of fuzzy t-norm and t-conorm, we have put forward the concept of fuzzy-rough sets on compact computational domain, which is then utilized to improve the computational efficiency of FRSAR algorithm. Speed up factor as high as 622 have been achieved with this concept with improved accuracy. We also restructure the algorithm with efficient termination criteria to achieve the convergence on all the datasets and to improve the reliability of selected set of features. (c) 2004 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available