Skip to content

A collection of efficient and effective streaming clustering algorithms

Notifications You must be signed in to change notification settings

gjghfd/FasterStreamClustering

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

36 Commits
 
 
 
 
 
 
 
 

Repository files navigation

FasterStreamClustering

This repo aims to implement an optimized version of the streaming clustering algorithm proposed in [1]. We compare the implementation with StreamKM++ [2], one of the state-of-the-art streaming clustering algorithms.

Usage

We only support Linux and MacOS currently.

cd src
make
./main

Then you can see results printed in the command line.

TODO

  • Support dynamic gird partition.
  • Replace the CountMin Sketch with the Elastic Sketch.
  • Add multi-core support.

References

[1] Zhao Song, Lin F. Yang, Peilin Zhong (2018) Sensitivity Sampling Over Dynamic Geometric Data Streams with Applications to k-Clustering. CoRR abs/1802.00459.

[2] Ackermann MR, Ma¨rtens M, Raupach C, Swierkot K, Lammersen C, Sohler C (2012) StreamKM++: a clustering algorithm for data streams. J Exp Algorithmics 17:2.4:2.1–2.4:2.30.

About

A collection of efficient and effective streaming clustering algorithms

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published