methods / Dictionary Learning / Co-occurrence affinity clustering
Co-occurrence affinity clustering
Builds a pairwise affinity matrix between dictionary atoms from co-occurrence statistics (e.g. Jaccard, Dice, phi coefficient) and runs spectral clustering on it, partitioning atoms by functional relatedness with no positional information used — the partition is then checked post hoc against the atoms' actual geometric positions.