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

Author:

Gillard Jonathan,Knight Vincent,Wilde Henry

Abstract

AbstractThis paper presents a new way of selecting an initialisation for the $$k$$ k -modes algorithm that allows for a notion of game theoretic fairness that classic initialisations, namely those by Huang and Cao, do not. Our new method utilises the hospital-resident assignment problem to find the set of initial cluster centroids which we compare with two classical initialisation methods for $$k$$ k -modes: the original presented by Huang and the next most popular method of Cao and co-authors. To highlight the merits of our proposed method, two stages of analysis are presented. It is demonstrated that the proposed method is often able to offer computational speed-up of the order of $$50\%$$ 50 % . Improved clustering, in terms of a commonly used cost-function, was witnessed in several cases and can be of the order of $$10\%$$ 10 % , particularly for more complex datasets.

Publisher

Springer Science and Business Media LLC

Subject

Geometry and Topology,Theoretical Computer Science,Software

Reference25 articles.

1. Arthur D, Vassilvitskii S (2007) $$k$$-means++: the advantages of careful seeding. In: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, SODA ’07, pp 1027–1035

2. Bashtannyk DM, Hyndman RJ (2001) Bandwidth selection for kernel conditional density estimation. Comput Stat Data Anal 36:279–298

3. Cao F, Liang J, Bai L (2009) A new initialization method for categorical data clustering. Expert Syst Appl 36:10223–10228

4. Cao F, Liang J, Li D, Bai L, Dang C (2012) A dissimilarity measure for the $$k$$-modes clustering algorithm. Knowl Based Syst 26:120–127

5. Dua D, Graff C (2017) UCI Machine Learning Repository

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. A study on multidimensional evaluation of teaching using loose-leaf textbooks based on improved K-modes algorithm;Fourth International Conference on Computer Vision and Data Mining (ICCVDM 2023);2024-02-19

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3