BFR algorithm
Jump to navigation
Jump to search
 | This article needs additional citations for verification. (May 2018) |
The BFR algorithm, named after its inventors Bradley, Fayyad and Reina, is a variant of k-means algorithm that is designed to cluster data in a high-dimensional Euclidean space. It makes a very strong assumption about the shape of clusters: they must be normally distributed about a centroid. The mean and standard deviation for a cluster may differ for different dimensions, but the dimensions must be independent.[1] In other words, the data must take the shape of axis-aligned ellipses.
References
[edit | edit source]- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |
 | This machine learning-related article is a stub. You can help Wikipedia by expanding it. |