Database Paper Browser

Back to papers

Efficient Algorithm for K-Multiple-Means

Summary: F-KMM speeds up K-Multiple-Means by computing leading singular vectors from a compact mean–mean similarity matrix, capturing non-spherical clusters. It preserves exact results while skipping unnecessary distance computations with lower-bound estimates, delivering orders-of-magnitude speedups on large data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6827
Venue
SIGMOD
Year
2024
Pagerank
4.1945683e-05
Overall Rank
10,943 | 23.88%
DOI
10.1145/3639273

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 3 of 3 cited papers.

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

Rank Cited Paper Year Venue Pagerank
161 LOF: Identifying Density-Based Local Outliers 2000 SIGMOD 0.00039846974
11,955 Scaling Manifold Ranking Based Image Retrieval 2015 VLDB 4.1945683e-05
13,337 Fast Algorithm for the Lasso based L1-Graph Construction 2017 VLDB -
Previous Page 1 / 1 Next

Semantically Similar Papers