StreamKM++, a clustering algorithm for data streams
From MaRDI portal
Searching and sorting (68P10) Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Recommendations
Cited in
(17)- Equi-Clustream: a framework for clustering time evolving mixed data
- \(k\)-means genetic algorithms with greedy genetic operators
- Learning big (image) data via coresets for dictionaries
- On the \(k\)-means/median cost function
- BICO: BIRCH meets coresets for \(k\)-means clustering
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
- StreamKM++
- A streaming algorithm for k-means with approximate coreset
- An algorithm for online \(k\)-means clustering
- StreamKM++: a clustering algorithm for data streams
- Streaming k-means on well-clusterable data
- Fast cluster tendency assessment for big, high-dimensional data
- scientific article; zbMATH DE number 7650129 (Why is no real title available?)
- On coresets for fair clustering in metric and Euclidean spaces and their applications
- Efficient streaming data clustering guided by self-refined organizing map
- Turning big data into tiny data: coresets for unsupervised learning problems
- An empirical evaluation of k-means coresets
This page was built for publication: StreamKM++, a clustering algorithm for data streams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5406269)