The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Multiobjective GAs, Quantitative Indices, and Pattern Classification
Abstract
The concept of multiobjective optimization (MOO) has been integrated with variable length chromosomes for the development of a nonparametric genetic classifier which can overcome the problems, like overfitting/overlearning and ignoring smaller classes, as faced by single objective classifiers. The classifier can efficiently approximate any kind of linear and/or nonlinear class boundaries of a data set using an appropriate number of hyperplanes. While designing the classifier the aim is to simultaneously minimize the number of misclassified training points and the number of hyperplanes, and to maximize the product of class wise recognition scores. The concepts of validation set (in addition to training and test sets) and validation functional are introduced in the multiobjective classifier for selecting a solution from a set of nondominated solutions provided by the MOO algorithm. This genetic classifier incorporates elitism and some domain specific constraints in the search process, and is called the CEMOGA-Classifier (constrained elitist multiobjective genetic algorithm based classifier). Two new quantitative indices, namely, the purity and minimal spacing, are developed for evaluating the performance of different MOO techniques. These are used, along with classification accuracy, required number of hyperplanes and the computation time, to compare the CEMOGA-Classifier with other related ones.
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 for generation of class boundaries
Pal, S. K., Bandyopadhyay, S., & Murthy, C. A. (1998) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.735391 · Cited by 75
Self-citation
Cited by
A Simulated Annealing-Based Multiobjective Optimization Algorithm: AMOSA
Bandyopadhyay, S., Saha, S., Maulik, U., & Deb, K. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.900837 · Cited by 852
Self-citationMulti-Objective Particle Swarm Optimization with time variant inertia and acceleration coefficients
Tripathi, P. K., Bandyopadhyay, S., & Pal, S. K. (2007) · Information Sciences · doi:10.1016/j.ins.2007.06.018 · Cited by 518
Self-citationA Survey of Multiobjective Evolutionary Algorithms for Data Mining: Part I
Mukhopadhyay, A., Maulik, U., Bandyopadhyay, S., & Coello, C. A. C. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2290086 · Cited by 421
Self-citationDirect Multisearch for Multiobjective Optimization
Custódio, A. L., Madeira, J. F. A., Vaz, A. I. F., & Vicente, L. N. (2011) · SIAM Journal on Optimization · doi:10.1137/10079731x · Cited by 392
A Multiobjective Genetic Algorithm to Find Communities in Complex Networks
Pizzuti, C. (2012) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2161090 · Cited by 346
Metadata
- Authors
- Bandyopadhyay, S., Pal, S. K., & Aruna, B.
- Venue
- IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics)
- Published
- 2004-10
- Volume
- 34
- Issue
- 5
- Pages
- 2088-2099
- ISSN
- 1083-4419 (ISSN-L)
- OpenAlex
- W2120482366
- Cited by
- 209
- References
- 1
- FWCI
- 2.38
- 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: Multiobjective GAs, Quantitative Indices, and Pattern Classification. https://app.cochat.ai/papers/10.1109/tsmcb.2004.834438
- The paper
- Bandyopadhyay, S., Pal, S. K., & Aruna, B. (2004). Multiobjective GAs, Quantitative Indices, and Pattern Classification. IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics). https://doi.org/10.1109/tsmcb.2004.834438
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.