Papers › An efficient clustering algorithm from the measure of local Gaussian distribution
An efficient clustering algorithm from the measure of local Gaussian distribution
Yuan-Yen Tai
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ₛ. The worst run time complexity of this algorithm is approximately ∼O$(T\times N \times \log(N))$ where T is the iteration steps and N is the number of features.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections