Format KMedoids.scala

derrickburns · claude · derrickburns · commit 1d0c0c0cb7f2 · 2025-10-18T17:32:25.000-07:00
🤖 Generated with [Claude Code](https://claude.com/claude-code) Co-Authored-By: Claude <noreply@anthropic.com>
diff --git a/src/main/scala/com/massivedatascience/clusterer/ml/KMedoids.scala b/src/main/scala/com/massivedatascience/clusterer/ml/KMedoids.scala
@@ -224,9 +224,8 @@ class KMedoids(override val uid: String)
     *
     * Algorithm:
     *   1. For each medoid m and each non-medoid point o:
-    *      - Compute cost change if m is swapped with o
-    *      2. Perform the swap with the largest cost reduction 3. Repeat until no improvement is
-    *      possible or maxIter is reached
+    *      - Compute cost change if m is swapped with o 2. Perform the swap with the largest cost
+    *        reduction 3. Repeat until no improvement is possible or maxIter is reached
     *
     * @param data
     *   all data points

Original file line number	Diff line number	Diff line change
`@@ -224,9 +224,8 @@ class KMedoids(override val uid: String)`
`224`	`224`	`*`
`225`	`225`	`* Algorithm:`
`226`	`226`	`* 1. For each medoid m and each non-medoid point o:`
`227`		`- * - Compute cost change if m is swapped with o`
`228`		`- * 2. Perform the swap with the largest cost reduction 3. Repeat until no improvement is`
`229`		`- * possible or maxIter is reached`
	`227`	`+ * - Compute cost change if m is swapped with o 2. Perform the swap with the largest cost`
	`228`	`+ * reduction 3. Repeat until no improvement is possible or maxIter is reached`
`230`	`229`	`*`
`231`	`230`	`* @param data`
`232`	`231`	`* all data points`