The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
A Fitting Model for Feature Selection With Fuzzy Rough Sets
Abstract
A fuzzy rough set is an important rough set model used for feature selection. It uses the fuzzy rough dependency as a criterion for feature selection. However, this model can merely maintain a maximal dependency function. It does not fit a given dataset well and cannot ideally describe the differences in sample classification. Therefore, in this study, we introduce a new model for handling this problem. First, we define the fuzzy decision of a sample using the concept of fuzzy neighborhood. Then, a parameterized fuzzy relation is introduced to characterize the fuzzy information granules, using which the fuzzy lower and upper approximations of a decision are reconstructed and a new fuzzy rough set model is introduced. This can guarantee that the membership degree of a sample to its own category reaches the maximal value. Furthermore, this approach can fit a given dataset and effectively prevents samples from being misclassified. Finally, we define the significance measure of a candidate attribute and design a greedy forward algorithm for feature selection. Twelve datasets selected from public data sources are used to compare the proposed algorithm with certain existing algorithms, and the experimental results show that the proposed reduction algorithm is more effective than classical fuzzy rough sets, especially for those datasets for which different categories exhibit a large degree of overlap.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Pawlak, Z. (1982) · International Journal of Computer & Information Sciences · doi:10.1007/bf01001956 · Cited by 12,322
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Peng, H., Long, F., & Ding, C. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.159 · Cited by 10,544
Multiple comparisons among means
Dunn, O. J. (1961) · Journal of the American Statistical Association · doi:10.1080/01621459.1961.10482090 · Cited by 5,006
Theoretical and Empirical Analysis of ReliefF and RReliefF
Robnik-Šikonja, M., & Kononenko, I. (2003) · Machine Learning · doi:10.1023/a:1025667309714 · Cited by 3,025 · cited 1×
“Distance [26], [45], correlation [11], consistency [6], and mutual information [25], [37], [48] are usually regarded as being feasible feature evaluation functions.”
BackgroundROUGH FUZZY SETS AND FUZZY ROUGH SETS*
Dubois, D., & Prade, H. M. (1990) · International Journal of General Systems · doi:10.1080/03081079008935107 · Cited by 3,012
A Comparison of Alternative Tests of Significance for the Problem of $m$ Rankings
Friedman, M. (1940) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177731944 · Cited by 2,785 · cited 1×
“In addition, we apply the Friedman test [10] and the Bonferroni–Dunn test [8] to show the statistical significance of the results.”
MethodToward integrating feature selection algorithms for classification and clustering
Liu, H., & Yu, L. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.66 · Cited by 2,706
Feature Selection for Knowledge Discovery and Data Mining
Liu, H., & Motoda, H. (1998) · Springer eBooks · doi:10.1007/978-1-4615-5689-3 · Cited by 2,198
Pawlak, Z., & Skowron, A. (2007) · Information Sciences · doi:10.1016/j.ins.2006.06.003 · Cited by 2,070
Efficient Feature Selection via Analysis of Relevance and Redundancy
Yu, L., & Liu, H. (2004) · doi:10.5555/1005332.1044700 · Cited by 1,983
Correlation-based Feature Selection for Discrete and Numeric Class Machine Learning
Hall, M. A. (2000) · Cited by 1,715
The Discernibility Matrices and Functions in Information Systems
Skowron, A., & Rauszer, C. (1992) · Intelligent Decision Support · doi:10.1007/978-94-015-7975-9_21 · Cited by 1,653
A Branch and Bound Algorithm for Feature Subset Selection
Narendra, & Fukunaga (1977) · IEEE Transactions on Computers · doi:10.1109/tc.1977.1674939 · Cited by 1,245
Statistical Comparisons of Classifiers over Multiple Data Sets
DemšarJanez (2006) · Journal of Machine Learning Research · doi:10.5555/1248547.1248548 · Cited by 1,074
A comparative study of fuzzy rough sets
Radzikowska, A. M., & Kerre, E. E. (2002) · Fuzzy Sets and Systems · doi:10.1016/s0165-0114(01)00032-x · Cited by 976
Input feature selection for classification problems
Kwak, N., & Choi, C.-H. (2002) · IEEE Transactions on Neural Networks · doi:10.1109/72.977291 · Cited by 938
Consistency-based search in feature selection
Dash, M., & Liu, H. (2003) · Artificial Intelligence · doi:10.1016/s0004-3702(03)00079-1 · Cited by 889
Complexity measures of supervised classification problems
Ho, T. K., & Basu, M. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.990132 · Cited by 734
Semantics-preserving dimensionality reduction: rough and fuzzy-rough-based approaches
Jensen, R., & Shen, Q. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.96 · Cited by 667
Positive approximation: An accelerator for attribute reduction in rough set theory
Qian, Y., Liang, J., Pedrycz, W., & Dang, C. (2010) · Artificial Intelligence · doi:10.1016/j.artint.2010.04.018 · Cited by 649
Self-citationFeature extraction by non parametric mutual information maximization
Torkkola, K. (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944981 · Cited by 611
New Approaches to Fuzzy-Rough Feature Selection
Jensen, R., & Shen, Q. (2009) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2008.924209 · Cited by 591
Fuzzy–rough attribute reduction with application to web categorization
Jensen, R., & Shen, Q. (2004) · Fuzzy Sets and Systems · doi:10.1016/s0165-0114(03)00021-6 · Cited by 518
Fuzzy-Rough Sets Assisted Attribute Selection
Jensen, R., & Shen, Q. (2007) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2006.889761 · Cited by 468
Information-preserving hybrid data reduction based on fuzzy-rough techniques
Hu, Q., Yu, D., & Xie, Z. (2006) · Pattern Recognition Letters · doi:10.1016/j.patrec.2005.09.004 · Cited by 462
Self-citationGenetic programming for simultaneous feature selection and classifier design
Muni, D. P., Pal, N. R., & Das, J. (2006) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2005.854499 · Cited by 357
Using Rough Sets with Heuristics for Feature Selection
Zhong, N., Dong, J., & Ohsuga, S. (2001) · Journal of Intelligent Information Systems · doi:10.1023/a:1011219601502 · Cited by 306
Maximum Ambiguity-Based Sample Selection in Fuzzy Decision Tree Induction
Wang, X.-Z., Dong, L.-C., & Yan, J.-H. (2012) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2011.67 · Cited by 172
An extended Chi2 algorithm for discretization of real value attributes
Su, C., & Hsu, J.-H. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.39 · Cited by 158
Parameterized attribute reduction with Gaussian kernel based fuzzy rough sets
Chen, D., Hu, Q., & Yang, Y. (2011) · Information Sciences · doi:10.1016/j.ins.2011.07.025 · Cited by 97
Self-citationA Novel Approach to Building a Robust Fuzzy Rough Classifier
Zhao, S., Chen, H., Li, C., Du, X., & Sun, H. (2014) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2014.2327993 · Cited by 66
Fast randomized algorithm with restart strategy for minimal test cost feature selection
Li, J., Zhao, H., & Zhu, W. (2014) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-014-0262-0 · Cited by 10
Cited by
GBNRS: A Novel Rough Set Algorithm for Fast Adaptive Attribute Reduction in Classification
Xia, S., Zhang, H., Li, W., Wang, G., Giem, E., & Chen, Z. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.2997039 · Cited by 273
Metadata
- Authors
- Wang, C., Qi, Y., Shao, M., Hu, Q., Chen, D., Qian, Y., & Lin, Y.
- Venue
- IEEE Transactions on Fuzzy Systems
- Published
- 2017-08
- Volume
- 25
- Issue
- 4
- Pages
- 741-753
- ISSN
- 1063-6706 (ISSN-L)
- 1941-0034
- OpenAlex
- W2416404380
- Cited by
- 266
- References
- 33
- FWCI
- 26.50
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.