Application of sparse spectral clustering algorithm in high-dimensional data

DOI10.3969/J.ISSN.0253-2778.2017.04.005MaRDI QIDQ3132283zbMATH OpenOpenAlexFDO

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

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)

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

Cited in

(9)

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

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)