K-means clustering: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

26 September 2025

  • curprev 12:2212:22, 26 September 2025‎ WikiSysop talk contribs‎ m 2,619 bytes 0‎ →‎Details
  • curprev 12:1712:17, 26 September 2025‎ WikiSysop talk contribs‎ 2,619 bytes +2,619‎ Created page with "__NOTOC__ ===Description=== The program reads a number of data points (multi-dimensional vectors) from a file and partitions those into K clusters. Clustering is important in discovering patterns or modes in multi-dimensional data sets. It is also a method of organizing data examples into similar groups (clusters). In this particular case, K-means partitions the data set such that each example (data point) is assigned to exactly one cluster - the one with the closest cen..."
Retrieved from "https://teaching.healthtech.dtu.dk:443/22118/index.php/K-means_clustering"