The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Wrapper–Filter Feature Selection Algorithm Using a Memetic Framework
Open accessAbstract
This correspondence presents a novel hybrid wrapper and filter feature selection algorithm for a classification problem using a memetic framework. It incorporates a filter ranking method in the traditional genetic algorithm to improve classification performance and accelerate the search in identifying the core feature subsets. Particularly, the method adds or deletes a feature from a candidate feature subset based on the univariate feature ranking information. This empirical study on commonly used data sets from the University of California, Irvine repository and microarray data sets shows that the proposed method outperforms existing methods in terms of classification accuracy, number of selected features, and computational efficiency. Furthermore, we investigate several major issues of memetic algorithm (MA) to identify a good balance between local search and genetic search so as to maximize search quality and efficiency in the hybrid filter and wrapper MA.
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
(1992) · Cited by 23,431
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
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
Alon, U., Barkai, N., Notterman, D. A., Gish, K., Ybarra, S., Mack, D., & Levine, A. J. (1999) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.96.12.6745 · Cited by 4,167
Feature selection for classification
DASH, M., & LIU, H. (1997) · Intelligent Data Analysis · doi:10.1016/s1088-467x(97)00008-5 · Cited by 3,574
Self-citationTheoretical 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 5×
“Therefore, it makes good sense that features with high score in ReliefF are more likely to help 1NN identify the correct nearest neighbor, hence generating good classification accuracy.”
InfluentialKhan, J., Wei, J. S., Ringnér, M., Saal, L. H., Ladanyi, M., Westermann, F., Berthold, F., Schwab, M., Antonescu, C. R., Peterson, C., et al. (2001) · Nature Medicine · doi:10.1038/89044 · Cited by 2,644
Choosing Multiple Parameters for Support Vector Machines
Chapelle, O., Vapnik, V., Bousquet, O., & Mukherjee, S. (2002) · Machine Learning · doi:10.1023/a:1012450327387 · Cited by 2,206
Feature selection: evaluation, application, and small sample performance
Jain, A., & Zongker, D. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.574797 · Cited by 2,171
Feature subset selection using a genetic algorithm
Yang, J., & Honavar, V. (1998) · IEEE Intelligent Systems · doi:10.1109/5254.671091 · Cited by 1,362
Adaptive Selection Methods for Genetic Algorithms
Baker, J. E. (1985) · international conference on Genetic algorithms · Cited by 1,022
Chi2: feature selection and discretization of numeric attributes
Liu, H., & Setiono, R. (2002) · Proceedings of 7th IEEE International Conference on Tools with Artificial Intelligence · doi:10.1109/tai.1995.479783 · Cited by 933
Consistency-based search in feature selection
Dash, M., & Liu, H. (2003) · Artificial Intelligence · doi:10.1016/s0004-3702(03)00079-1 · Cited by 889
Self-citationDimensionality reduction using genetic algorithms
Raymer, M. L., Punch, W. F., Goodman, E. D., Kuhn, L. A., & Jain, A. K. (2000) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.850656 · Cited by 840
UCI Repository of Machine Learning Database
Newman, D. J. (1998) · Medical Entomology and Zoology · Cited by 824
Ishibuchi, H., Yoshida, T., & Murata, T. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.810752 · Cited by 773
Meta-Lamarckian Learning in Memetic Algorithms
Ong, Y. S., & Keane, A. J. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.819944 · Cited by 657
Self-citationLi, T., Zhang, C., & Ogihara, M. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth267 · Cited by 648
Li, L., Weinberg, C. R., Darden, T. A., & Pedersen, L. G. (2001) · Bioinformatics · doi:10.1093/bioinformatics/17.12.1131 · Cited by 638
Feature selection for high-dimensional genomic microarray data
Xing, E. P., Jordan, M. I., & Karp, R. M. (2001) · Cited by 635
Classification of adaptive memetic algorithms: a comparative study
Ong, Y.-S., Lim, M.-H., Zhu, N., & Wong, K.-W. (2006) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2005.856143 · Cited by 514
Self-citationON AUTOMATIC FEATURE SELECTION
SIEDLECKI, W., & SKLANSKY, J. (1988) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001488000145 · Cited by 392
Genetic algorithms applied to multi-class prediction for the analysis of gene expression data
Ooi, C. H., & Tan, P. (2003) · Bioinformatics · doi:10.1093/bioinformatics/19.1.37 · Cited by 257
Mao, K. (2004) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2002.805808 · Cited by 135
LS Bound based gene selection for DNA microarray data
Zhou, X., & Mao, K. (2004) · Computer applications in the biosciences · doi:10.1093/bioinformatics/bti216 · Cited by 85
Cited by
Particle swarm optimization for feature selection in classification: a multi-objective approach
Xue, B., Zhang, M., & Browne, W. N. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tsmcb.2012.2227469 · Cited by 1,282
Hybrid Whale Optimization Algorithm with simulated annealing for feature selection
Mafarja, M. M., & Mirjalili, S. (2017) · Neurocomputing · doi:10.1016/j.neucom.2017.04.053 · Cited by 1,148
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
Whale optimization approaches for wrapper feature selection
Mafarja, M., & Mirjalili, S. (2018) · Applied Soft Computing · doi:10.1016/j.asoc.2017.11.006 · Cited by 825
Xue, B., Zhang, M., & Browne, W. N. (2014) · Applied Soft Computing · doi:10.1016/j.asoc.2013.09.018 · Cited by 614
Metadata
- Authors
- Zhu, Z., Ong, Y.-S., & Dash, M.
- Venue
- IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics)
- Published
- 2007-02
- Volume
- 37
- Issue
- 1
- Pages
- 70-76
- ISSN
- 1083-4419 (ISSN-L)
- OpenAlex
- W2165885026
- Cited by
- 443
- References
- 26
- FWCI
- 28.37
- Type
- journal article
- Language
- en
- Open access
- green
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.