For short-text classification (Figure 2a), the accuracy increases for k ≥ 100 (TR and CR obtain the best for k = 1000).
we decompose a feature-relatedness graph into core-periphery (CP) structures, where a core feature (a vertex) is linked to a set of peripheries (also represented by vertices), indicating the connectivity of the graph.