Adaptive graph regularized non-negative matrix factorization with self-weighted learning for data clustering

Ma, Ziping; Wang, Jingyu; Li, Huirong; Huang, Yulei

doi:10.1007/s10489-023-04868-y

Cited by 3 publications

(2 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Similarly, it is possible to prove Equations ( 44) and (45). Finally, based on Lemma 1, the update schemes for the variables W, F, S are derived in this paper as shown in Equations ( 51)- (53).…”

mentioning

confidence: 89%

See 1 more Smart Citation

SFS-AGGL: Semi-Supervised Feature Selection Integrating Adaptive Graph with Global and Local Information

Yi,

Zhang,

Zhang

et al. 2024

Information

View full text Add to dashboard Cite

As the feature dimension of data continues to expand, the task of selecting an optimal subset of features from a pool of limited labeled data and extensive unlabeled data becomes more and more challenging. In recent years, some semi-supervised feature selection methods (SSFS) have been proposed to select a subset of features, but they still have some drawbacks limiting their performance, for e.g., many SSFS methods underutilize the structural distribution information available within labeled and unlabeled data. To address this issue, we proposed a semi-supervised feature selection method based on an adaptive graph with global and local constraints (SFS-AGGL) in this paper. Specifically, we first designed an adaptive graph learning mechanism that can consider both the global and local information of samples to effectively learn and retain the geometric structural information of the original dataset. Secondly, we constructed a label propagation technique integrated with the adaptive graph learning in SFS-AGGL to fully utilize the structural distribution information of both labeled and unlabeled data. The proposed SFS-AGGL method is validated through classification and clustering tasks across various datasets. The experimental results demonstrate its superiority over existing benchmark methods, particularly in terms of clustering performance.

show abstract

mentioning

confidence: 89%

“…Loss 3 (X, S) is the objective function of the graph learning. Some adaptively constructed graph methods have been designed [38][39][40][41]48,53].…”

Section: The Graph-based Semi-supervised Sparse Feature Selectionmentioning

confidence: 99%