{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T12:58:36Z","timestamp":1765976316780,"version":"build-2065373602"},"reference-count":28,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2019,12,25]],"date-time":"2019-12-25T00:00:00Z","timestamp":1577232000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>Clustering is widely used as an unsupervised learning algorithm. However, it is often necessary to manually enter the number of clusters, and the number of clusters has a great impact on the clustering effect. At present, researchers propose some algorithms to determine the number of clusters, but the results are not very good for determining the number of clusters of data sets with complex and scattered shapes. To solve these problems, this paper proposes using the Gaussian Kernel density estimation function to determine the maximum number of clusters, use the change of center point score to get the candidate set of center points, and further use the change of the minimum distance between center points to get the number of clusters. The experiment shows the validity and practicability of the proposed algorithm.<\/jats:p>","DOI":"10.3390\/info11010016","type":"journal-article","created":{"date-parts":[[2019,12,25]],"date-time":"2019-12-25T11:07:48Z","timestamp":1577272068000},"page":"16","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Fast Method for Estimating the Number of Clusters Based on Score and the Minimum Distance of the Center Point"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1897-6648","authenticated-orcid":false,"given":"Zhenzhen","family":"He","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology, Henan Polytechnic University, Jiaozuo 454003, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zongpu","family":"Jia","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Henan Polytechnic University, Jiaozuo 454003, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohong","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Henan Polytechnic University, Jiaozuo 454003, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,12,25]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","article-title":"Data clustering: 50 years beyond K-means","volume":"31","author":"Jain","year":"2010","journal-title":"Pattern Recognit. Lett."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"2647389","DOI":"10.1155\/2016\/2647389","article-title":"A self-adaptive fuzzy c-means algorithm for determining the optimal number of clusters","volume":"2016","author":"Ren","year":"2016","journal-title":"Comput. Intell. Neurosci."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Zhou, X., Miao, F., and Ma, H. (2018). Genetic algorithm with an improved initial population technique for automatic clustering of low-dimensional data. Information, 9.","DOI":"10.3390\/info9040101"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1492","DOI":"10.1126\/science.1242072","article-title":"Machine learning Clustering by fast search and find of density peaks","volume":"344","author":"Rodriguez","year":"2014","journal-title":"Science"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/j.patrec.2017.10.025","article-title":"Parameter-free Laplacian centrality peaks clustering","volume":"100","author":"Yang","year":"2017","journal-title":"Pattern Recognit. Lett."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.csda.2013.11.012","article-title":"A non-parametric method to estimate the number of clusters","volume":"73","author":"Fujita","year":"2014","journal-title":"Comput. Stat. Data Anal."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1650","DOI":"10.1109\/TPAMI.2002.1114856","article-title":"Performance evaluation of some clustering algorithms and validity indices","volume":"24","author":"Maulik","year":"2002","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1109\/34.85677","article-title":"A validity measure for fuzzy clustering","volume":"8","author":"Xie","year":"1991","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1109\/TPAMI.1979.4766909","article-title":"A cluster separation measure","volume":"2","author":"Davies","year":"1979","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"5392","DOI":"10.1109\/TSP.2018.2866385","article-title":"A Novel Bayesian Cluster Enumeration Criterion for Unsupervised Learning","volume":"66","author":"Teklehaymanot","year":"2017","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.ins.2018.07.034","article-title":"I-nice: A new approach for identifying the number of clusters and initial cluster centres","volume":"466","author":"Masud","year":"2018","journal-title":"Inf. Sci."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Wang, Y., Shi, Z., Guo, X., Liu, X., Zhu, E., and Yin, J. (2018, January 2\u20137). Deep embedding for determining the number of clusters. Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, New Orleans, LA, USA.","DOI":"10.1609\/aaai.v32i1.12150"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"15","DOI":"10.5430\/air.v7n1p15","article-title":"Estimating the number of clusters using diversity","volume":"7","author":"Kingrani","year":"2018","journal-title":"Artif. Intell. Res."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.asoc.2018.06.033","article-title":"A novel internal validity index based on the cluster centre and the nearest neighbour cluster","volume":"71","author":"Zhou","year":"2018","journal-title":"Appl. Soft Comput."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Li, X., Liang, W., Zhang, X., Qing, S., and Chang, P.C. (2019). A cluster validity evaluation method for dynamically determining the near-optimal number of clusters. Soft Comput.","DOI":"10.1007\/s00500-019-04449-7"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.eswa.2019.01.074","article-title":"Estimating the number of clusters in a dataset via consensus clustering","volume":"125","author":"Xanthopoulos","year":"2019","journal-title":"Expert Syst. Appl."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Khan, I., Luo, Z., Huang, J.Z., and Shahzad, W. (2019). Variable weighting in fuzzy k-means clustering to determine the number of clusters. IEEE Trans. Knowl. Data Eng.","DOI":"10.1109\/TKDE.2019.2911582"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1198\/016214503000000666","article-title":"Finding the number of clusters in a dataset: An information-theoretic approach","volume":"98","author":"Sugar","year":"2003","journal-title":"J. Am. Stat. Assoc."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.patrec.2017.01.016","article-title":"A highly scalable clustering scheme using boundary information","volume":"89","author":"Tong","year":"2017","journal-title":"Pattern Recognit. Lett."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"3007","DOI":"10.1109\/TNNLS.2016.2608001","article-title":"Method for determining the optimal number of clusters based on agglomerative hierarchical clustering","volume":"28","author":"Zhou","year":"2016","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.patrec.2018.09.003","article-title":"Fast automatic estimation of the number of clusters from the minimum inter-center distance for k-means clustering","volume":"116","author":"Gupta","year":"2018","journal-title":"Pattern Recognit. Lett."},{"key":"ref_22","unstructured":"Silverman, B.W. (1986). Density Estimation for Statistics and Data Analysis, Chapman and Hall."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/03610927408827101","article-title":"A dendrite method for cluster analysis","volume":"3","author":"Harabasz","year":"1974","journal-title":"Commun. Stat.-Theory Methods"},{"key":"ref_24","first-page":"143","article-title":"Mathematical models for systematics and taxonomy","volume":"Volume 3","author":"Bezdek","year":"1975","journal-title":"Proceedings of the 8th International Conference on Numerical"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1016\/0167-8655(96)00026-8","article-title":"Validating fuzzy partitions obtained through c-shells clustering","volume":"17","author":"Dave","year":"1996","journal-title":"Pattern Recognit. Lett."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1080\/01969727308546047","article-title":"Cluster validity with fuzzy sets","volume":"3","author":"Bezdek","year":"1973","journal-title":"J. Cybernet."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/j.patcog.2003.06.005","article-title":"Validity index for crisp and fuzzy clusters","volume":"37","author":"Pakhira","year":"2004","journal-title":"Pattern Recognit."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Zhao, Q., Xu, M., and Fr\u00e4nti, P. (2009). Sum-of-squares based cluster validity index and significance analysis. International Conference on Adaptive and Natural Computing Algorithms, Springer.","DOI":"10.1007\/978-3-642-04921-7_32"}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/11\/1\/16\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:45:41Z","timestamp":1760190341000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/11\/1\/16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,25]]},"references-count":28,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2020,1]]}},"alternative-id":["info11010016"],"URL":"https:\/\/doi.org\/10.3390\/info11010016","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2019,12,25]]}}}