The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Neighborhood rough set based heterogeneous feature subset selection
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Rough Sets: Theoretical Aspects of Reasoning about Data
Pawlak, Z. (1991) · Our Digital Library (Warsaw University of Technology) · Cited by 8,343
(1998) · Cited by 3,476
Fuzzy logic = computing with words
Zadeh, L. A. (1996) · IEEE Transactions on Fuzzy Systems · doi:10.1109/91.493904 · Cited by 3,227
Zadeh, L. A. (1997) · Fuzzy Sets and Systems · doi:10.1016/s0165-0114(97)00077-8 · Cited by 2,897
Toward 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
Variable precision rough set model
Ziarko, W. (1993) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(93)90048-2 · Cited by 2,036
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
Improved Heterogeneous Distance Functions
Wilson, D. R., & Martinez, T. R. (1997) · Journal of Artificial Intelligence Research · doi:10.1613/jair.346 · Cited by 1,344
Pawlak, Z., & Skowron, A. (2007) · Information Sciences · doi:10.1016/j.ins.2006.06.006 · Cited by 1,187
Relational interpretations of neighborhood operators and rough set approximation operators
Yao, Y. Y. (1998) · Information Sciences · doi:10.1016/s0020-0255(98)10006-3 · Cited by 1,050
Rough Sets in Knowledge Discovery 2
(1998) · Studies in fuzziness and soft computing · doi:10.1007/978-3-7908-1883-3 · Cited by 1,002
TOLERANCE APPROXIMATION SPACES
Skowron, A., & Stepaniuk, J. (1996) · Fundamenta Informaticae · doi:10.3233/fi-1996-272311 · Cited by 956
Consistency-based search in feature selection
Dash, M., & Liu, H. (2003) · Artificial Intelligence · doi:10.1016/s0004-3702(03)00079-1 · Cited by 889
Rough set methods in feature selection and recognition
Świniarski, R. W., & Skowron, A. (2002) · Pattern Recognition Letters · doi:10.1016/s0167-8655(02)00196-4 · Cited by 816
Reduction and axiomization of covering generalized rough sets
Zhu, W., & Wang, F. (2003) · Information Sciences · doi:10.1016/s0020-0255(03)00056-2 · Cited by 699
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
HU, Q., YU, D., & XIE, Z. (2008) · Expert Systems with Applications · doi:10.1016/j.eswa.2006.10.043 · Cited by 513
Self-citationFuzzy-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-citationOn the generalization of fuzzy rough sets
Yeung, D. S., Chen, D., Tsang, E. C. C., Lee, J. W. T., & Xizhao, W. (2005) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2004.841734 · Cited by 448
Wrapper–Filter Feature Selection Algorithm Using a Memetic Framework
Zhu, Z., Ong, Y.-S., & Dash, M. (2007) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2006.883267 · Cited by 443
Ranking Outliers Using Symmetric Neighborhood Relationship
Jin, W., Tung, A. K. H., Han, J., & Wang, W. (2006) · Lecture Notes in Computer Science · doi:10.1007/11731139_68 · Cited by 415
Genetic 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
Mixed feature selection based on granulation and approximation
Hu, Q., Liu, J., & Yu, D. (2007) · Knowledge-Based Systems · doi:10.1016/j.knosys.2007.07.001 · Cited by 278
Self-citationCombined SVM-Based Feature Selection and Classification
Neumann, J., Schnörr, C., & Steidl, G. (2005) · Machine Learning · doi:10.1007/s10994-005-1505-9 · Cited by 248
Class-dependent discretization for inductive learning from continuous and mixed-mode data
Ching, J. Y., Wong, A. K. C., & Chan, K. C. C. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.391407 · Cited by 241
Shen, Q., & Jensen, R. (2004) · Pattern Recognition · doi:10.1016/j.patcog.2003.10.016 · Cited by 221
On fuzzy-rough sets approach to feature selection
Bhatt, R. B., & Gopal, M. (2004) · Pattern Recognition Letters · doi:10.1016/j.patrec.2004.09.044 · Cited by 218
Granular Computing: An Emerging Paradigm
Pedrycz, W. (2001) · Cited by 216
Discretizing continuous attributes while learning Bayesian networks
Friedman, N., & Goldszmidt, M. (1996) · Cited by 196
Nearest neighbors by neighborhood counting
Wang, H. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.126 · Cited by 151
Efficiently handling feature redundancy in high-dimensional data
Yu, L., & Liu, H. (2003) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/956750.956840 · Cited by 69
Feature selection algorithm for mixed data with both nominal and continuous features
Tang, W. H. S., & Mao, K. (2006) · Pattern Recognition Letters · doi:10.1016/j.patrec.2006.10.008 · Cited by 48
Invariance of neighborhood relation under input space to feature space mapping
Shin, H., & Cho, S. (2004) · Pattern Recognition Letters · doi:10.1016/j.patrec.2004.09.023 · Cited by 36
Efficiently handling feature redundancy in high-dimensional data
Yu, L., & Liu, H. (2003) · ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/956804.956840 · Cited by 7
Cited by
Granular Computing: Perspectives and Challenges
Yao, J. T., Vasilakos, A. V., & Pedrycz, W. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tsmcc.2012.2236648 · Cited by 567
Measures of uncertainty for neighborhood rough sets
Chen, Y., Xue, Y., Ma, Y., & Xu, F. (2017) · Knowledge-Based Systems · doi:10.1016/j.knosys.2017.01.008 · Cited by 87
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
Metadata
- Authors
- Hu, Q., Yu, D., Liu, J., & Wu, C.
- Venue
- Information Sciences
- Publisher
- Elsevier BV
- Published
- 2008-09
- Volume
- 178
- Issue
- 18
- Pages
- 3577-3594
- ISSN
- 0020-0255 (ISSN-L)
- OpenAlex
- W2158633287
- Cited by
- 1,085
- References
- 38
- FWCI
- 30.92
- 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.