The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Survey of Multiobjective Evolutionary Algorithms for Data Mining: Part II
Abstract
This paper is the second part of a two-part paper, which is a survey of multiobjective evolutionary algorithms for data mining problems. In Part I , multiobjective evolutionary algorithms used for feature selection and classification have been reviewed. In this part, different multiobjective evolutionary algorithms used for clustering, association rule mining, and other data mining tasks are surveyed. Moreover, a general discussion is provided along with scopes for future research in the domain of multiobjective evolutionary algorithms for data mining.
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
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
Davies, D. L., & Bouldin, D. W. (1979) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1979.4766909 · Cited by 9,145
Estimating the Number of Clusters in a Data Set Via the Gap Statistic
Tibshirani, R., Walther, G., & Hastie, T. (2001) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00293 · Cited by 6,205
Performance evaluation of some clustering algorithms and validity indices
Maulik, U., & Bandyopadhyay, S. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1114856 · Cited by 1,396 · cited 2×
“For the clustering problem, usually cluster validity indic es [67] are used as the objective functions.”
MethodSelf-citation
Cited by
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
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 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-citationHybrid 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
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
“the form of a non-dominated set [118], they have been used frequently to assist ensemble learning [34,35,61].”
BackgroundMethod
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
- 20-35
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W4235965783
- Cited by
- 164
- References
- 4
- FWCI
- 15.22
- 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.