The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
Selecting Discrete and Continuous Features Based on Neighborhood Decision Error Minimization
Abstract
Feature selection plays an important role in pattern recognition and machine learning. Feature evaluation and classification complexity estimation arise as key issues in the construction of selection algorithms. To estimate classification complexity in different feature subspaces, a novel feature evaluation measure, called the neighborhood decision error rate (NDER), is proposed, which is applicable to both categorical and numerical features. We first introduce a neighborhood rough-set model to divide the sample set into decision positive regions and decision boundary regions. Then, the samples that fall within decision boundary regions are further grouped into recognizable and misclassified subsets based on class probabilities that occur in neighborhoods. The percentage of misclassified samples is viewed as the estimate of classification complexity of the corresponding feature subspaces. We present a forward greedy strategy for searching the feature subset, which minimizes the NDER and, correspondingly, minimizes the classification complexity of the selected feature subset. Both theoretical and experimental comparison with other feature selection algorithms shows that the proposed algorithm is effective for discrete and continuous features, as well as their mixture.
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
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
Gene selection for cancer classification using support vector machines
Guyon, I., Weston, J., Barnhill, S., & Vapnik, V. (2002) · Machine Learning · doi:10.1023/a:1012487302797 · Cited by 9,954
Wrappers for feature subset selection
Kohavi, R., & John, G. H. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00043-x · Cited by 8,947
Rough Sets: Theoretical Aspects of Reasoning about Data
Pawlak, Z. (1991) · Our Digital Library (Warsaw University of Technology) · Cited by 8,343
Russell, E. L., Chiang, L. H., & Braatz, R. D. (2000) · Advances in Industrial Control · doi:10.1007/978-1-4471-0409-4_3 · Cited by 7,862
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/153244303322753616 · Cited by 3,502
Pawlak, Z., Grzymala-Busse, J., Slowinski, R., & Ziarko, W. (1995) · Communications of the ACM · doi:10.1145/219717.219791 · Cited by 3,205
Floating search methods in feature selection
Pudil, P., Novovičová, J., & Kittler, J. (1994) · Pattern Recognition Letters · doi:10.1016/0167-8655(94)90127-9 · Cited by 3,098
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 4×
“The ReliefF algorithm [39] relies on this idea.”
BackgroundMethodInfluential
Cited by
How Complex Is Your Classification Problem?: A Survey on Measuring Classification Complexity
Lorena, A. C., Garcia, L. P. F., Lehmann, J., Souto, M. C. P., & Ho, T. K. (2020) · ACM Computing Surveys · doi:10.1145/3347711 · Cited by 275
Multi-label feature selection based on max-dependency and min-redundancy
Lin, Y., Hu, Q., Liu, J., & Duan, J. (2015) · Neurocomputing · doi:10.1016/j.neucom.2015.06.010 · Cited by 255
Self-citation
Metadata
- Authors
- Hu, Q., Pedrycz, W., Yu, D., & Lang, J.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)
- Published
- 2010-02
- Volume
- 40
- Issue
- 1
- Pages
- 137-150
- ISSN
- 1083-4419 (ISSN-L)
- OpenAlex
- W2110183025
- Cited by
- 265
- References
- 51
- FWCI
- 9.01
- 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: Selecting Discrete and Continuous Features Based on Neighborhood Decision Error Minimization. https://app.cochat.ai/papers/10.1109/tsmcb.2009.2024166
- The paper
- Hu, Q., Pedrycz, W., Yu, D., & Lang, J. (2010). Selecting Discrete and Continuous Features Based on Neighborhood Decision Error Minimization. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics). https://doi.org/10.1109/tsmcb.2009.2024166
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.