{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:08:24Z","timestamp":1760234904678,"version":"build-2065373602"},"reference-count":33,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>In the conventional k-means framework, seeding is the first step toward optimization before the objects are clustered. In random seeding, two main issues arise: the clustering results may be less than optimal and different clustering results may be obtained for every run. In real-world applications, optimal and stable clustering is highly desirable. This report introduces a new clustering algorithm called the zero k-approximate modal haplotype (Zk-AMH) algorithm that uses a simple and novel seeding mechanism known as zero-point multidimensional spaces. The Zk-AMH provides cluster optimality and stability, therefore resolving the aforementioned issues. Notably, the Zk-AMH algorithm yielded identical mean scores to maximum, and minimum scores in 100 runs, producing zero standard deviation to show its stability. Additionally, when the Zk-AMH algorithm was applied to eight datasets, it achieved the highest mean scores for four datasets, produced an approximately equal score for one dataset, and yielded marginally lower scores for the other three datasets. With its optimality and stability, the Zk-AMH algorithm could be a suitable alternative for developing future clustering tools.<\/jats:p>","DOI":"10.3390\/a14070197","type":"journal-article","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T10:52:46Z","timestamp":1624963966000},"page":"197","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Optimal and Stable Algorithm for Clustering Numerical Data"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2630-2800","authenticated-orcid":false,"given":"Ali","family":"Seman","sequence":"first","affiliation":[{"name":"Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA (UiTM), Shah Alam 40450, Malaysia"}]},{"given":"Azizian","family":"Mohd Sapawi","sequence":"additional","affiliation":[{"name":"Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA (UiTM), Shah Alam 40450, Malaysia"}]}],"member":"1968","published-online":{"date-parts":[[2021,6,29]]},"reference":[{"key":"ref_1","unstructured":"Jain, A.K., and Dubes, R.C. (1988). Algorithm for Clustering Data, Prentice Hall Inc."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Gan, G., Ma, C., and Wu, J. (2007). Data Clustering: Theory, Algorithms, and Applications, Society for Industrial and Applied Mathematics.","DOI":"10.1137\/1.9780898718348"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","article-title":"Data clustering: A review","volume":"31","author":"Jain","year":"1999","journal-title":"ACM Comput. Surv."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Kaufman, L., and Rousseeuw, P.J. (1990). Finding Groups in Data: An Introduction to Cluster Analysis, Wiley and Sons.","DOI":"10.1002\/9780470316801"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Xu, R., and Wunsch, D. (2009). Clustering, John Wiley and Sons.","DOI":"10.1002\/9780470382776"},{"key":"ref_6","unstructured":"Tan, T., Steinbach, M., and Kumar, V. (2006). Introduction to Data Mining, Pearson Education, Inc."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Everitt, B., Landau, S., and Leese, M. (2001). Cluster Analysis, Arnold.","DOI":"10.1002\/9781118887486.ch6"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Fielding, H. (2007). Cluster and Classification Techniques for Biosciences, Cambridge University Press.","DOI":"10.1017\/CBO9780511607493"},{"key":"ref_9","unstructured":"Han, J., and Kamber, M. (2001). Data Mining: Concepts and Techniques, Morgan Kaufmann Publishers Inc."},{"key":"ref_10","unstructured":"MacQueen, J.B. (1967). Some methods for classification and analysis of multivariate observations. 5th Berkeley Symposium on Mathematical Statistics and Probability, University of California Press."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Bezdek, J.C. (1981). Pattern Recognition with Fuzzy Objective Function Algorithms, Plenum.","DOI":"10.1007\/978-1-4757-0450-1"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1023\/A:1009769707641","article-title":"Extensions to the k-means algorithm for clustering large data sets with categorical values","volume":"2","author":"Huang","year":"1998","journal-title":"Data Min. Knowl. Discov."},{"key":"ref_13","first-page":"46","article-title":"A fuzzy k-modes algorithm for clustering categorical data","volume":"7","author":"Huang","year":"1999","journal-title":"IEEE Trans. Fuzzy Syst."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/978-3-030-00084-4_27","article-title":"Cluster Analysis: An Application to a Real Mixed-Type Data set","volume":"Volume 179","author":"Flaut","year":"2019","journal-title":"Models and Theories in Social Systems. Studies in Systems, Decision and Control"},{"key":"ref_15","first-page":"111","article-title":"New approach for finding number of clusters usingdistance based k-means algorithm","volume":"8","author":"Alibuhtto","year":"2019","journal-title":"Int. J. Eng. Sci. Math."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"105763","DOI":"10.1016\/j.asoc.2019.105763","article-title":"Improving k-means clustering with enhanced firefly","volume":"84","author":"Xie","year":"2019","journal-title":"Algorithms Appl. Soft Comput."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/1756-0500-5-557","article-title":"An efficient clustering algorithm for partitioning y-short tandem repeats data","volume":"5","author":"Seman","year":"2012","journal-title":"BMC Res. Notes"},{"key":"ref_18","unstructured":"Arthur, D., and Vassilvitskii, S. (2007, January 7\u20139). k-means++: The advantages of careful seeding. Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, USA."},{"key":"ref_19","unstructured":"Cao, B., Zhang, C., and Li, T. (2009). An New Initialization Method for Fuzzy c-Means Algorithm Based on Density. Fuzzy Information and Engineering. Advances in Soft Computing, Springer."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"7541","DOI":"10.1016\/j.eswa.2015.05.014","article-title":"Fuzzy c-means++: Fuzzy c-means with effective seeding initialization","volume":"42","author":"Stetco","year":"2015","journal-title":"Expert Syst. Appl."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1279","DOI":"10.1109\/21.299710","article-title":"Approximate clustering via the mountain method","volume":"24","author":"Ronald","year":"1994","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"267","DOI":"10.3233\/IFS-1994-2306","article-title":"Fuzzy model identification based on cluster estimation","volume":"2","author":"Chiu","year":"1994","journal-title":"J. Intell. Fuzzy Syst."},{"key":"ref_23","first-page":"320","article-title":"An initialization method of cluster centers","volume":"21","author":"Pei","year":"1999","journal-title":"J. Electron. Sci."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"106290","DOI":"10.1016\/j.cie.2020.106290","article-title":"Development of new seed with modified validity measures for k-means clustering","volume":"141","author":"Manochandar","year":"2020","journal-title":"Comput. Ind. Eng."},{"key":"ref_25","first-page":"3650926","article-title":"A robust k-means clustering algorithm based on observation point mechanism","volume":"2020","author":"Zhang","year":"2020","journal-title":"Hindawi Complex."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.patcog.2019.04.014","article-title":"How much can k-means be improved by using better initialization and repeats?","volume":"93","author":"Sieranoja","year":"2019","journal-title":"Pattern Recognit."},{"key":"ref_27","first-page":"587","article-title":"Extensions to the k-amh algorithm for numerical clustering","volume":"17","author":"Seman","year":"2018","journal-title":"J. ICT"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1089\/omi.2014.0136","article-title":"Towards development of clustering applications for large-scale comparative genotyping and kinship analysis using y-short tandem repeats","volume":"19","author":"Seman","year":"2015","journal-title":"OMICS"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Vasant, P., Zelinka, I., and Weber, G.W. (2020). Complementary Optimization Procedure for Final Cluster Analysis of Clustering Categorical Data. Advances in Intelligent Systems and Computing, Springer.","DOI":"10.1007\/978-3-030-33585-4"},{"key":"ref_30","first-page":"235","article-title":"Clustering stability: An overview","volume":"2","year":"2010","journal-title":"Found. Trends Mach. Learn."},{"key":"ref_31","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_32","unstructured":"Merz, J., and Murphy, P.M. (1996). UCI Machine Learning Repository, School of Information and Computer Science, University of California."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1080\/01621459.1983.10478008","article-title":"A method for comparing two hierarchical clusterings","volume":"78","author":"Fowlkes","year":"1983","journal-title":"J. Am. Stat. Assoc."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/7\/197\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T06:26:46Z","timestamp":1760164006000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/7\/197"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,29]]},"references-count":33,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2021,7]]}},"alternative-id":["a14070197"],"URL":"https:\/\/doi.org\/10.3390\/a14070197","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2021,6,29]]}}}