String Grammar Unsupervised Possibilistic Fuzzy C-Medians for Gait Pattern Classification in Patients with Neurodegenerative Diseases

Algorithm 2

Store unlabeled finite strings =

Initialize string prototypes for all C classes

Set , , ,

Compute using fuzzy median equation (3)

Do

  Compute Levenshtein distance between input string and cluster prototype

  Update membership value using equation (5)

  Update possibilistic value using equation (6)

  Update center string of each cluster () using equation (10) and (11)

Until (stabilize)