Database Paper Browser

Back to papers

Federated and Balanced Clustering for High-dimensional Data

Summary: Teb-means: a vertical‑federated balanced k‑means that casts balanced clustering as a trace‑maximization problem and solves it via coordinate‑wise optimization decomposable across parties to avoid raw‑data sharing. Uses a greedy block CO to trade utility for communication, yielding linear per‑client time, (mildly) constant rounds, and ≈12× faster runtime with improved balance and preserved cluster structure. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
14022
Venue
VLDB
Year
2025
Pagerank
4.1945683e-05
Overall Rank
10,716 | 25.46%
DOI
10.14778/3749646.3749673

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers