Imagen de Portada

Average Sensitivity of Hierarchical $k$-Median Clustering

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Li, Shijie, He, Weiqiang, Bai, Ruobing, Peng, Pan
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Differentially Private Clustering Algorithm for Well-Clustered Graphs
por: He, Weiqiang, et al.
Publicado: (2024)

Sample-and-Search: An Effective Algorithm for Learning-Augmented k-Median Clustering in High dimensions
por: Cheng, Kangke, et al.
Publicado: (2026)

A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering
por: Bandyapadhyay, Sayan, et al.
Publicado: (2024)

Constant-Factor Approximations for Doubly Constrained Fair k-Center, k-Median and k-Means
por: Funk, Nicole, et al.
Publicado: (2026)

Learning-Augmented Streaming Algorithms for Correlation Clustering
por: Dong, Yinhao, et al.
Publicado: (2025)

Learning Augmented Graph $k$-Clustering
por: Fan, Chenglin, et al.
Publicado: (2025)

Incremental (k, z)-Clustering on Graphs
por: Cruciani, Emilio, et al.
Publicado: (2026)

Learning-Augmented Hierarchical Clustering
por: Braverman, Vladimir, et al.
Publicado: (2025)

Hierarchical Clustering via Local Search
por: Jowhari, Hossein
Publicado: (2024)

Deterministic $k$-Median Clustering in Near-Optimal Time
por: Costa, Martín, et al.
Publicado: (2025)

Connected k-Median with Disjoint and Non-disjoint Clusters
por: Eube, Jan, et al.
Publicado: (2025)

From Average Sensitivity to Small-Loss Regret Bounds under Random-Order Model
por: Sakaue, Shinsaku, et al.
Publicado: (2026)

Dynamic Consistent $k$-Center Clustering with Optimal Recourse
por: Forster, Sebastian, et al.
Publicado: (2024)

Dynamic Algorithm for Explainable k-medians Clustering under lp Norm
por: Makarychev, Konstantin, et al.
Publicado: (2025)

Linear Programming based Approximation to Individually Fair k-Clustering with Outliers
por: Maity, Binita, et al.
Publicado: (2024)

Hybrid k-Clustering: Blending k-Median and k-Center
por: Fomin, Fedor V., et al.
Publicado: (2024)

Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond
por: Axiotis, Kyriakos, et al.
Publicado: (2024)

Coreset Spectral Clustering
por: Jourdan, Ben, et al.
Publicado: (2025)

Dynamic Spectral Clustering with Provable Approximation Guarantee
por: Laenen, Steinar, et al.
Publicado: (2024)

Online Sparsification of Bipartite-Like Clusters in Graphs
por: Das, Joyentanuj, et al.
Publicado: (2025)

Differentially Private Synthetic Graphs Preserving Triangle-Motif Cuts
por: Peng, Pan, et al.
Publicado: (2025)

Private Geometric Median in Nearly-Linear Time
por: Kumar, Syamantak, et al.
Publicado: (2025)

On the Price of Differential Privacy for Hierarchical Clustering
por: Deng, Chengyuan, et al.
Publicado: (2025)

Facility Location and $k$-Median with Fair Outliers
por: Dabas, Rajni, et al.
Publicado: (2025)

Separating $k$-Median from the Supplier Version
por: Anand, Aditya, et al.
Publicado: (2024)

Clustering to Minimize Cluster-Aware Norm Objectives
por: Herold, Martin G., et al.
Publicado: (2024)

On Tight Robust Coresets for $k$-Medians Clustering
por: Huang, Lingxiao, et al.
Publicado: (2025)

A Faster $k$-means++ Algorithm
por: Liang, Jiehao, et al.
Publicado: (2022)

Dynamic algorithms for k-center on graphs
por: Cruciani, Emilio, et al.
Publicado: (2023)

Coreset for Robust Geometric Median: Eliminating Size Dependency on Outliers
por: Fang, Ziyi, et al.
Publicado: (2025)

Replicable Clustering
por: Esfandiari, Hossein, et al.
Publicado: (2023)

Relax and Merge: A Simple Yet Effective Framework for Solving Fair $k$-Means and $k$-sparse Wasserstein Barycenter Problems
por: Song, Shihong, et al.
Publicado: (2024)

A Broader View on Clustering under Cluster-Aware Norm Objectives
por: Herold, Martin G., et al.
Publicado: (2025)

A Sublinear-Time Spectral Clustering Oracle with Improved Preprocessing Time
por: Shen, Ranran, et al.
Publicado: (2023)

Multilayer Correlation Clustering
por: Miyauchi, Atsushi, et al.
Publicado: (2024)

Generalized Top-k Mallows Model for Ranked Choices
por: Haddadan, Shahrzad, et al.
Publicado: (2025)

Stochastic $k$-Submodular Bandits with Full Bandit Feedback
por: Nie, Guanyu, et al.
Publicado: (2024)

Fairness in Monotone $k$-submodular Maximization: Algorithms and Applications
por: Zhu, Yanhui, et al.
Publicado: (2024)

Sharper Bounds for $\ell_p$ Sensitivity Sampling
por: Woodruff, David P., et al.
Publicado: (2023)

Modification-Fair Cluster Editing
por: Froese, Vincent, et al.
Publicado: (2021)