Application of sparse spectral clustering algorithm in high-dimensional data

DOI10.3969/J.ISSN.0253-2778.2017.04.005zbMATH Open1389.68091OpenAlexW3208589642MaRDI QIDQ3132283FDOQ3132283

Authors: Xueli Xu, Xuejing Zhao 

Publication date: 29 January 2018

Full work available at URL: http://just.ustc.edu.cn/EN/Y2017/V47/I4/311

Recommendations

• scientific article; zbMATH DE number 6907452
• A simple approach to sparse clustering
• Computationally efficient sparse clustering
• Robust and sparse \(k\)-means clustering for high-dimensional data
• Non-negative and sparse spectral clustering

zbMATH Keywords

block diagonal matrixclustering evaluation indexclustering of high-dimensional datadimension-reduction techniquesparse spectral clustering algorithm

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Cited In (9)

• HYPER-SPECTRAL DATA CLUSTERING METHOD BASED UPON THE SENSITIVE SUBSPACE
• A simple approach to sparse clustering
• Title not available (Why is that?)
• New clustering method in high-dimensional space based on hypergraph models
• High-dimensional data mining algorithm based on SPCA-GWR
• Clustering method based on the data manifold structure and its application research
• A clustering algorithm for high-dimensional nonlinear feature data with applications
• Title not available (Why is that?)
• A spectral clustering algorithm based on neighborhood rough sets reduction

This page was built for publication: Application of sparse spectral clustering algorithm in high-dimensional data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132283)