Identifying intervals for hierarchical clustering using the Gershgorin circle theorem
Upper bounds on eigenvalues determine intervals for the ideal number of clusters. Upper bounds on eigenvalues obtained by the Gershgorin circle theorem. No need to perform computationally intensive eigen-decomposition to determine k. Provide a hierarchical clustering algorithm that uses the proposed intervals.
gershgorin circle theorem k clusters eigengap