I think that the normal nomenclature is to assume that the eigen-vectors are column vectors (hence the V' in the singular decomposition) and thus most references would refer to clustering *rows* of the eigenvector matrix (which has one row per column of the original matrix and one column per eigenvalue).
It is sometimes really convenient to actually store the transpose of the eigenvectors. Jake is that what you are saying the Mahout decomposer does? On Thu, Jun 24, 2010 at 11:06 AM, Jake Mannix <[email protected]> wrote: > Let me be clear in understanding this: you take the matrix of eigenvectors, > which has desiredRank rows, of originalSize columns each, and take the > *columns* of this matrix (all originalSize of them, each of which has > desiredRank entries) and cluster them with KMeans, right >
