The DOI matches its Crossref record; 104 of the 104 references it cites were found in a registry or an index.
A Survey of Multiobjective Evolutionary Algorithms for Data Mining: Part I
Abstract
The aim of any data mining technique is to build an efficient predictive or descriptive model of a large amount of data. Applications of evolutionary algorithms have been found to be particularly useful for automatic processing of large quantities of raw noisy data for optimal parameter setting and to discover significant and meaningful information. Many real-life data mining problems involve multiple conflicting measures of performance, or objectives, which need to be optimized simultaneously. Under this context, multiobjective evolutionary algorithms are gradually finding more and more applications in the domain of data mining since the beginning of the last decade. In this two-part paper, we have made a comprehensive survey on the recent developments of multiobjective evolutionary algorithms for data mining problems. In this paper, Part I, some basic concepts related to multiobjective optimization and data mining are provided. Subsequently, various multiobjective evolutionary approaches for two major data mining tasks, namely feature selection and classification, are surveyed. In Part II of this paper, we have surveyed different multiobjective evolutionary algorithms for clustering, association rule mining, and several other data mining tasks, and provided a general discussion on the scopes for future research in this domain.
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
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
Silhouettes: A graphical aid to the interpretation and validation of cluster analysis
Rousseeuw, P. J. (1987) · Journal of Computational and Applied Mathematics · doi:10.1016/0377-0427(87)90125-7 · Cited by 21,392
Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 17,326
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
Golub, T. R., Slonim, D. K., Tamayo, P., Huard, C., Gaasenbeek, M., Mesirov, J. P., Coller, H., Loh, M. L., Downing, J. R., Caligiuri, M. A., et al. (1999) · Science · doi:10.1126/science.286.5439.531 · Cited by 11,516
Fast Algorithms for Mining Association Rules in Large Databases
Agrawal, R., & Srikant, R. (1994) · Very Large Data Bases · Cited by 9,419
Cited by
Platemo: a matlab platform for evolutionary multi-objective optimization [educational forum]
Tian, Y., Cheng, R., Zhang, X., & Jin, Y. (2017) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2017.2742868 · Cited by 2,777
Particle Swarm Optimization: A Comprehensive Survey
Shami, T. M., El-Saleh, A. A., Alswaitti, M., Al-Tashi, Q., Summakieh, M. A., & Mirjalili, S. (2022) · IEEE Access · doi:10.1109/access.2022.3142859 · Cited by 1,584
“Typically, searching can start with no features, all features, or a random selection of a subset of features [173], [174], [175].”
Big IoT data analytics: Architecture, opportunities, and open research challenges
(2017) · IEEE Access · doi:10.1109/access.2017.2689040 · Cited by 980
Many-Objective Evolutionary Algorithms: A Survey
Li, B., Li, J., Tang, K., & Yao, X. (2015) · ACM Computing Surveys · doi:10.1145/2792984 · Cited by 815
Genetic algorithms: theory, genetic operators, solutions, and applications
Alhijawi, B., & Awajan, A. (2024) · Evolutionary Intelligence · doi:10.1007/s12065-023-00822-6 · Cited by 723
Precision agriculture using IoT data analytics and machine learning
Akhter, R., & Sofi, S. A. (2022) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2021.05.013 · Cited by 557
Data Mining for the Internet of Things: Literature Review and Challenges
Chen, F., Deng, P., Wan, J., Zhang, D., Vasilakos, A. V., & Rong, X. (2015) · International Journal of Distributed Sensor Networks · doi:10.1155/2015/431047 · Cited by 528
Cloud Computing Resource Scheduling and a Survey of Its Evolutionary Approaches
Zhan, Z.-H., Liu, X.-F., Gong, Y.-J., Zhang, J., Chung, H. S.-H., & Li, Y. (2015) · ACM Computing Surveys · doi:10.1145/2788397 · Cited by 482
A Comprehensive Review on Multi-objective Optimization Techniques: Past, Present and Future
Sharma, S., & Kumar, V. (2022) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-022-09778-9 · Cited by 455
A hybrid feature selection algorithm for gene expression data classification
Lu, H., Chen, J., Yan, K., Jin, Q., Xue, Y., & Gao, Z. (2017) · Neurocomputing · doi:10.1016/j.neucom.2016.07.080 · Cited by 354
Quality Evaluation of Solution Sets in Multiobjective Optimisation: A Survey
Li, M., & Yao, X. (2020) · ACM Computing Surveys · doi:10.1145/3300148 · Cited by 342
Hybrid clustering analysis using improved krill herd algorithm
Abualigah, L. M., Khader, A. T., & Hanandeh, E. S. (2018) · Applied Intelligence · doi:10.1007/s10489-018-1190-6 · Cited by 340
Testing vision-based control systems using learnable evolutionary algorithms
Abdessalem, R. B., Nejati, S., Briand, L. C., & Stifter, T. (2018) · Proceedings of the 40th International Conference on Software Engineering · doi:10.1145/3180155.3180160 · Cited by 262
Data-Driven Surrogate-Assisted Multiobjective Evolutionary Optimization of a Trauma System
Wang, H., Jin, Y., & Jansen, J. O. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2555315 · Cited by 261
A review on the self and dual interactions between machine learning and optimisation
Song, H., Triguero, I., & Özcan, E. (2019) · Progress in Artificial Intelligence · doi:10.1007/s13748-019-00185-z · Cited by 101
“In the past few years, a number of review papers have been published about the dual interactions [18,33,39], individual interactions [5,24,84,97,177] and the interactions that focused on a specific ML or optimisation algorithm [16, 56,58,79,117,118,125,189,193,197] between ML and optimisation.”
Background
Metadata
- Authors
- Mukhopadhyay, A., Maulik, U., Bandyopadhyay, S., & Coello, C. A. C.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2014-02
- Volume
- 18
- Issue
- 1
- Pages
- 4-19
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2061701011
- Cited by
- 421
- References
- 104
- FWCI
- 36.47
- 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
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.