Research Article
Premature Ventricular Contractions’ Detection Based on Active Learning
Table 1
The algorithm of k-means++.
| Algorithm K-means ++ |
| Input: Training data Z = (xi, yi), i = 1, …, N, | Number of selected centroids K. | initiation centroids = [one random selected points] | For j from 1 to K − 1 | Distance ← { } | For t from 1 to length (centroids) | compute distances of “point” in Z to centroids | and store the point P with minimum distance | End | centroids = centroids + P | End |
|
|