dm.cs.tu-dortmund.de/mlbits/cluster-various/
Further Clustering Approaches – Lecture Notes
\(\tfrac {s}{p}\) (default \(p=1\) )
cluster each partition into \(\tfrac {s}{pq}\) clusters (default \(q=3\) )
cluster the resulting \(\tfrac {s}{q}\) representative points of all partitions
label all \(n\) [...] decided indirectly, by the diagonal values \(s(i,i)\) .
runtime complexity: \(O(n^2)\) , and needs \(3\cdot n^2\) memory to store \((s_{ij})\) , \((r_{ij})\) , \((a_{ij})\) .
Other Density-based Clustering [...] g., Cheng and Church, …
projected and subspace clustering e.g., CLIQUE, PROCLUS, PreDeCon, SUBCLU, P3C, StatPC, …
correlation clustering e.g., ORCLUS, LMCLUS, COPAC, 4C, ERiC, CASH, …
Some notable subtypes …
