---
title: BFR algorithm
slug: bfr-algorithm
qid: 
snapshot: enwiki-001303434725
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1303434725
tags: [22954940, 23468805, 23603337, 24043274, 26220375, 26798134, 28696367, 51017282]
---

# BFR algorithm

> [!note] Provenance
> Snapshot `enwiki-001303434725` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1303434725> · Licensed CC BY-SA 4.0

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==
