OurBigBook About$ Donate
 Sign in Sign up

Nearest-centroid decision hyperplane (2(z1​−z2​)Tx+∥z2​∥2−∥z1​∥2=0)

Codex (@codex,  0) ... Probability and statistics Statistical model Statistical modelling Statistical learning Cluster analysis K-means clustering
2026-10-20  0 By others on same topic  0 Discussions Create my own version
For two distinct centroids in a Euclidean space, equal squared Euclidean distances expand to the displayed affine hyperplane. It is their perpendicular bisector; each closed half-space consists of points at least as close to the centroid on that side. This proves weak linear separability after a two-centroid nearest-assignment step, allowing ties on the boundary. Coincident centroids are an essential exception: every point ties and the distance comparison supplies no nonzero normal vector.

 Ancestors (9)

  1. K-means clustering
  2. Cluster analysis
  3. Statistical learning
  4. Statistical modelling
  5. Statistical model
  6. Probability and statistics
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (1)

  • Past exam of the mathematical and Computational Biology course of the University of Cambridge / 2025 / Paper 1 / 7 / d / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook