The DOI matches its Crossref record; 60 of the 60 references it cites were found in a registry or an index.
An Evolutionary Approach to Multiobjective Clustering
Abstract
The framework of multiobjective optimization is used to tackle the unsupervised learning problem, data clustering, following a formulation first proposed in the statistics literature. The conceptual advantages of the multiobjective formulation are discussed and an evolutionary approach to the problem is developed. The resulting algorithm, multiobjective clustering with automatic k-determination, is compared with a number of well-established single-objective clustering algorithms, a modern ensemble technique, and two methods of model selection. The experiments demonstrate that the conceptual advantages of multiobjective clustering translate into practical and scalable performance benefits
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
(1967) · Cited by 23,719
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
(1996) · Cited by 20,179
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
Kohonen, T. (2001) · Springer Series in Information Sciences · doi:10.1007/978-3-642-56927-2 · Cited by 16,019
Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 14,918
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
Everitt, B. J., Landau, S., & Leese, M. (1974) · Cited by 9,168
Hubert, L., & Arabie, P. (1985) · Journal of Classification · doi:10.1007/bf01908075 · Cited by 8,219
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Russell, E. L., Chiang, L. H., & Braatz, R. D. (2000) · Advances in Industrial Control · doi:10.1007/978-1-4471-0409-4_3 · Cited by 7,862
Finding Groups in Data: An Introduction to Cluster Analysis
Kaufman, L., & Rousseeuw, P. J. (1990) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316801 · Cited by 7,344
Objective Criteria for the Evaluation of Clustering Methods
Rand, W. M. (1971) · Journal of the American Statistical Association · doi:10.1080/01621459.1971.10482356 · Cited by 6,566
Algorithms for clustering data
Flury, B. (1989) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(89)90033-5 · Cited by 6,432
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
Evolutionary Algorithms for Solving Multi-Objective Problems
(2007) · Genetic and Evolutionary Computation Series · doi:10.1007/978-0-387-36797-2 · Cited by 5,686
The EM Algorithm and Extensions
Kushary, D. (1998) · Technometrics · doi:10.1080/00401706.1998.10485534 · Cited by 5,417
Whitley, D. (1994) · Statistics and Computing · doi:10.1007/bf00175354 · Cited by 4,522
Ankerst, M. (1999) · doi:10.1145/304181.304187 · Cited by 3,982
Evolutionary Algorithms for Solving Multi-Objective Problems
Coello Coello, C. A., Van Veldhuizen, D. A., & Lamont, G. B. (2002) · Genetic Algorithms and Evolutionary Computation · doi:10.1007/978-1-4757-5184-0 · Cited by 2,663
On Clustering Validation Techniques
Halkidi, M., Batistakis, Y., & Vazirgiannis, M. (2001) · Journal of Intelligent Information Systems · doi:10.1023/a:1012801612483 · Cited by 2,646
Pattern Classification (2nd ed.)
Duda, R. O., Hart, P. E., & Stork, D. G. (1999) · Cited by 2,520
Uniform crossover in genetic algorithms
Syswerda, G. (1989) · international conference on Genetic algorithms · Cited by 1,965
Practical Nonparametric Statistics (2nd ed).
Groeneveld, R. A., & Conover, W. J. (1981) · Journal of the American Statistical Association · doi:10.2307/2287607 · Cited by 1,849
O’Regan, G. (2023) · Texts in Computer Science · doi:10.1007/978-3-031-26212-8_4 · Cited by 1,614
Practical Nonparametric Statistics.
Haigh, J., & Conover, W. J. (1981) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2981807 · Cited by 1,503
Genetic algorithm-based clustering technique
Maulik, U., & Bandyopadhyay, S. (2000) · Pattern Recognition · doi:10.1016/s0031-3203(99)00137-5 · Cited by 1,459
OPTICS: ordering points to identify the clustering structure
Ankerst, M., Breunig, M. M., Kriegel, H.-P., & Sander, J. (1999) · Proceedings of the 1999 ACM SIGMOD international conference on Management of data · doi:10.1145/304182.304187 · Cited by 1,335
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/153244303321897735 · Cited by 1,092
PESA-II: region-based selection in evolutionary multiobjective optimization
Corne, D., Jerram, N. R., Knowles, J. D., & Oates, M. J. (2001) · Cited by 1,011
Self-citationComputational cluster validation in post-genomic data analysis
Handl, J., Knowles, J., & Kell, D. B. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti517 · Cited by 898
Self-citationAn empirical comparison of four initialization methods for the K-Means algorithm
Peña, J. M., Lozano, J. A., & Larrañaga, P. (1999) · Pattern Recognition Letters · doi:10.1016/s0167-8655(99)00069-0 · Cited by 866
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
Genetic Algorithms and Grouping Problems
Falkenauer, E. (1998) · Cited by 674
Why so many clustering algorithms: a position paper
Estivill-Castro, V. (2002) · ACM SIGKDD Explorations Newsletter · doi:10.1145/568574.568575 · Cited by 600
Finding Knees in Multi-objective Optimization
Branke, J., Deb, K., Dierolf, H., & Osswald, M. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30217-9_73 · Cited by 569
(2002) · Cited by 542
Genetic Algorithms and grouping problems
Nicholson, M. (1998) · Software: Practice and Experience · doi:10.1002/(sici)1097-024x(199808)28:10<1137::aid-spe192>3.0.co;2-4 · Cited by 542
CLUSTERING VALIDATION: RESULTS AND IMPLICATIONS FOR APPLIED ANALYSES
MILLIGAN, G. W. (1996) · Clustering and Classification · doi:10.1142/9789812832153_0010 · Cited by 452
Clustering and Classification.
Arabie, P., Hubert, L. J., & de Soete, G. (1997) · Biometrics · doi:10.2307/2533584 · Cited by 412
Clustering with a genetically optimized approach
Hall, L. O., Ozyurt, I. B., & Bezdek, J. C. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.771164 · Cited by 409
A Mixture Model for Clustering Ensembles
Topchy, A., Jain, A. K., & Punch, W. (2004) · Proceedings of the 2004 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.35 · Cited by 384
On the performance assessment and comparison of stochastic multiobjective optimizers
Fonseca, C. M., & Fleming, P. J. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61723-x_1022 · Cited by 378
Arabie, P., Hubert, L. J., & De Soete, G. (1996) · WORLD SCIENTIFIC eBooks · doi:10.1142/1930 · Cited by 364
Evolutionary many-objective optimisation: Many once or one many?
Hughes, E. J. (2005) · 2005 IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2005.1554688 · Cited by 360
Sarle, W. S. (1983) · SAS Institute eBooks · Cited by 304
On characterizing the ?knee? of the Pareto curve based on Normal-Boundary Intersection
Das, I. (1999) · Structural Optimization · doi:10.1007/bf01195985 · Cited by 244
On characterizing the “knee” of the Pareto curve based on Normal-Boundary Intersection
Das, I. (1999) · Structural Optimization · doi:10.1007/s001580050111 · Cited by 209
Smart Pareto filter: obtaining a minimal representation of multiobjective design space
Mattson, C. A., Mullur, A. A., & Messac, A. (2004) · Engineering Optimization · doi:10.1080/0305215042000274942 · Cited by 157
Multi-objective Evolutionary Algorithms: Introducing Bias Among Pareto-optimal Solutions
Deb, K. (2003) · Natural computing series · doi:10.1007/978-3-642-18965-4_10 · Cited by 133
Ensembles of partitions via data resampling
Bidgoli, B. M., Topchy, A. P., & Punch, W. F. (2004) · International Conference on Information Technology: Coding and Computing (ITCC) · doi:10.1109/itcc.2004.1286629 · Cited by 132
Morita, M., Sabourin, R., Bortolozzi, F., & Suen, C. Y. (2005) · Proceedings of the International Conference on Document Analysis and Recognition · doi:10.1109/icdar.2003.1227746 · Cited by 113
Evolutionary model selection in unsupervised learning
Kim, Y., Street, W. N., & Menczer, F. (2002) · Intelligent Data Analysis · doi:10.3233/ida-2002-6605 · Cited by 109
K-nearest-neighbor consistency in data clustering
Ding, C. H. Q., & He, X. (2004) · ACM Symposium on Applied Computing · doi:10.1145/967900.968021 · Cited by 101
Direct multicriteria clustering algorithms
Ferligoj, A., & Batagelj, V. (1992) · Journal of Classification · doi:10.1007/bf02618467 · Cited by 90
Improvements to the scalability of multiobjective clustering
Handl, J., & Knowles, J. D. (2005) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2005.1554990 · Cited by 82
Self-citationPerformance trade-off analysis of analog circuits by normal-boundary intersection
Stehr, G., Graeb, H., & Antreich, K. J. (2003) · Proceedings - ACM IEEE Design Automation Conference · doi:10.1145/775832.776073 · Cited by 66
Multiobjective clustering around medoids
Handl, J., & Knowles, J. D. (2005) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2005.1554742 · Cited by 53
Self-citationGene discovery using Pareto depth sampling distributions
Fleury, G. A., Hero, A. O., Zareparsi, S., & Swaroop, A. (2004) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2003.12.007 · Cited by 11
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
Multiobjective evolutionary algorithms: A survey of the state of the art
Zhou, A., Qu, B.-Y., Li, H., Zhao, S.-Z., Suganthan, P. N., & Zhang, Q. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.03.001 · Cited by 2,255
A review of clustering techniques and developments
Saxena, A., Prasad, M., Gupta, A., Bharill, N., Patel, O. P., Tiwari, A., Er, M. J., Ding, W., & Lin, C.-T. (2017) · Neurocomputing · doi:10.1016/j.neucom.2017.06.053 · Cited by 1,357
Ezugwu, A. E., Ikotun, A. M., Oyelade, O. O., Abualigah, L., Agushaka, J. O., Eke, C. I., & Akinyelu, A. A. (2022) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2022.104743 · Cited by 924
Statistical strategies for avoiding false discoveries in metabolomics and related experiments
Broadhurst, D. I., & Kell, D. B. (2007) · Metabolomics · doi:10.1007/s11306-006-0037-z · Cited by 817
Metadata
- Authors
- Handl, J., & Knowles, J.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2007-02
- Volume
- 11
- Issue
- 1
- Pages
- 56-76
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2108031918
- Cited by
- 717
- References
- 60
- FWCI
- 46.10
- 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.