The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Dimensionality reduction using genetic algorithms
Open accessAbstract
Pattern recognition generally requires that objects be described in terms of a set of measurable features. The selection and quality of the features representing each pattern affect the success of subsequent classification. Feature extraction is the process of deriving new features from original features to reduce the cost of feature measurement, increase classifier efficiency, and allow higher accuracy. Many feature extraction techniques involve linear transformations of the original pattern vectors to new vectors of lower dimensionality. While this is useful for data visualization and classification efficiency, it does not necessarily reduce the number of features to be measured since each new feature may be a linear combination of all of the features in the original pattern vector. Here, we present a new approach to feature extraction in which feature selection and extraction and classifier training are performed simultaneously using a genetic algorithm. The genetic algorithm optimizes a feature weight vector used to scale the individual features in the original pattern vectors. A masking vector is also employed for simultaneous selection of a feature subset. We employ this technique in combination with the k nearest neighbor classification rule, and compare the results with classical feature selection and extraction techniques, including sequential floating forward feature selection, and linear discriminant analysis. We also present results for the identification of favorable water-binding sites on protein surfaces.
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Bootstrap methods: another look at the jackknife
Efron, B. (1979) · The Annals of Statistics · doi:10.1214/aos/1176344552 · Cited by 17,602
Nearest neighbor pattern classification
Cover, T., & Hart, P. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053964 · Cited by 16,936
THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS
FISHER, R. A. (1936) · Annals of Eugenics · doi:10.1111/j.1469-1809.1936.tb02137.x · Cited by 15,227
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
On Estimation of a Probability Density Function and Mode
Parzen, E. (1962) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177704472 · Cited by 10,585
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Cited by
A GA-based feature selection and parameters optimizationfor support vector machines
Huang, C.-L., & Wang, C.-J. (2006) · Expert Systems with Applications · doi:10.1016/j.eswa.2005.09.024 · Cited by 1,363
Normalized Mutual Information Feature Selection
Estevez, P. A., Tesmer, M., Perez, C. A., & Zurada, J. M. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2008.2005601 · Cited by 1,288
A Survey of Dimension Reduction Techniques
Fodor, I. K. (2002) · doi:10.2172/15002155 · Cited by 1,116
Clustering ensembles: models of consensus and weak partitions
Topchy, A., Jain, A. K., & Punch, W. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.237 · Cited by 675
Self-citationImproved binary PSO for feature selection using gene expression data
Chuang, L.-Y., Chang, H.-W., Tu, C.-J., & Yang, C.-H. (2008) · Computational Biology and Chemistry · doi:10.1016/j.compbiolchem.2007.09.005 · Cited by 596
Markov blanket-embedded genetic algorithm for gene selection
Zhu, Z., Ong, Y.-S., & Dash, M. (2007) · Pattern Recognition · doi:10.1016/j.patcog.2007.02.007 · Cited by 494
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
Unler, A., & Murat, A. (2010) · European Journal of Operational Research · doi:10.1016/j.ejor.2010.02.032 · Cited by 437
Text feature selection using ant colony optimization
Aghdam, M. H., Ghasem-Aghaee, N., & Basiri, M. E. (2009) · Expert Systems with Applications · doi:10.1016/j.eswa.2008.08.022 · Cited by 389
A Mixture Model for Clustering Ensembles
Topchy, A., Jain, A. K., & Punch, W. (2004) · Proceedings of the 2004 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.35 · Cited by 384
Self-citationImproved salp swarm algorithm based on particle swarm optimization for feature selection
Ibrahim, R. A., Ewees, A. A., Oliva, D., Abd Elaziz, M., & Lu, S. (2019) · Journal of Ambient Intelligence and Humanized Computing · doi:10.1007/s12652-018-1031-9 · Cited by 374
Feature selection for support vector machines by means of genetic algorithm
Frohlich, H., Chapelle, O., & Scholkopf, B. (2004) · Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence · doi:10.1109/tai.2003.1250182 · Cited by 339
Feature selection methods for big data bioinformatics: A survey from the search perspective
Wang, L., Wang, Y., & Chang, Q. (2016) · Methods · doi:10.1016/j.ymeth.2016.08.014 · Cited by 331
Pareto front feature selection based on artificial bee colony optimization
Hancer, E., Xue, B., Zhang, M., Karaboga, D., & Akay, B. (2018) · Information Sciences · doi:10.1016/j.ins.2017.09.028 · Cited by 325
Unler, A., Murat, A., & Chinnam, R. B. (2011) · Information Sciences · doi:10.1016/j.ins.2010.05.037 · Cited by 319
Li, Q., Chen, H., Huang, H., Zhao, X., Cai, Z., Tong, C., Liu, W., & Tian, X. (2017) · Computational and Mathematical Methods in Medicine · doi:10.1155/2017/9512741 · Cited by 285
Tensor Discriminative Locality Alignment for Hyperspectral Image Spectral–Spatial Feature Extraction
Zhang, L., Zhang, L., Tao, D., & Huang, X. (2013) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2012.2197860 · Cited by 285
Van, M., & Kang, H.-J. (2016) · Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science · doi:10.1177/0954406215573976 · Cited by 46
Metadata
- Authors
- Raymer, M. L., Punch, W. F., Goodman, E. D., Kuhn, L. A., & Jain, A. K.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2000-07
- Volume
- 4
- Issue
- 2
- Pages
- 164-171
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2135190479
- Cited by
- 840
- References
- 38
- FWCI
- 15.41
- 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.