Optimal Clustering with Dependent Costs in Bayesian Networks
Fuente:
arXiv
Saved in:
| Main Authors: | Wu, Paul Pao-Yen, Ruggeri, Fabrizio, Mengersen, Kerrie |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Dynamic Consistent $k$-Center Clustering with Optimal Recourse
by: Forster, Sebastian, et al.
Published: (2024)
by: Forster, Sebastian, et al.
Published: (2024)
The Cost of Parallelizing Boosting
by: Lyu, Xin, et al.
Published: (2024)
by: Lyu, Xin, et al.
Published: (2024)
Minimum-Cost Network Flow with Dual Predictions
by: Chen, Zhiyang, et al.
Published: (2026)
by: Chen, Zhiyang, et al.
Published: (2026)
The Cost of Consistency: Submodular Maximization with Constant Recourse
by: Dütting, Paul, et al.
Published: (2024)
by: Dütting, Paul, et al.
Published: (2024)
Clustering to Minimize Cluster-Aware Norm Objectives
by: Herold, Martin G., et al.
Published: (2024)
by: Herold, Martin G., et al.
Published: (2024)
Replicable Clustering
by: Esfandiari, Hossein, et al.
Published: (2023)
by: Esfandiari, Hossein, et al.
Published: (2023)
A Broader View on Clustering under Cluster-Aware Norm Objectives
by: Herold, Martin G., et al.
Published: (2025)
by: Herold, Martin G., et al.
Published: (2025)
Minimum Cost Adaptive Submodular Cover
by: Al-Thani, Hessa, et al.
Published: (2022)
by: Al-Thani, Hessa, et al.
Published: (2022)
Multilayer Correlation Clustering
by: Miyauchi, Atsushi, et al.
Published: (2024)
by: Miyauchi, Atsushi, et al.
Published: (2024)
Coreset Spectral Clustering
by: Jourdan, Ben, et al.
Published: (2025)
by: Jourdan, Ben, et al.
Published: (2025)
Learning-Augmented Hierarchical Clustering
by: Braverman, Vladimir, et al.
Published: (2025)
by: Braverman, Vladimir, et al.
Published: (2025)
Modification-Fair Cluster Editing
by: Froese, Vincent, et al.
Published: (2021)
by: Froese, Vincent, et al.
Published: (2021)
Learning Augmented Graph $k$-Clustering
by: Fan, Chenglin, et al.
Published: (2025)
by: Fan, Chenglin, et al.
Published: (2025)
Clustering with Non-adaptive Subset Queries
by: Black, Hadley, et al.
Published: (2024)
by: Black, Hadley, et al.
Published: (2024)
Towards Fair Representation: Clustering and Consensus
by: Chakraborty, Diptarka, et al.
Published: (2025)
by: Chakraborty, Diptarka, et al.
Published: (2025)
Incremental (k, z)-Clustering on Graphs
by: Cruciani, Emilio, et al.
Published: (2026)
by: Cruciani, Emilio, et al.
Published: (2026)
Hierarchical Clustering via Local Search
by: Jowhari, Hossein
Published: (2024)
by: Jowhari, Hossein
Published: (2024)
Online Conversion with Switching Costs: Robust and Learning-Augmented Algorithms
by: Lechowicz, Adam, et al.
Published: (2023)
by: Lechowicz, Adam, et al.
Published: (2023)
On Computing Optimal Tree Ensembles
by: Komusiewicz, Christian, et al.
Published: (2023)
by: Komusiewicz, Christian, et al.
Published: (2023)
Near-Optimal Algorithms for Omniprediction
by: Okoroafor, Princewill, et al.
Published: (2025)
by: Okoroafor, Princewill, et al.
Published: (2025)
Robust Learning with Optimal Error
by: Blanc, Guy
Published: (2026)
by: Blanc, Guy
Published: (2026)
Dynamic Correlation Clustering in Sublinear Update Time
by: Cohen-Addad, Vincent, et al.
Published: (2024)
by: Cohen-Addad, Vincent, et al.
Published: (2024)
Dynamic Spectral Clustering with Provable Approximation Guarantee
by: Laenen, Steinar, et al.
Published: (2024)
by: Laenen, Steinar, et al.
Published: (2024)
Online Sparsification of Bipartite-Like Clusters in Graphs
by: Das, Joyentanuj, et al.
Published: (2025)
by: Das, Joyentanuj, et al.
Published: (2025)
Learning-Augmented Streaming Algorithms for Correlation Clustering
by: Dong, Yinhao, et al.
Published: (2025)
by: Dong, Yinhao, et al.
Published: (2025)
Query-Efficient Correlation Clustering with Noisy Oracle
by: Kuroki, Yuko, et al.
Published: (2024)
by: Kuroki, Yuko, et al.
Published: (2024)
Average Sensitivity of Hierarchical $k$-Median Clustering
by: Li, Shijie, et al.
Published: (2025)
by: Li, Shijie, et al.
Published: (2025)
SpEx: A Spectral Approach to Explainable Clustering
by: Argov, Tal, et al.
Published: (2025)
by: Argov, Tal, et al.
Published: (2025)
Instance-Optimal Uniformity Testing and Tracking
by: Blanc, Guy, et al.
Published: (2025)
by: Blanc, Guy, et al.
Published: (2025)
Unrolled denoising networks provably learn optimal Bayesian inference
by: Karan, Aayush, et al.
Published: (2024)
by: Karan, Aayush, et al.
Published: (2024)
Settling Time vs. Accuracy Tradeoffs for Clustering Big Data
by: Draganov, Andrew, et al.
Published: (2024)
by: Draganov, Andrew, et al.
Published: (2024)
Optimization of Inter-group Criteria for Clustering with Minimum Size Constraints
by: Laber, Eduardo S., et al.
Published: (2024)
by: Laber, Eduardo S., et al.
Published: (2024)
Beyond Spectral Clustering: Probabilistic Cuts for Differentiable Graph Partitioning
by: Ghriss, Ayoub
Published: (2025)
by: Ghriss, Ayoub
Published: (2025)
Simple KNN-Based Outlier Detection Achieves Robust Clustering
by: Jiang, Tianle, et al.
Published: (2026)
by: Jiang, Tianle, et al.
Published: (2026)
Towards Optimal Robustness in Learning-Augmented Paging
by: Chen, Peng, et al.
Published: (2026)
by: Chen, Peng, et al.
Published: (2026)
Optimal Dimension-Free Sampling for Regularized Classification
by: Alishahi, Meysam, et al.
Published: (2026)
by: Alishahi, Meysam, et al.
Published: (2026)
Optimal Algorithms for Augmented Testing of Discrete Distributions
by: Aliakbarpour, Maryam, et al.
Published: (2024)
by: Aliakbarpour, Maryam, et al.
Published: (2024)
Optimal Kernel Orchestration for Tensor Programs with Korch
by: Hu, Muyan, et al.
Published: (2024)
by: Hu, Muyan, et al.
Published: (2024)
The Many Faces of Optimal Weak-to-Strong Learning
by: Høgsgaard, Mikael Møller, et al.
Published: (2024)
by: Høgsgaard, Mikael Møller, et al.
Published: (2024)
Capacity Provisioning Motivated Online Non-Convex Optimization Problem with Memory and Switching Cost
by: Vaze, Rahul, et al.
Published: (2024)
by: Vaze, Rahul, et al.
Published: (2024)
Similar Items
-
Dynamic Consistent $k$-Center Clustering with Optimal Recourse
by: Forster, Sebastian, et al.
Published: (2024) -
The Cost of Parallelizing Boosting
by: Lyu, Xin, et al.
Published: (2024) -
Minimum-Cost Network Flow with Dual Predictions
by: Chen, Zhiyang, et al.
Published: (2026) -
The Cost of Consistency: Submodular Maximization with Constant Recourse
by: Dütting, Paul, et al.
Published: (2024) -
Clustering to Minimize Cluster-Aware Norm Objectives
by: Herold, Martin G., et al.
Published: (2024)