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.
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
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
The protein data bank: A computer-based archival file for macromolecular structures
Bernstein, F. C., Koetzle, T. F., Williams, G. J. B., Meyer, E. F., Brice, M. D., Rodgers, J. R., Kennard, O., Shimanouchi, T., & Tasumi, M. (1977) · Journal of Molecular Biology · doi:10.1016/s0022-2836(77)80200-3 · Cited by 8,578
The Jackknife, the Bootstrap and Other Resampling Plans
Efron, B. (1982) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970319 · Cited by 8,120
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
Quinlan, J. R. (1987) · International Journal of Man-Machine Studies · doi:10.1016/s0020-7373(87)80053-6 · Cited by 2,553
UCI Repository of Machine Learning Databases
Merz, C. J. (1996) · Medical Entomology and Zoology · Cited by 2,363
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
Self-citationPattern Classification and Scene Analysis.
Grenander, U., Duda, R. O., & Hart, P. E. (1974) · Journal of the American Statistical Association · doi:10.2307/2286028 · Cited by 1,006
A note on genetic algorithms for large-scale feature selection
Siedlecki, W., & Sklansky, J. (1989) · Pattern Recognition Letters · doi:10.1016/0167-8655(89)90037-8 · Cited by 806
A NOTE ON GENETIC ALGORITHMS FOR LARGE-SCALE FEATURE SELECTION
SIEDLECKI, W., & SKLANSKY, J. (1993) · Handbook of Pattern Recognition and Computer Vision · doi:10.1142/9789814343138_0005 · Cited by 765
Abola, E. E., Bernstein, F. C., & Koetzle, T. F. (1984) · Neutrons in Biology · doi:10.1007/978-1-4899-0375-4_26 · Cited by 735
Artificial neural networks for feature extraction and multivariate data projection
Mao, J., & Jain, A. K. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.363467 · Cited by 658
Self-citation39 Dimensionality and sample size considerations in pattern recognition practice
Jain, A. K., & Chandrasekaran, B. (1982) · Handbook of Statistics · doi:10.1016/s0169-7161(82)02042-2 · Cited by 560
Self-citationWeiss, S. M., & Kapouleas, I. (1989) · International Joint Conference on Artificial Intelligence · Cited by 506
Evolutionary Computation: The Fossil Record
Fogel, D. B. (1998) · CERN Document Server (European Organization for Nuclear Research) · Cited by 489
Simulation of Genetic Systems by Automatic Digital Computers I. Introduction
Fraser, A. (1957) · Australian Journal of Biological Sciences · doi:10.1071/bi9570484 · Cited by 452
Comparative study of techniques for large-scale feature selection
(1994) · Machine Intelligence and Pattern Recognition · doi:10.1016/b978-0-444-81892-8.50040-7 · Cited by 307
Evolutionary Computation: Toward a New Philosophy of Machine Intelligence
Fogel, D. B. (2005) · Wiley eBooks · doi:10.1002/0471749214 · Cited by 302
Adaptive fuzzy rule-based classification systems
Nozaki, K., Ishibuchi, H., & Tanaka, H. (1996) · IEEE Transactions on Fuzzy Systems · doi:10.1109/91.531768 · Cited by 267
Further Research on Feature Selection and Classification Using Genetic Algorithms
Punch, W. F., Goodman, E. D., Pei, M., Chia-Shun, L., Hovland, P., & Enbody, R. J. (1993) · Cited by 242
Self-citationBootstrap Techniques for Error Estimation
Jain, A. K., Dubes, R. C., & Chen, C.-C. (1987) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1987.4767957 · Cited by 205
Self-citationInductive knowledge acquisition: a case study
Quinlan, J. R., Compton, P., Horn, K., & Lazarus, L. (1987) · Cited by 201
Raymer, M. L., Sanschagrin, P. C., Punch, W. F., Venkataraman, S., Goodman, E. D., & Kuhn, L. A. (1997) · Journal of Molecular Biology · doi:10.1006/jmbi.1996.0746 · Cited by 163
Self-citationSimulation of biological evolution and machine learning
Reed, J., Toombs, R., & Barricelli, N. A. (1967) · Journal of Theoretical Biology · doi:10.1016/0022-5193(67)90097-5 · Cited by 154
Decision boundary feature extraction for neural networks
Lee, C., & Landgrebe, D. A. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.554193 · Cited by 141
Hybridizing the Genetic Algorithm and the K Nearest Neighbors Classification Algorithm.
Kelly, J. D., & Davis, L. D. (1991) · ICGA · Cited by 133
The role of structure in antibody cross-reactivity between peptides and folded proteins
Craig, L., Sanschagrin, P. C., Rozek, A., Lackie, S. J., Kuhn, L. A., & Scott, J. K. (1998) · Journal of Molecular Biology · doi:10.1006/jmbi.1998.1907 · Cited by 90
Self-citationAtomic and residue hydrophilicity in the context of folded protein structures
Kuhn, L. A., Swanson, C. A., Pique, M. E., Tainer, J. A., & Getzoff, E. D. (1995) · Proteins Structure Function and Bioinformatics · doi:10.1002/prot.340230408 · Cited by 81
Self-citationParsimonious network design and feature selection through node pruning
Mao, J., Mohiuddin, K., & Jain, A. K. (2002) · IAPR International Conference on Pattern Recognition (ICPR) · doi:10.1109/icpr.1994.577060 · Cited by 53
Self-citation
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
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.