The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Heterogeneous Ensemble-Based Infill Criterion for Evolutionary Multiobjective Optimization of Expensive Problems
Abstract
Gaussian processes (GPs) are the most popular model used in surrogate-assisted evolutionary optimization of computationally expensive problems, mainly because GPs are able to measure the uncertainty of the estimated fitness values, based on which certain infill sampling criteria can be used to guide the search and update the surrogate model. However, the computation time for constructing GPs may become excessively long when the number of training samples increases, which makes it inappropriate to use them as surrogates in evolutionary optimization. To address this issue, this paper proposes to use ensembles as surrogates and infill criteria for model management in evolutionary optimization. A heterogeneous ensemble consisting of a least square support vector machine and two radial basis function networks is constructed to enhance the reliability of ensembles for uncertainty estimation. In addition to the original decision variables, a selected subset of the decision variables and a set of transformed variables are used as inputs of the heterogeneous ensemble to further promote the diversity of the ensemble. The proposed heterogeneous ensemble is compared with a GP and a homogeneous ensemble for infill sampling criteria in evolutionary multiobjective optimization. Experimental results demonstrate that the heterogeneous ensemble is competitive in performance compared with GPs and much more scalable in computational complexity to the increase in search dimension.
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
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
LIBSVM: A library for support vector machines
Chang, C.-C., & Lin, C.-J. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961199 · Cited by 40,918
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Zhang, Q., & Li, H. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.892759 · Cited by 10,069
Efficient Global Optimization of Expensive Black-Box Functions
Jones, D. R., Schonlau, M., & Welch, W. J. (1998) · Journal of Global Optimization · doi:10.1023/a:1008306431147 · Cited by 8,070
A survey on feature selection methods
Chandrashekar, G., & Sahin, F. (2014) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2013.11.024 · Cited by 5,189
Measuring and testing dependence by correlation of distances
Székely, G. J., Rizzo, M. L., & Bakirov, N. K. (2007) · The Annals of Statistics · doi:10.1214/009053607000000505 · Cited by 2,684
A review of feature selection methods on synthetic data
Bolón-Canedo, V., Sánchez-Maroño, N., & Alonso-Betanzos, A. (2013) · Knowledge and Information Systems · doi:10.1007/s10115-012-0487-8 · Cited by 830
Cited by
Data-Driven Evolutionary Optimization: An Overview and Case Studies
Jin, Y., Wang, H., Chugh, T., Guo, D., & Miettinen, K. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2869001 · Cited by 686
Self-citationRecent Advances in Bayesian Optimization
Wang, X., Jin, Y., Schmitt, S., & Olhofer, M. (2023) · ACM Computing Surveys · doi:10.1145/3582078 · Cited by 477
Self-citationA review of surrogate-assisted evolutionary algorithms for expensive optimization problems
He, C., Zhang, Y., Gong, D., & Ji, X. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.119495 · Cited by 272
Offline Data-Driven Evolutionary Optimization Using Selective Surrogate Ensembles
Wang, H., Jin, Y., Sun, C., & Doherty, J. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2834881 · Cited by 262
Self-citationA Kriging-Assisted Two-Archive Evolutionary Algorithm for Expensive Many-Objective Optimization
Song, Z., Wang, H., He, C., & Jin, Y. (2021) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2021.3073648 · Cited by 260
Self-citation
Metadata
- Authors
- Guo, D., Jin, Y., Ding, J., & Chai, T.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2019-03
- Volume
- 49
- Issue
- 3
- Pages
- 1012-1025
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2785988364
- Cited by
- 248
- References
- 8
- FWCI
- 12.25
- 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: Heterogeneous Ensemble-Based Infill Criterion for Evolutionary Multiobjective Optimization of Expensive Problems. https://app.cochat.ai/papers/10.1109/tcyb.2018.2794503
- The paper
- Guo, D., Jin, Y., Ding, J., & Chai, T. (2019). Heterogeneous Ensemble-Based Infill Criterion for Evolutionary Multiobjective Optimization of Expensive Problems. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2018.2794503
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.