arXiv (All)
open access
BalLOT: Balanced $k$-means clustering with optimal transport
We consider the fundamental problem of balanced $k$-means clustering. In particular, we introduce an optimal transport approach to alternating minimization called BalLOT, and we show that it delivers a fast and effective solution to this problem. We establish this with several theoretical guarantees
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Optimally Selecting Representative Agents from a Metric Space#793320
- Optimally Selecting Representative Agents from a Metric Space#789316
- Strategyproof Aggregation in Euclidean Spaces: Rigidity and Median Optimality#1013989
- Improved Impossibility Bounds for Maximin Share Allocations#1084972
- Pseudometric-Weighted Correlation Clustering via Spectral Preclustering#1123768
Record · ID 1155085
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive