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

Anneka Myrup Thiesson

dblp:404/8292 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 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%
Artificial intelligence
1 paper
Trustworthy machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › fairness › fair unsupervised learning
fair clustering
0.912025
FairDen: Fair Density-Based Clustering · ICLR 2025
Machine learning › Trustworthy machine learning
fairness
0.912025
FairDen: Fair Density-Based Clustering · ICLR 2025
Data mining
clustering
0.912025
FairDen: Fair Density-Based Clustering · ICLR 2025
Data mining › clustering
density-based clustering
0.912025
FairDen: Fair Density-Based Clustering · ICLR 2025
Data mining › clustering › constrained clustering
fair clustering
0.912025
FairDen: Fair Density-Based Clustering · ICLR 2025
YearPublicationVenuePosition
2025 FairDen: Fair Density-Based Clustering
abstract
Fairness in data mining tasks like clustering has recently become an increasingly important aspect. However, few clustering algorithms exist that focus on fair groupings of data with sensitive attributes. Including fairness in the clustering objective is especially hard for density-based clustering, as it does not directly optimize a closed form objective like centroid-based or spectral methods. This paper introduces FairDen, the first fair, density-based clustering algorithm. We capture the dataset's density-connectivity structure in a similarity matrix that we manipulate to encourage a balanced clustering. In contrast to state-of-the-art, FairDen inherently handles categorical attributes, noise, and data with several sensitive attributes or groups. We show that FairDen finds meaningful and fair clusters in extensive experiments.
Lena Krieger 0001, Anna Beer 0001, Pernille Matthews, Anneka Myrup Thiesson, Ira Assent
ICLR4