BFR algorithm

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

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]

References[edit]

  1. ^ Rajaraman, Anand; Ullman, Jeffrey; Leskovec, Jure (2011). Mining of Massive Datasets. New York, NY, USA: Cambridge University Press. pp. 257–258. ISBN 1107015359.