Sparse K-means clustering algorithm with anchor graph regularization.
Xiaojun YangWeihao ZhaoYuxiong XuChang-Dong WangBin LiFeiping NiePublished in: Inf. Sci. (2024)
Keyphrases
- mixed norm
- solution path
- graph laplacian
- graph representation
- high dimensional
- clustering algorithm
- elastic net
- sparse approximation
- structured sparsity
- gaussian graphical models
- sparsity regularization
- bipartite graph
- graph theory
- graph structure
- directed graph
- structured data
- graph mining
- sparse data
- bayesian networks
- graph model
- random walk
- rank minimization
- graph theoretic
- spanning tree
- compressive sensing
- graph construction
- graph databases
- directed acyclic graph
- weighted graph
- sparsity constraints
- prior information
- sparsity inducing
- sparse representation
- markov random field