Identifying intervals for hierarchical clustering using the Gershgorin circle theorem

RaghvenPhDa Mall, Siamak Mehrkanoon, Johan A.K. Suykens

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

In this paper we present a novel method for unraveling the hierarchical clusters in a given dataset using the Gershgorin circle theorem. The Gershgorin circle theorem provides upper bounds on the eigenvalues of the normalized Laplacian matrix. This can be utilized to determine the ideal range for the number of clusters (k) at different levels of hierarchy in a given dataset. The obtained intervals help to reduce the search space for identifying the ideal value of k at each level. Another advantage is that we don't need to perform the computationally expensive eigen-decomposition step to obtain the eigenvalues and eigenvectors. The intervals provided for k can be considered as input for any spectral clustering method which uses a normalized Laplacian matrix. We show the effectiveness of the method in combination with a spectral clustering method to generate hierarchical clusters for several synthetic and real world datasets.

Original languageEnglish
Pages (from-to)1-7
Number of pages7
JournalPattern Recognition Letters
Volume55
DOIs
Publication statusPublished - 1 Apr 2015
Externally publishedYes

Fingerprint

Eigenvalues and eigenfunctions
Decomposition

Keywords

  • Eigengap
  • Gershgorin circle theorem
  • k clusters

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence

Cite this

Identifying intervals for hierarchical clustering using the Gershgorin circle theorem. / Mall, RaghvenPhDa; Mehrkanoon, Siamak; Suykens, Johan A.K.

In: Pattern Recognition Letters, Vol. 55, 01.04.2015, p. 1-7.

Research output: Contribution to journalArticle

@article{b4044a60d9384044997a7399e8991067,
title = "Identifying intervals for hierarchical clustering using the Gershgorin circle theorem",
abstract = "In this paper we present a novel method for unraveling the hierarchical clusters in a given dataset using the Gershgorin circle theorem. The Gershgorin circle theorem provides upper bounds on the eigenvalues of the normalized Laplacian matrix. This can be utilized to determine the ideal range for the number of clusters (k) at different levels of hierarchy in a given dataset. The obtained intervals help to reduce the search space for identifying the ideal value of k at each level. Another advantage is that we don't need to perform the computationally expensive eigen-decomposition step to obtain the eigenvalues and eigenvectors. The intervals provided for k can be considered as input for any spectral clustering method which uses a normalized Laplacian matrix. We show the effectiveness of the method in combination with a spectral clustering method to generate hierarchical clusters for several synthetic and real world datasets.",
keywords = "Eigengap, Gershgorin circle theorem, k clusters",
author = "RaghvenPhDa Mall and Siamak Mehrkanoon and Suykens, {Johan A.K.}",
year = "2015",
month = "4",
day = "1",
doi = "10.1016/j.patrec.2014.12.007",
language = "English",
volume = "55",
pages = "1--7",
journal = "Pattern Recognition Letters",
issn = "0167-8655",
publisher = "Elsevier",

}

TY - JOUR

T1 - Identifying intervals for hierarchical clustering using the Gershgorin circle theorem

AU - Mall, RaghvenPhDa

AU - Mehrkanoon, Siamak

AU - Suykens, Johan A.K.

PY - 2015/4/1

Y1 - 2015/4/1

N2 - In this paper we present a novel method for unraveling the hierarchical clusters in a given dataset using the Gershgorin circle theorem. The Gershgorin circle theorem provides upper bounds on the eigenvalues of the normalized Laplacian matrix. This can be utilized to determine the ideal range for the number of clusters (k) at different levels of hierarchy in a given dataset. The obtained intervals help to reduce the search space for identifying the ideal value of k at each level. Another advantage is that we don't need to perform the computationally expensive eigen-decomposition step to obtain the eigenvalues and eigenvectors. The intervals provided for k can be considered as input for any spectral clustering method which uses a normalized Laplacian matrix. We show the effectiveness of the method in combination with a spectral clustering method to generate hierarchical clusters for several synthetic and real world datasets.

AB - In this paper we present a novel method for unraveling the hierarchical clusters in a given dataset using the Gershgorin circle theorem. The Gershgorin circle theorem provides upper bounds on the eigenvalues of the normalized Laplacian matrix. This can be utilized to determine the ideal range for the number of clusters (k) at different levels of hierarchy in a given dataset. The obtained intervals help to reduce the search space for identifying the ideal value of k at each level. Another advantage is that we don't need to perform the computationally expensive eigen-decomposition step to obtain the eigenvalues and eigenvectors. The intervals provided for k can be considered as input for any spectral clustering method which uses a normalized Laplacian matrix. We show the effectiveness of the method in combination with a spectral clustering method to generate hierarchical clusters for several synthetic and real world datasets.

KW - Eigengap

KW - Gershgorin circle theorem

KW - k clusters

UR - http://www.scopus.com/inward/record.url?scp=84922215306&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84922215306&partnerID=8YFLogxK

U2 - 10.1016/j.patrec.2014.12.007

DO - 10.1016/j.patrec.2014.12.007

M3 - Article

AN - SCOPUS:84922215306

VL - 55

SP - 1

EP - 7

JO - Pattern Recognition Letters

JF - Pattern Recognition Letters

SN - 0167-8655

ER -