Accessibility navigation


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

Hong, X., Gao, J., Wei, H., 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

[img] Text - Accepted Version
· Restricted to Repository staff only until 22 November 2023.
· Available under License Creative Commons Attribution Non-commercial No Derivatives.

1MB

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

To link to this item 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.

Item Type:Article
Refereed:Yes
Divisions:Science > School of Mathematical, Physical and Computational Sciences > Department of Computer Science
ID Code:108968
Publisher:Elsevier

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

Page navigation