{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T19:12:12Z","timestamp":1774379532220,"version":"3.50.1"},"reference-count":36,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2019,8,24]],"date-time":"2019-08-24T00:00:00Z","timestamp":1566604800000},"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>A simple and fast k-medoids algorithm that updates medoids by minimizing the total distance within clusters has been developed. Although it is simple and fast, as its name suggests, it nonetheless has neglected local optima and empty clusters that may arise. With the distance as an input to the algorithm, a generalized distance function is developed to increase the variation of the distances, especially for a mixed variable dataset. The variation of the distances is a crucial part of a partitioning algorithm due to different distances producing different outcomes. The experimental results of the simple k-medoids algorithm produce consistently good performances in various settings of mixed variable data. It also has a high cluster accuracy compared to other distance-based partitioning algorithms for mixed variable data.<\/jats:p>","DOI":"10.3390\/a12090177","type":"journal-article","created":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T04:38:23Z","timestamp":1566794303000},"page":"177","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":43,"title":["Simple K-Medoids Partitioning Algorithm for Mixed Variable Data"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9561-1538","authenticated-orcid":false,"given":"Weksi","family":"Budiaji","sequence":"first","affiliation":[{"name":"Agribusiness Department, Sultan Ageng Tirtayasa University, Jl. Raya Jakarta Km. 4 Serang, Banten 42118, Indonesia"},{"name":"Institute of Statistics, University of Natural Resources and Life Sciences, Peter Jordan Stra\u00dfe 82, 1180 Vienna, Austria"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7278-1983","authenticated-orcid":false,"given":"Friedrich","family":"Leisch","sequence":"additional","affiliation":[{"name":"Institute of Statistics, University of Natural Resources and Life Sciences, Peter Jordan Stra\u00dfe 82, 1180 Vienna, Austria"}]}],"member":"1968","published-online":{"date-parts":[[2019,8,24]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Gan, G., Ma, C., and Wu, J. (2007). Data Clustering, Theory, Algorithm, and Application, The Society for Industrial and Applied Mathematics. The American Statistical Association.","DOI":"10.1137\/1.9780898718348"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Kaufman, L., and Rousseeuw, P.J. (1990). Finding Groups in Data, John Wiley and Sons Inc.","DOI":"10.1002\/9780470316801"},{"key":"ref_3","first-page":"100","article-title":"A K-Means Clustering Algorithm","volume":"28","author":"Hartigan","year":"1979","journal-title":"J. R. Stat. Soc."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-007-0114-2","article-title":"Top 10 algorithms in data mining","volume":"14","author":"Wu","year":"2008","journal-title":"Knowl. Inf. Syst."},{"key":"ref_5","unstructured":"Huang, Z. (1997). Clustering large datasets with mixed numeric and categorical values. Proceedings of the First Pacific-Asia Conference on Knowledge Discovery and Data Mining, Springer."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/j.datak.2007.03.016","article-title":"A K-mean clustering algorithm for mixed numeric and categorical data","volume":"63","author":"Ahmad","year":"2007","journal-title":"Data Knowl. Eng."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/j.procs.2015.10.077","article-title":"K-Medoid Clustering for Heterogeneous DataSets","volume":"70","author":"Harikumar","year":"2015","journal-title":"Procedia Comput. Sci."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"986","DOI":"10.1016\/j.patrec.2008.01.021","article-title":"Distance functions for categorical and mixed variables","volume":"29","author":"McCane","year":"2008","journal-title":"Pattern Recognit. Lett."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"857","DOI":"10.2307\/2528823","article-title":"A General Coefficient of Similarity and Some of Its Properties","volume":"27","author":"Gower","year":"1971","journal-title":"Biometrics"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1111\/j.1467-9868.2004.02059.x","article-title":"Clustering objects on subsets of attributes (with discussion)","volume":"66","author":"Friedman","year":"2004","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Pan, Y., Chen, D., Guo, M., Cao, J., and Dongarra, J. (2005). Clustering Mixed Type Attributes in Large Dataset. ISPA 2005: Parallel and Distributed Processing Application, Springer. Lecture Notes in Computer Science Volumn 3758.","DOI":"10.1007\/11576235"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/1752-0509-1-15","article-title":"Simultaneous clustering of gene expression data with clinical chemistry and pathological evaluations reveals phenotypic prototypes","volume":"1","author":"Bushel","year":"2007","journal-title":"BMC Syst. Biol."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1016\/j.neucom.2013.04.011","article-title":"An improved k-prototypes clustering algorithm for mixed numeric and categorical data","volume":"120","author":"Ji","year":"2013","journal-title":"Neurocomputing"},{"key":"ref_14","first-page":"1","article-title":"A three-stage framework for clustering mixed data","volume":"15","author":"Liu","year":"2016","journal-title":"WSEAS Trans. Syst."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/s10852-005-9022-1","article-title":"Clustering Rules: A Comparison of Partitioning and Hierarchical Clustering Algorithms","volume":"5","author":"Reynolds","year":"2006","journal-title":"J. Math. Model. Algorithms"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"3336","DOI":"10.1016\/j.eswa.2008.01.039","article-title":"A simple and fast algorithm for K-medoids clustering","volume":"36","author":"Park","year":"2009","journal-title":"Expert Syst. Appl."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1037\/1082-989X.8.3.294","article-title":"Local Optima in K-Means Clustering: What You Don\u2019t Know May Hurt You","volume":"8","author":"Steinley","year":"2003","journal-title":"Psychol. Methods"},{"key":"ref_18","first-page":"221","article-title":"A Modified k-means Algorithm to Avoid Empty Clusters","volume":"1","author":"Pakhira","year":"2009","journal-title":"Int. J. Recent Trends Eng."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.knosys.2012.10.012","article-title":"Ranked k-medoids: A fast and accurate rank-based partitioning algorithm for clustering large datasets","volume":"39","author":"Zadegan","year":"2016","journal-title":"Knowl.-Based Syst."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Budiaji, W., and kmed: Distance-Based K-Medoids (2019, June 15). R Package Version 0.3.0. Available online: http:\/\/CRAN.R-project.org\/package=kmed.","DOI":"10.32614\/CRAN.package.kmed"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s00357-007-0003-0","article-title":"Initializing K-means Batch Clustering: A Critical Evaluation of Several Techniques","volume":"24","author":"Steinley","year":"2007","journal-title":"J. Classif."},{"key":"ref_22","unstructured":"Podani, J. (2000). Introduction to Exploration of Multivariate Biological Data, Backhuys Publishers."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Wishart, D. (2003). K-Means Clustering with Outlier Detection, Mixed Variables and Missing Values. Exploratory Data Analysis in Empirical Research, Proceedings of the 25th Annual Conference of the Gesellschaft f\u00fcr Klassifikation e.V., University of Munich, 14\u201316 March 2001, Springer.","DOI":"10.1007\/978-3-642-55721-7_23"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s00357-006-0018-y","article-title":"Generation of Random Clusters with Specified Degree of Separation","volume":"23","author":"Qiu","year":"2006","journal-title":"J. Classif."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1016\/j.csda.2004.09.009","article-title":"Separation Index and Partial Membership for Clustering","volume":"50","author":"Qiu","year":"2006","journal-title":"Comput. Stat. Data Anal."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/j.csda.2006.11.025","article-title":"Cluster-wise assessment of cluster stability","volume":"52","author":"Hennig","year":"2007","journal-title":"Comput. Stat. Data Anal."},{"key":"ref_27","unstructured":"Lichman, M. (2013). UCI Machine Learning Repository, University of California. Available online: http:\/\/archive.ics.uci.edu\/ml."},{"key":"ref_28","unstructured":"R Core Team (2015). R: A Language and Environment for Statistical Computing, R Foundation for Statistical Computing. Available online: https:\/\/www.R-project.org\/."},{"key":"ref_29","unstructured":"Maechler, M., Rousseeuw, P., Struyf, A., Hubert, M., Hornik, K., and cluster: Cluster Analysis Basics and Extensions (2018, September 10). R Package Version 2.0.6\u2014For New Features, See the \u2018Changelog\u2019 File (in the Package Source). Available online: http:\/\/CRAN.R-project.org\/package=cluster."},{"key":"ref_30","unstructured":"Qiu, W., and Joe, H. (2018, August 23). clusterGeneration: Random Cluster Generation (with Specified Degree of Separation). Available online: http:\/\/CRAN.R-project.org\/package=clusterGeneration."},{"key":"ref_31","unstructured":"Leisch, L., Dimitriadou, D., Gruen, B., and flexclust: Flexible Cluster Algorithms (2019, January 15). R Package Version 1.4-0. Available online: http:\/\/CRAN.R-project.org\/package=flexclust."},{"key":"ref_32","unstructured":"Hornik, K., B\u00f6hm, W., and clue: Cluster Ensembles (2019, May 07). R Package Version 0.3-57. Available online: http:\/\/CRAN.R-project.org\/package=clue."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Wickham, H. (2016). ggplot2: Elegant Graphics for Data Analysis, Springer.","DOI":"10.1007\/978-3-319-24277-4_9"},{"key":"ref_34","unstructured":"Auguie, B., Antonov, A., and gridExtra: Miscellaneous Functions for \u201cGrid\u201d Graphics (2018, May 01). R Package Version 2.3. Available online: http:\/\/CRAN.R-project.org\/package=gridExtra."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1016\/j.csda.2005.10.006","article-title":"A toolbox for K-centroids cluster analysis","volume":"51","author":"Leisch","year":"2006","journal-title":"Comput. Stat. Data Anal."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"1062","DOI":"10.1016\/j.patrec.2011.02.017","article-title":"K-means type clustering algorithm for subspace clustering of mixed numeric and categorical datasets","volume":"32","author":"Ahmad","year":"2011","journal-title":"Pattern Recognit. Lett."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/12\/9\/177\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:13:42Z","timestamp":1760188422000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/12\/9\/177"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,24]]},"references-count":36,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2019,9]]}},"alternative-id":["a12090177"],"URL":"https:\/\/doi.org\/10.3390\/a12090177","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,24]]}}}