BFR algorithm
From Wikipedia, the free encyclopedia
Vector clustering algorithms
This article needs additional citations for verification . Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "BFR algorithm" – news · newspapers · books · scholar · JSTOR (May 2018) (Learn how and when to remove this message)
Find sources: "BFR algorithm" – news · newspapers · books · scholar · JSTOR (May 2018) (Learn how and when to remove this message)
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 ]- ^ Rajaraman, Anand; Ullman, Jeffrey; Leskovec, Jure (2011). Mining of Massive Datasets. New York, NY, USA: Cambridge University Press. pp. 257–258. ISBN 978-1107015357.
Stub icon
This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.
Stub icon
This machine learning-related article is a stub. You can help Wikipedia by expanding it.