// Assign documents to the nearest centroid
for (int c = 0; c < similarities.columns(); c++)
{
int maxRow = 0;
double max = similarities.get(0, c);
for (int r = 1; r < similarities.rows(); r++)
{
if (max < similarities.get(r, c))
{
max = similarities.get(r, c);
maxRow = r;