Jump to content

BFR algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Nbro (talk | contribs) at 16:43, 18 May 2018. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The BFR algorithm, named after its inventors Bradley, Fayyad and Reina, is a variant of k-means 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.