Feature Selection for Better Identification of Subtypes of Guillain-Barré Syndrome

Algorithm 1

Partitions around medoids (PAM).

(1) objects are arbitrarily selected as the initial medoids .

(2) repeat

  (2.1) The distance is computed between each remaining object and the medoids .

  (2.2) Each object is assigned to the cluster with the nearest medoid .

  (2.3) An initial total cost is calculated.

  (2.4) A random is selected.

  (2.5) A total cost is calculated as a result of swapping an arbitrary with the randomly selected.

  (2.6) If then is replaced with .

  until  .