Fast Streaming k-Means Clustering with Coreset Caching
IEEE We present new algorithms for k-means clustering on a data stream with a focus on providing fast responses to clustering queries. Compared to the state-of-the-art, our algorithms provide substantial improvements in the query time for cluster centers while retaining the desirable properties of p...
Saved in:
Main Authors: | Yu Zhang, Kanat Tangwongsan, Srikanta Tirthapura |
---|---|
Other Authors: | Mahidol University |
Format: | Article |
Published: |
2020
|
Subjects: | |
Online Access: | https://repository.li.mahidol.ac.th/handle/123456789/59046 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Mahidol University |
Similar Items
-
Parallel Streaming Random Sampling
by: Kanat Tangwongsan, et al.
Published: (2020) -
Parallel streaming frequency-based aggregates
by: Kanat Tangwongsan, et al.
Published: (2018) -
Coresets for vertical federated learning: Regularized linear regression and k-means clustering
by: HUANG, Lingxiao, et al.
Published: (2022) -
Work-efficient parallel union-find with applications to incremental graph connectivity
by: Natcha Simsiri, et al.
Published: (2018) -
Work-efficient parallel union-find
by: Natcha Simsiri, et al.
Published: (2019)