Nonnegative Spectral Clustering for Large-Scale Semi-supervised Learning

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposes a novel clustering approach called Scalable Nonnegative Spectral Clustering (SNSC). Specifically, SNSC preserves the original nonnegative characteristic of the indicator matrix, which leads to a more tractable optimization problem with an accurate solution. Due to the nonnegativity, SNSC offers high interpretability to the indicator matrix, that is, the final cluster labels can be directly obtained without post-processing. SNSC also scales linearly with the data size, thus it can be easily applied to large-scale problems. In addition, limited label information can be naturally incorporated into SNSC for improving clustering performance. Extensive experiments demonstrate the superiority of SNSC as compared to the state-of-the-art methods.

Cite

CITATION STYLE

APA

Hu, W., Chen, C., Ye, F., Zheng, Z., & Ling, G. (2019). Nonnegative Spectral Clustering for Large-Scale Semi-supervised Learning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11448 LNCS, pp. 287–291). Springer Verlag. https://doi.org/10.1007/978-3-030-18590-9_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free