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.
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
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.”
BackgroundMethodInfluentialZadeh, 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
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
Using mutual information for selecting features in supervised neural net learning
Battiti, R. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.298224 · Cited by 2,148
Efficient Feature Selection via Analysis of Relevance and Redundancy
Yu, L., & Liu, H. (2004) · doi:10.5555/1005332.1044700 · Cited by 1,983
The feature selection problem: traditional methods and a new algorithm
Kira, K., & Rendell, L. A. (1992) · National Conference on Artificial Intelligence · Cited by 1,897
Correlation-based Feature Selection for Discrete and Numeric Class Machine Learning
Hall, M. A. (2000) · Cited by 1,715
Unsupervised feature selection using feature similarity
Mitra, P., Murthy, C. A., & Pal, S. K. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.990133 · Cited by 1,460
Small sample size effects in statistical pattern recognition: Recommendations for practitioners
Raudys, S. J., & Jain, A. K. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.75512 · Cited by 1,384
Feature subset selection using a genetic algorithm
Yang, J., & Honavar, V. (1998) · IEEE Intelligent Systems · doi:10.1109/5254.671091 · Cited by 1,362
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
Neighborhood rough set based heterogeneous feature subset selection
Hu, Q., Yu, D., Liu, J., & Wu, C. (2008) · Information Sciences · doi:10.1016/j.ins.2008.05.024 · Cited by 1,085
Self-citationRelational 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
Discretization: An Enabling Technique
Liu, H., Hussain, F., Tan, C. L., & Dash, M. (2002) · Data Mining and Knowledge Discovery · doi:10.1023/a:1016304305535 · Cited by 981
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
Input feature selection by mutual information based on Parzen window
Kwak, N., & Choi, C.-H. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1114861 · Cited by 641
Feature extraction by non parametric mutual information maximization
Torkkola, K. (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944981 · Cited by 611
Caruana, R., & Freitag, D. (1994) · Machine Learning Proceedings 1994 · doi:10.1016/b978-1-55860-335-6.50012-x · Cited by 545
Learning Boolean concepts in the presence of many irrelevant features
Almuallim, H., & Dietterich, T. G. (1994) · Artificial Intelligence · doi:10.1016/0004-3702(94)90084-1 · Cited by 520
HU, Q., YU, D., & XIE, Z. (2008) · Expert Systems with Applications · doi:10.1016/j.eswa.2006.10.043 · Cited by 513
Self-citationRough sets: probabilistic versus deterministic approach
Pawlak, Z., Wong, S. K. M., & Ziarko, W. (1988) · International Journal of Man-Machine Studies · doi:10.1016/s0020-7373(88)80032-4 · Cited by 469
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-citationWrapper–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
Margin based feature selection - theory and algorithms
Gilad-Bachrach, R., Navot, A., & Tishby, N. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015352 · Cited by 414
LEARNING IN RELATIONAL DATABASES: A ROUGH SET APPROACH
Hu, X. T., & Cercone, N. J. (1995) · Computational Intelligence · doi:10.1111/j.1467-8640.1995.tb00035.x · Cited by 385
Feature extraction based on decision boundaries
Lee, C., & Landgrebe, D. A. (1993) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.206958 · Cited by 373
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
Iterative RELIEF for Feature Weighting: Algorithms, Theories, and Applications
Sun, Y. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1093 · Cited by 342
Ślȩzak, D. (2002) · Fundamenta Informaticae · doi:10.3233/fun-2002-533-409 · Cited by 272
Combined 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
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
(2000) · Applied Physics Letters · doi:10.1162/153244303322753742 · Cited by 121
Order Based Genetic Algorithms for the Search of Approximate Entropy Reducts
Ślȩzak, D., & Wróblewski, J. (2007) · Springer eBooks · doi:10.1007/3-540-39205-x_45 · Cited by 79
Multiresolution estimates of classification complexity
Singh, S. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1251146 · Cited by 70
Axiomatic approach to feature subset selection based on relevance
Wang, H., Bell, D., & Murtagh, F. D. (1999) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.754624 · Cited by 52
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 37
PRISM ? A novel framework for pattern recognition
Singh, S. (2003) · Pattern Analysis and Applications · doi:10.1007/s10044-002-0186-2 · Cited by 34
Neighborhood Detection for the Identification of Spatiotemporal Systems
Pan, Y. F., & Billings, S. A. (2008) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2008.918571 · Cited by 7
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
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.