Papers › An efficient clustering algorithm from the measure of local Gaussian distribution

An efficient clustering algorithm from the measure of local Gaussian distribution

13 Sep 2017arXiv:1709.08470archive 2025-07-28

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×N ×log(N)) where T is the iteration steps and N is the number of features.

PaperPDFCode

Syntology This paper's arXiv id is not in Syntology's Atlas id list (549,449 ids, as this build read them; the read time is in the build record), so this page links to no Syntology page for it. The list is not the whole graph; Syntology's feed shows papers as they enter the graph.

Code

Anrris/glassfire mentioned on GitHubSyntology: not harvested report
Anrris/glowfire mentioned on GitHubSyntology: not harvested report
yuan-yen/glassfire mentioned on GitHubSyntology: not harvested report

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

Clustering

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