The Viterbi algorithm (using the maximum likelihood decoding (MLD) algorithm) is a dynamic programming algorithm for finding the most likely sequence of hidden states – called the Viterbi path in hidden Markov models (HMM)Continue Reading
k-means clustering is a method of vector quantization which finds good inter similarity between cluster members and intra-similarity between other clusters. k-means clustering partitions n observations into k clusters in which each observation belongs to the cluster with the nearest mean, These means are chosen so that in the nextContinue Reading