Let V 2 be a set of vertices, where each vertex corresponds to a document d in the corpus D. We add an edge between a word w and a document d if w (k, 1 − δ)covers d in the sense of cosine similarity between words and documents, s(w, d), in the embedded space.
the graph G We also have for each document, a cluster assignment from the spectral-clustering step, i.e.