The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
GBNRS: A Novel Rough Set Algorithm for Fast Adaptive Attribute Reduction in Classification
Abstract
Feature reduction is an important aspect of Big Data analytics on today’s ever-larger datasets. Rough sets are a classical method widely applied in attribute reduction. Most rough set algorithms use theprioridomain knowledge of a dataset to process continuous attributes through using a membership function. Neighborhood rough sets (NRS) replace the membership function with the concept of neighborhoods, allowing NRS to handle scenarios where noa prioriknowledge is available. However, the neighborhood radius of each object in NRS is fixed, and the optimization of the radius depends on grid searching. This diminishes both the efficiency and effectiveness, leading to a time complexity of not lower than$O(N^2)$O(N2). To resolve these limitations, granular ball neighborhood rough sets (GBNRS), a novel NRS method with time complexity$O(N)$O(N), is proposed. GBNRS adaptively generates a different neighborhood for each object, resulting in greater generality and flexibility in comparison to standard NRS methods. GBNRS is compared with the current state-of-the-art NRS method, FARNeMF, and find that GBNRS obtains both higher performance and higher classification accuracy on public benchmark datasets. All code has been released in the open source GBNRS library athttp://www.cquptshuyinxia.com/GBNRS.html.
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
Clustering by fast search and find of density peaks
Rodriguez, A., & Laio, A. (2014) · Science · doi:10.1126/science.1242072 · Cited by 4,942
Zadeh, L. A. (1997) · Fuzzy Sets and Systems · doi:10.1016/s0165-0114(97)00077-8 · Cited by 2,897
Pawlak, Z., & Skowron, A. (2007) · Information Sciences · doi:10.1016/j.ins.2006.06.003 · Cited by 2,070
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
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
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
Granular ball computing classifiers for efficient, scalable and robust learning
Xia, S., Liu, Y., Ding, X., Wang, G., Yu, H., & Luo, Y. (2019) · Information Sciences · doi:10.1016/j.ins.2019.01.010 · Cited by 341
Self-citationA Fitting Model for Feature Selection With Fuzzy Rough Sets
Wang, C., Qi, Y., Shao, M., Hu, Q., Chen, D., Qian, Y., & Lin, Y. (2017) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2016.2574918 · Cited by 266
Reduction algorithms based on discernibility matrix: The ordered attributes method
Wang, J., & Wang, J. (2001) · Journal of Computer Science and Technology · doi:10.1007/bf02943234 · Cited by 211
Cited by
Cost-Sensitive Neighborhood Granularity Selection for Hierarchical Classification
Li, S., Yang, J., Bao, H., Xia, D., Zhang, Q., & Wang, G. (2025) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2025.3566038 · Cited by 45
Self-citation
Metadata
- Authors
- Xia, S., Zhang, H., Li, W., Wang, G., Giem, E., & Chen, Z.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2022-03-01
- Volume
- 34
- Issue
- 3
- Pages
- 1231-1242
- ISSN
- 1041-4347 (ISSN-L)
- 1558-2191
- 2326-3865
- OpenAlex
- W3029713334
- Cited by
- 273
- References
- 16
- FWCI
- 12.27
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: GBNRS: A Novel Rough Set Algorithm for Fast Adaptive Attribute Reduction in Classification. https://app.cochat.ai/papers/10.1109/tkde.2020.2997039
- The paper
- Xia, S., Zhang, H., Li, W., Wang, G., Giem, E., & Chen, Z. (2022). GBNRS: A Novel Rough Set Algorithm for Fast Adaptive Attribute Reduction in Classification. IEEE Transactions on Knowledge and Data Engineering. https://doi.org/10.1109/tkde.2020.2997039
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.