Search from over 60,000 research works

Advanced Search

Two-step scalable spectral clustering algorithm using landmarks and probability density estimation

[thumbnail of Two step Spectral.pdf]
Preview
Two step Spectral.pdf - Accepted Version (1MB) | Preview
Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email

Hong, X. orcid id iconORCID: https://orcid.org/0000-0002-6832-2298, Gao, J., Wei, H. orcid id iconORCID: https://orcid.org/0000-0002-9664-5748, Xiao, J. and Mitchell, R. (2023) Two-step scalable spectral clustering algorithm using landmarks and probability density estimation. Neurocomputing, 519. pp. 173-186. ISSN 0925-2312 doi: 10.1016/j.neucom.2022.11.063

Abstract/Summary

Spectral clustering is one of the most important clustering approaches, often yielding performance superior to other clustering approaches. However, it is not scalable to large data sets in its original form due to the computational burden of the required large-matrix eigen-decomposition. In this paper, a two-step spectral clustering algorithm is introduced by extending recent advances of scalable spectral clustering based on low-rank affinity matrix using landmarks. In the first step, a scalable spectral clustering algorithm using raw landmark-based affinity matrix is adopted. In the second step, a novel low-rank affinity matrix is learnt via the probability density estimators, constructed from the estimated clusters as derived from the first step. Since the prior information on cluster labels can be utilised in the second step, this learnt affinity matrix reflects intrinsic pairwise data relationships much better. While the proposed more complicated algorithm results in a higher computational cost than the previous landmark-based spectral research, it can be shown that the associated computational cost still scales well with data size. It is demonstrated that the proposed algorithm is capable of achieving far superior performance than other state-of-the-art algorithms for several benchmark multi-class image data sets.

Altmetric Badge

Item Type Article
URI https://reading-clone.eprints-hosting.org/id/eprint/108968
Item Type Article
Refereed Yes
Divisions Science > School of Mathematical, Physical and Computational Sciences > Department of Computer Science
Publisher Elsevier
Download/View statistics View download statistics for this item

Downloads

Downloads per month over past year

University Staff: Request a correction | Centaur Editors: Update this record

Search Google Scholar