Spectral clustering with linear embedding: A discrete clustering method for large-scale data

Chenhui Gao, Wenzhi Chen, Feiping Nie, Weizhong Yu, Zonghui Wang

Abstract: Highlights•Addressing spectral clustering time issues with a faster graph construction method.•Eliminating eigendecomposition, our approach saves computational time.•Avoiding intermediate variables, our method prevents information loss in updates.•Our algorithm achieves direct clustering matrix solution in linear time.