{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T21:08:37Z","timestamp":1780088917167,"version":"3.54.0"},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T00:00:00Z","timestamp":1773878400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Software Impacts"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.simpa.2026.100833","type":"journal-article","created":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T08:02:06Z","timestamp":1774339326000},"page":"100833","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["kmed: An R package for reproducible distance-based k-medoids clustering"],"prefix":"10.1016","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9561-1538","authenticated-orcid":false,"given":"Weksi","family":"Budiaji","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ferdian Bangkit","family":"Wijaya","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"9","key":"10.1016\/j.simpa.2026.100833_b1","doi-asserted-by":"crossref","first-page":"177","DOI":"10.3390\/a12090177","article-title":"Simple K-medoids partitioning algorithm for mixed variable data","volume":"12","author":"Budiaji","year":"2019","journal-title":"Algorithms"},{"issue":"2","key":"10.1016\/j.simpa.2026.100833_b2","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1198\/tas.2009.0033","article-title":"History corner the history of the cluster heat map","volume":"63","author":"Wilkinson","year":"2009","journal-title":"Am. Stat."},{"key":"10.1016\/j.simpa.2026.100833_b3","series-title":"Kmed: Distance-based k-medoids","author":"Budiaji","year":"2022"},{"issue":"2","key":"10.1016\/j.simpa.2026.100833_b4","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."},{"issue":"4","key":"10.1016\/j.simpa.2026.100833_b5","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":"10.1016\/j.simpa.2026.100833_b6","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":"2013","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.simpa.2026.100833_b7","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/j.eswa.2017.09.052","article-title":"An improved K-medoids algorithm based on step increasing and optimizing medoids","volume":"92","author":"Donghua","year":"2018","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"10.1016\/j.simpa.2026.100833_b8","doi-asserted-by":"crossref","first-page":"207","DOI":"10.2501\/IJMR-2013-073","article-title":"Using graphical statistics to better understand market segmentation solutions","volume":"56","author":"Dolnicar","year":"2014","journal-title":"Int. J. Mark. Res."},{"issue":"4","key":"10.1016\/j.simpa.2026.100833_b9","doi-asserted-by":"crossref","DOI":"10.1016\/j.bbagrm.2022.194815","article-title":"From the comparative study of a circrna originating from an mammalian ATXN2L intron to understanding the genesis of intron lariat-derived circrnas","volume":"1865","author":"Robic","year":"2022","journal-title":"Biochim. Biophys. Acta - Gene Regul. Mech."},{"issue":"2","key":"10.1016\/j.simpa.2026.100833_b10","doi-asserted-by":"crossref","DOI":"10.1002\/sam.11678","article-title":"A treeless absolutely random forest with closed-form estimators of expected proximities","volume":"17","author":"Laska","year":"2024","journal-title":"Stat. Anal. Data Min."},{"issue":"2","key":"10.1016\/j.simpa.2026.100833_b11","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s00357-024-09493-z","article-title":"Mixed-type distance shrinkage and selection for clustering via kernel metric learning","volume":"42","author":"Ghashti","year":"2025","journal-title":"J. Classif."},{"issue":"1","key":"10.1016\/j.simpa.2026.100833_b12","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1080\/09571264.2023.2184333","article-title":"SomLier: a South African wine recommender system","volume":"34","author":"Redelinghuys","year":"2023","journal-title":"J. Wine Res."},{"issue":"2","key":"10.1016\/j.simpa.2026.100833_b13","first-page":"76","article-title":"Medoid-based shadow value validation and visualization","volume":"5","author":"Budiaji","year":"2019","journal-title":"Int. J. Adv. Intell. Inf."},{"key":"10.1016\/j.simpa.2026.100833_b14","doi-asserted-by":"crossref","first-page":"1715","DOI":"10.1007\/s12652-019-01452-6","article-title":"A machine learning approach for IoT cultural data","volume":"15","author":"Piccialli","year":"2024","journal-title":"J. Ambient. Intell. Humaniz. Comput."},{"key":"10.1016\/j.simpa.2026.100833_b15","doi-asserted-by":"crossref","DOI":"10.1007\/s11634-025-00637-6","article-title":"Mixed-type kernel-based quantification of similarity for clustering","author":"Ghashti","year":"2025","journal-title":"Adv. Data Anal. Classif."},{"key":"10.1016\/j.simpa.2026.100833_b16","doi-asserted-by":"crossref","DOI":"10.1080\/03610918.2025.2593944","article-title":"AID: Box\u2013Cox power transformations\u2013r package and web-based tool","author":"Y\u0131lmaz","year":"2025","journal-title":"Commun. Stat. Simul. Comput."}],"container-title":["Software Impacts"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2665963826000230?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2665963826000230?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T20:34:38Z","timestamp":1780086878000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2665963826000230"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":16,"alternative-id":["S2665963826000230"],"URL":"https:\/\/doi.org\/10.1016\/j.simpa.2026.100833","relation":{},"ISSN":["2665-9638"],"issn-type":[{"value":"2665-9638","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"kmed: An R package for reproducible distance-based k-medoids clustering","name":"articletitle","label":"Article Title"},{"value":"Software Impacts","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.simpa.2026.100833","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"simple-article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"100833"}}