Based on Euclidean distance between vector representations of visits we applied and compared two clustering algorithms: k-means and hierarchical clustering with Ward's method for merging clusters BIBREF23 . 
 Question: Which clustering technique do they use on partients' visits texts?
k-means hierarchical clustering with Ward's method for merging clusters BIBREF23