Imagen de Portada

Optimization of Inter-group Criteria for Clustering with Minimum Size Constraints

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Laber, Eduardo S., Murtinho, Lucas
Formato:	Preprint
Publicado:	2024
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

New bounds on the cohesion of complete-link and other linkage methods for agglomeration clustering
por: Dasgupta, Sanjoy, et al.
Publicado: (2024)

Practical and Parallelizable Algorithms for Non-Monotone Submodular Maximization with Size Constraint
por: Chen, Yixin, et al.
Publicado: (2020)

Minimum Cost Adaptive Submodular Cover
por: Al-Thani, Hessa, et al.
Publicado: (2022)

Minimum-Cost Network Flow with Dual Predictions
por: Chen, Zhiyang, et al.
Publicado: (2026)

Query-decision Regression between Shortest Path and Minimum Steiner Tree
por: Tong, Guangmo, et al.
Publicado: (2024)

$O(\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization
por: Vaze, Rahul, et al.
Publicado: (2025)

On the cohesion and separability of average-link for hierarchical agglomerative clustering
por: Laber, Eduardo Sany, et al.
Publicado: (2024)

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

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

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

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

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

Matroid Algorithms Under Size-Sensitive Independence Oracles
por: Banihashem, Kiarash, et al.
Publicado: (2026)

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

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

Testing Support Size More Efficiently Than Learning Histograms
por: Pinto Jr., Renato Ferreira, et al.
Publicado: (2024)

Chasing Convex Functions with Long-term Constraints
por: Lechowicz, Adam, et al.
Publicado: (2024)

Agnostic learning in (almost) optimal time via Gaussian surface area
por: Pesenti, Lucas, et al.
Publicado: (2026)

Clustering with Non-adaptive Subset Queries
por: Black, Hadley, et al.
Publicado: (2024)

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

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

Towards Fair Representation: Clustering and Consensus
por: Chakraborty, Diptarka, et al.
Publicado: (2025)

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

Dynamic Correlation Clustering in Sublinear Update Time
por: Cohen-Addad, Vincent, et al.
Publicado: (2024)

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

Query-Efficient Correlation Clustering with Noisy Oracle
por: Kuroki, Yuko, et al.
Publicado: (2024)

Optimal Clustering with Dependent Costs in Bayesian Networks
por: Wu, Paul Pao-Yen, et al.
Publicado: (2023)

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

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

Average Sensitivity of Hierarchical $k$-Median Clustering
por: Li, Shijie, et al.
Publicado: (2025)

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

SpEx: A Spectral Approach to Explainable Clustering
por: Argov, Tal, et al.
Publicado: (2025)

Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
por: Amanatidis, Georgios, et al.
Publicado: (2020)

Settling Time vs. Accuracy Tradeoffs for Clustering Big Data
por: Draganov, Andrew, et al.
Publicado: (2024)

Beyond Spectral Clustering: Probabilistic Cuts for Differentiable Graph Partitioning
por: Ghriss, Ayoub
Publicado: (2025)

Simple KNN-Based Outlier Detection Achieves Robust Clustering
por: Jiang, Tianle, et al.
Publicado: (2026)

Learning the Inverse Temperature of Ising Models under Hard Constraints using One Sample
por: Chauhan, Rohan, et al.
Publicado: (2025)

Faster Private Minimum Spanning Trees
por: Pagh, Rasmus, et al.
Publicado: (2024)

Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time
por: Braverman, Vladimir, et al.
Publicado: (2024)

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