We propose a modification of the original K-median data stream clustering to solve the facility location problem. Based on our experiments with geometric data we present suggestions on how to set processing parameters and describe how the algorithm behaves in various situations.
We propose a modification of the original K-median data stream clustering to solve the facility location problem. Based on our experiments with geometric data we present suggestions on how to set processing parameters and describe how the algorithm behaves in various situations. (en)
Upravili jsme data streamový algoritmus shlukování k-medián tak, aby řešil problém facility location. Na základě našich experimentů se shlukováním geometrickcýh dat dáváme doporučení jak nastavit parametry algortmu a popisujeme, jak se metoda chová v různých situacích. (cs)