Publications related to Fairness and Explainability in Clustering Problems

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Fast K-Means with Accurate Bounds

François Fleuret, James Peter Newling

We propose a novel accelerated exact

k

-means algorithm, which outperforms the current state-of-the-art low-dimensional algorithm in 18 of 22 experiments, running up to 3

\times

faster. We also propose a general improvement of existing state-of-the-art a ...

Idiap2016

Fairness and Explainability in Clustering Problems

Graph Chatbot

Chat with Graph Search

A Bi-Criteria Approximation Algorithm for k-Means

Clustering of heterogeneous networks with directional flows based on “Snake” similarities

INFORMATION THEORETIC CLUSTERING FOR UNSUPERVISED DOMAIN-ADAPTATION

INFORMATION THEORETIC CLUSTERING FOR UNSUPERVISED DOMAIN-ADAPTATION

APPROXIMATING k-MEDIAN VIA PSEUDO-APPROXIMATION

Pose and Pathosformel in Aby Warburg’s Bilderatlas

Fast K-Means with Accurate Bounds

Centrality of trees for capacitated -center

Cluster Validity Measure and Merging System for Hierarchical Clustering considering Outliers

Nmf-Based Blind Source Separation Using A Linear Predictive Coding Error Clustering Criterion

Clustering of heterogeneous networks with directional flows based on “Snake” similarities

INFORMATION THEORETIC CLUSTERING FOR UNSUPERVISED DOMAIN-ADAPTATION

Centrality of trees for capacitated -center

APPROXIMATING k-MEDIAN VIA PSEUDO-APPROXIMATION

INFORMATION THEORETIC CLUSTERING FOR UNSUPERVISED DOMAIN-ADAPTATION

Pose and Pathosformel in Aby Warburg’s Bilderatlas

Fast K-Means with Accurate Bounds

Cluster Validity Measure and Merging System for Hierarchical Clustering considering Outliers

Nmf-Based Blind Source Separation Using A Linear Predictive Coding Error Clustering Criterion

A Bi-Criteria Approximation Algorithm for k-Means