Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Muiris MacCarthaigh

dblp:319/6995 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
0000-0002-2296-3049ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining
clustering
0.812024
Towards Fairer Centroids in K-means Clustering · AAAI 2024
Data mining › clustering › constrained clustering
fair clustering
0.812024
Towards Fairer Centroids in K-means Clustering · AAAI 2024
Data mining › clustering
k-means clustering
0.812024
Towards Fairer Centroids in K-means Clustering · AAAI 2024

Methods — techniques the papers use, named apart from their topics

iterative optimization · 0.8
YearPublicationVenuePosition
2024 Towards Fairer Centroids in K-means Clustering
abstract
There has been much recent interest in developing fair clustering algorithms that seek to do justice to the representation of groups defined along sensitive attributes such as race and sex. Within the centroid clustering paradigm, these algorithms are seen to generate clusterings where different groups are disadvantaged within different clusters with respect to their representativity, i.e., distance to centroid. In view of this deficiency, we propose a novel notion of cluster-level centroid fairness that targets the representativity unfairness borne by groups within each cluster, along with a metric to quantify the same. Towards operationalising this notion, we draw on ideas from political philosophy aligned with consideration for the worst-off group to develop Fair-Centroid; a new clustering method that focusses on enhancing the representativity of the worst-off group within each cluster. Our method uses an iterative optimisation paradigm wherein an initial cluster assignment is refined by reassigning objects to clusters such that the worst-off group in each cluster is benefitted. We compare our notion with a related fairness notion and show through extensive empirical evaluations on real-world datasets that our method significantly enhances cluster-level centroid fairness at low impact on cluster coherence.
Stanley Simoes, Deepak P 0001, Muiris MacCarthaigh
AAAI3