A novel initialisation based on hospital-resident assignment for the k-modes algorithm

02/07/2020
by   Henry Wilde, et al.
0

This paper presents a new way of selecting an initial solution for the k-modes algorithm that allows for a notion of mathematical fairness and a leverage of the data that the common initialisations from literature do not. The method, which utilises the Hospital-Resident Assignment Problem to find the set of initial cluster centroids, is compared with the current initialisations on both benchmark datasets and a body of newly generated artificial datasets. Based on this analysis, the proposed method is shown to outperform the other initialisations in the majority of cases, especially when the number of clusters is optimised. In addition, we find that our method outperforms the leading established method specifically for low-density data.

READ FULL TEXT

page 21

page 22

research
04/24/2013

The K-modes algorithm for clustering

Many clustering algorithms exist that estimate a cluster centroid, such ...
research
12/29/2022

Cluster-level Group Representativity Fairness in k-means Clustering

There has been much interest recently in developing fair clustering algo...
research
03/23/2022

Analysis of Hospital Bed Requirements Using Discrete Event Simulation and Mathematical Modeling

Using SimPy and Discrete Event Simulation we have observed the different...
research
01/09/2018

An efficient K -means clustering algorithm for massive data

The analysis of continously larger datasets is a task of major importanc...
research
02/10/2023

Neural Capacitated Clustering

Recent work on deep clustering has found new promising methods also for ...
research
12/23/2019

A Bayesian Application in Judicial Decisions

This paper presents a new tool to support the decision concerning moral ...

Please sign up or login with your details

Forgot password? Click here to reset