Research Article
Analysis and Identification of Students with Financial Difficulties: A Behavioural Feature Perspective
Algorithm 2
Semisupervised K-means label propagation.
| | Input: Labelled data array L and unlabelled data array U | | | Output: Label array LS | | (1) | Combine L and U into a new array LU | | (2) | Calculate the centroid of each cluster, appending them into a set C. | | (3) | Set the loop Flag←Changed | | (4) | While Flag ≡ Changed do: | | (5) | Flag ← Unchanged. | | (6) | For lu ∈ LU: | | (7) | Calculate the distance of lu and Ci as Di. | | (8) | Put Di in the array D. | | (9) | Get the minimum of D, record the label as Lc. | | (10) | If lu ≡ Lc Then: | | (11) | Change the lu label. | | (12) | Flag ← Changed. | | (13) | End if | | (14) | End for | | (15) | End while |
|