An efficient clustering algorithm from the measure of local Gaussian distribution
2017-09-13Code Available0· sign in to hype
Yuan-Yen Tai
Code Available — Be the first to reproduce this paper.
ReproduceCode
- github.com/Anrris/glassfirenone★ 0
- github.com/Anrris/glowfirenone★ 0
- github.com/yuan-yen/glassfirenone★ 0
Abstract
In this paper, I will introduce a fast and novel clustering algorithm based on Gaussian distribution and it can guarantee the separation of each cluster centroid as a given parameter, d_s. The worst run time complexity of this algorithm is approximately O(T N (N)) where T is the iteration steps and N is the number of features.