paper-with-me

홈 › Papers

Local Connectivity in Centroid Clustering

2020-10-11 · Deepak P

Clustering is a fundamental task in unsupervised learning, one that targets to group a dataset into clusters of similar objects. There has been recent interest in embedding normative considerations around fairness within clustering formulations. In this paper, we propose 'local connectivity' as a crucial factor in assessing membership desert in centroid clustering. We use local connectivity to refer to the support offered by the local neighborhood of an object towards supporting its membership to the cluster in question. We motivate the need to consider local connectivity of objects in cluster assignment, and provide ways to quantify local connectivity in a given clustering. We then exploit concepts from density-based clustering and devise LOFKM, a clustering method that seeks to deepen local connectivity in clustering outputs, while staying within the framework of centroid clustering. Through an empirical evaluation over real-world datasets, we illustrate that LOFKM achieves notable improvements in local connectivity at reasonable costs to clustering quality, illustrating the effectiveness of the method.

📄 PDF Abstract BibTeX arXiv:2010.05353

Code (0)

등록된 구현이 없습니다.

Tasks

ClusteringFairness

Similar Papers 제목 키워드 기반

Affinity Graph Connectivity in Convex Clustering

2026-05-23 · Sam Rosen, Jason Xu arxiv

We generalize finite-sample bounds for convex clustering to the setting where affinity weights appearing in the objective correspond to a general connected graph. These bounds and their analysis lead to a better understa…

SHADE: Deep Density-based Clustering

2024-10-08 · Anna Beer, Pascal Weber, Lukas Miklautz, Collin Leiber 외

Detecting arbitrarily shaped clusters in high-dimensional noisy data is challenging for current clustering methods. We introduce SHADE (Structure-preserving High-dimensional Analysis with Density-based Exploration), the …

ClusteringDeep Clustering

Kempe Swap K-Means: A Scalable Near-Optimal Solution for Semi-Supervised Clustering

2026-03-28 · Yuxuan Ren, Shijie Deng arxiv

This paper presents a novel centroid-based heuristic algorithm, termed Kempe Swap K-Means, for constrained clustering under rigid must-link (ML) and cannot-link (CL) constraints. The algorithm employs a dual-phase iterat…

Computational Efficiency

Local Connectivity-Based Density Estimation for Face Clustering

2023-01-01 · CVPR 2023 1 · Junho Shin, Hyo-Jun Lee, Hyunseop Kim, Jong-Hyeon Baek 외

Recent graph-based face clustering methods predict the connectivity of enormous edges, including false positive edges that link nodes with different classes. However, those false positive edges, which connect negativ…

ClusteringConnectivity EstimationDensity EstimationFace Clustering+1

Topological Federated Clustering via Gravitational Potential Fields under Local Differential Privacy

2025-11-30 · Yunbo Long, Jiaquan Zhang, Xi Chen, Alexandra Brintrup arxiv

Clustering non-independent and identically distributed (non-IID) data under local differential privacy (LDP) in federated settings presents a critical challenge: preserving privacy while maintaining accuracy without iter…