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: 6889
Venue: SIGMOD
Year: 2024
Pagerank: 5.093636e-05
Overall Rank: 11,161 | 23.43%
DOI: 10.1145/3639273

Incoming Non-self Citations Over Time

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

Authors

1. Yasuhiro Fujiwara (Nippon Telegraph and Telephone Corporation)
2. Atsutoshi Kumagai (Nippon Telegraph and Telephone Corporation)
3. Yasutoshi Ida (Nippon Telegraph and Telephone Corporation)
4. Masahiro Nakano (Nippon Telegraph and Telephone Corporation)
5. Makoto Nakatsuji (Nippon Telegraph and Telephone Corporation)
6. Akisato Kimura (Nippon Telegraph and Telephone Corporation)

BibTeX Citation

@inproceedings{fujiwara_sigmod24,
        title = {{Efficient Algorithm for K-Multiple-Means}},
        author = {Fujiwara, Yasuhiro and Kumagai, Atsutoshi and Ida, Yasutoshi and Nakano, Masahiro and Nakatsuji, Makoto and Kimura, Akisato},
        series = {{SIGMOD} '24},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3639273},
        url = {https://dl.acm.org/doi/10.1145/3639273},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

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
142	LOF: Identifying Density-Based Local Outliers	2000	SIGMOD	0.0002962566
12,153	Scaling Manifold Ranking Based Image Retrieval	2015	VLDB	5.093636e-05
13,538	Fast Algorithm for the Lasso based L1-Graph Construction	2017	VLDB	-

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	5,314	Optimal Differentially Private Algorithms for k-Means Clustering	2018	PODS
2	11,253	Ensemble Clustering based on Meta-Learning and Hyperparameter Optimization	2024	VLDB
3	10,959	Federated and Balanced Clustering for High-dimensional Data	2025	VLDB
4	8,602	Marigold: Efficient k-means Clustering in High Dimensions	2023	VLDB
5	9,575	Local Search Methods for k-Means with Outliers	2017	VLDB
6	12,764	k-Means Projective Clustering	2004	PODS
7	7,360	On the Efficiency of K-Means Clustering: Evaluation, Optimization, and Algorithm Selection	2021	VLDB
8	10,615	Highly-Efficient Large-Scale k-means with Individual Fairness	2026	VLDB
9	11,420	F3 KM: Federated, Fair, and Fast k-means	2023	SIGMOD
10	2,085	Scalable K-Means++	2012	VLDB