{"id":"https://openalex.org/C65932786","wikidata":"https://www.wikidata.org/wiki/Q3191282","display_name":"k-medoids","level":5,"description":"A clustering algorithm minimizing the sum of distances to k representatives.","works_count":1093,"cited_by_count":14938,"summary_stats":null,"ids":{"openalex":"https://openalex.org/C65932786","wikidata":"https://www.wikidata.org/wiki/Q3191282","mag":null,"wikipedia":"https://en.wikipedia.org/wiki/k-medoids","umls_aui":null,"umls_cui":null},"image_url":null,"image_thumbnail_url":null,"international":{},"ancestors":null,"related_concepts":null,"counts_by_year":null,"works_api_url":"https://api.openalex.org/works?filter=concepts.id:65932786","updated_date":"2026-11-09T04:04:08","created_date":"2016-06-24T00:00:00"}