The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Agglomerative Fuzzy K-Means Clustering Algorithm with Selection of Number of Clusters
Abstract
In this paper, we present an agglomerative fuzzy $k$-means clustering algorithm for numerical data, an extension to the standard fuzzy $k$-means algorithm by introducing a penalty term to the objective function to make the clustering process not sensitive to the initial cluster centers. The new algorithm can produce more consistent clustering results from different sets of initial clusters centers. Combined with cluster validation techniques, the new algorithm can determine the number of clusters in a data set, which is a well known problem in $k$-means clustering. Experimental results on synthetic data sets (2 to 5 dimensions, 500 to 5000 objects and 3 to 7 clusters), the BIRCH two-dimensional data set of 20000 objects and 100 clusters, and the WINE data set of 178 objects, 17 dimensions and 3 clusters from UCI, have demonstrated the effectiveness of the new algorithm in producing consistent clustering results and determining the correct number of clusters in different data sets, some with overlapping inherent clusters.
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 new look at the statistical model identification
Akaike, H. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100705 · Cited by 51,879
Estimating the Dimension of a Model
Schwarz, G. (1978) · The Annals of Statistics · doi:10.1214/aos/1176344136 · Cited by 47,033
(1967) · Cited by 23,719
McLachlan, G., & Peel, D. (2000) · Wiley Series in Probability and Statistics · doi:10.1002/0471721182 · Cited by 10,991
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
(2007) · doi:10.5555/1283383.1283494 · Cited by 7,364
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
Cluster Analysis for Applications
(1973) · Elsevier eBooks · doi:10.1016/c2013-0-06161-0 · Cited by 5,080
An Examination of Procedures for Determining the Number of Clusters in a Data Set
Milligan, G. W., & Cooper, M. C. (1985) · Psychometrika · doi:10.1007/bf02294245 · Cited by 3,868
On cluster validity for the fuzzy c-means model
Pal, N. R., & Bezdek, J. C. (1995) · IEEE Transactions on Fuzzy Systems · doi:10.1109/91.413225 · Cited by 1,850
Krishna, K., & Narasimha Murty, M. (1999) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.764879 · Cited by 1,717
Unsupervised optimal fuzzy clustering
Gath, I., & Geva, A. B. (1989) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.192473 · Cited by 1,640
A Convergence Theorem for the Fuzzy ISODATA Clustering Algorithms
Bezdek, J. C. (1980) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1980.4766964 · Cited by 980
Fuzzy Cluster Analysis: Methods for Classification, Data Analysis and Image Recognition
Rayward-Smith, V. J., Höppner, F., Klawonn, F., Kruse, R., & Runkler, T. A. (2000) · Journal of the Operational Research Society · doi:10.2307/254022 · Cited by 922
A clustering technique for summarizing multivariate data
Ball, G. H., & Hall, D. J. (1967) · Behavioral Science · doi:10.1002/bs.3830120210 · Cited by 912
BIRCH: A New Data Clustering Algorithm and Its Applications
Zhang, T., Ramakrishnan, R., & Livny, M. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009783824328 · Cited by 888
Hamerly, G., & Elkan, C. (2003) · Cited by 841
Alternatives to the k-means algorithm that find better clusterings
Hamerly, G., & Elkan, C. (2002) · Proceedings of the eleventh international conference on Information and knowledge management · doi:10.1145/584792.584890 · Cited by 426
Consistent Estimation of a Mixing Distribution
Leroux, B. G. (1992) · The Annals of Statistics · doi:10.1214/aos/1176348772 · Cited by 413
Model selection for probabilistic clustering using cross-validated likelihood
Smyth, P. (2000) · Statistics and Computing · doi:10.1023/a:1008940618127 · Cited by 285
Bozdogan, H. (1993) · Studies in Classification, Data Analysis and Knowledge Organization · doi:10.1007/978-3-642-50974-2_5 · Cited by 186
A genetic algorithm that exchanges neighboring centers for k-means clustering
Laszlo, M. J., & Mukherjee, S. (2007) · Pattern Recognition Letters · doi:10.1016/j.patrec.2007.08.006 · Cited by 146
A genetic algorithm using hyper-quadtrees for low-dimensional k-means clustering
Laszlo, M. J., & Mukherjee, S. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.66 · Cited by 112
Information Ratios for Validating Mixture Analyses
Windham, M. P., & Cutler, A. (1992) · Journal of the American Statistical Association · doi:10.1080/01621459.1992.10476277 · Cited by 106
Cheung, Y. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.97 · Cited by 96
Self-citationCluster number selection for a small set of samples using the Bayesian Ying-Yang model
Guo, P., Chen, C. L. P., & Lyu, M. R.-T. (2002) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2002.1000144 · Cited by 78
Rival penalized competitive learning, finite mixture, and multisets clustering
Xu, L. (2002) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1998.687259 · Cited by 56
Xu, L. (2002) · IEEE International Conference on Neural Networks/IEEE ... International Conference on Neural Networks · doi:10.1109/icnn.1996.549130 · Cited by 42
Bootstrapping Likelihood for Model Selection with Small Samples
Pan, W. (1999) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.1999.10474843 · Cited by 39
Cited by
A survey on nature inspired metaheuristic algorithms for partitional clustering
Nanda, S. J., & Panda, G. (2014) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2013.11.003 · Cited by 574
Feature selection with multi-view data: A survey
Zhang, R., Nie, F., Li, X., & Wei, X. (2019) · Information Fusion · doi:10.1016/j.inffus.2018.11.019 · Cited by 313
Metadata
- Authors
- Li, M. J., Ng, M. K., Cheung, Y.-M., & Huang, J. Z.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2008-11
- Volume
- 20
- Issue
- 11
- Pages
- 1519-1534
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2121197635
- Cited by
- 281
- References
- 30
- FWCI
- 14.31
- 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.