BFR algorithm ============= 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. In other words, the data must take the shape of axis-aligned ellipses. 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. In other words, the data must take the shape of axis-aligned ellipses. ==References== REFERENCES ---------- BIBLIOGRAPHY (BibTeX) -------------------- @article{ref0, title = {BFR algorithm}, url = {https://encyclopegia.org/a/bfr-algorithm} } BIBLIOGRAPHY (RIS) ------------------- TY - JOUR TI - BFR algorithm UR - https://encyclopegia.org/a/bfr-algorithm ER - CITE THIS ARTICLE ---------------- Cite this article: BFR algorithm Derived from: https://en.wikipedia.org/w/index.php?oldid=1303434725 Licence: CC BY-SA 4.0 Snapshot: enwiki-001303434725 Permalink: /a/bfr-algorithm