.png){kind=icon}
Return
Fast kernel spectral clustering
.png){kind=icon}
OA
AI
DOI：10.1016/j.neucom.2016.12.085.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Spectral clustering suffers from a scalability problem in both memory usage and computational time when the number of data instances N is large. To solve this issue, we present a fast spectral clustering algorithm able to effectively handle millions of datapoints at a desktop PC scale. The proposed technique relies on a kernel-based formulation of the spectral clustering problem, also known as kernel spectral clustering. In this framework, the Nystrom approximation of the feature map of size m, with m << N, is used to solve the primal optimization problem. This leads to a reduction of time complexity from O(N-3) to O(mN) and space complexity from O(N-2) to O(mN). The effectiveness of the proposed algorithm in terms of computational efficiency and clustering quality is illustrated on several datasets. (C) 2017 Published by Elsevier B.V.
Keywords:
Spectral clustering
Kernel methods
Big data
NystrOm approximation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W
Organization
Cited Papers
ShareSaveVector quantization based approximate spectral clustering of large datasets.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
ShareSaveA general kernelization framework for learning algorithms based on kernel PCANEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
ShareSaveThe changing epidemiology of paediatric brain tumours: a review from the Hospital for Sick Children
PREAI
ShareSaveShareSaveShareSave
View more