2018
DOI: 10.1016/j.neucom.2018.02.044
|View full text |Cite
|
Sign up to set email alerts
|

Feature selection based dual-graph sparse non-negative matrix factorization for local discriminative clustering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
16
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
4
3
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 70 publications
(16 citation statements)
references
References 23 publications
0
16
0
Order By: Relevance
“…For the samples and/or features, an affinity graph is constructed which models their local geometric properties during the process of selecting features. Recently, many new and efficient feature selection methods have been founded on manifold learning and dual-manifold learning including SGFS [17], GLOPSL [58], RGNMF [67], DSNMF [68], DSRMR [69], DGRCFR [70], DGSPSFS [71], DMvNMF [72], LRLMR [73], SLSDR [18], MRC-DNN [74], RML-RBF-DM [75], and EGCFS [76].…”
Section: Manifold Learningmentioning
confidence: 99%
“…For the samples and/or features, an affinity graph is constructed which models their local geometric properties during the process of selecting features. Recently, many new and efficient feature selection methods have been founded on manifold learning and dual-manifold learning including SGFS [17], GLOPSL [58], RGNMF [67], DSNMF [68], DSRMR [69], DGRCFR [70], DGSPSFS [71], DMvNMF [72], LRLMR [73], SLSDR [18], MRC-DNN [74], RML-RBF-DM [75], and EGCFS [76].…”
Section: Manifold Learningmentioning
confidence: 99%
“…We conduct simulations to examine our RFA-LCF for data clustering and representation. The results of our RFA-LCF are compared with those of 12 related algorithms, i.e., NMF [4], PNMF [6], GNMF [7], DNMF [41], DSNMF [49], PAMGNMF [50], CF [5], LCCF [9], LCF [10], LGCF [48], GRLCF [26] and GCF [40], which are all closely related to our algorithm. Note that there are no parameters in NMF, PNMF and CF, and the hyperparameters of GNMF, DNMF, DSNMF, LCF, LCCF, GRLCF, LGCF, PAMGNMF and GCF are carefully chosen for fair comparison.…”
Section: Simulation Results and Analysismentioning
confidence: 99%
“…Then, the cluster label of each sample can be obtained from the linear coefficients. Due to the nonnegative constraint based additive reconstruction, NMF and its variants, e.g., Projective NMF (PNMF) [6], Graph Regularized NMF (GNMF) [7], Constrained NMF (CNMF) [8], Graph Dual Regularization NMF (DNMF) [41], Parameter-less Auto-weighted Multiple Graph regularized NMF (PAMGNMF) [50] and Dual-graph Sparse NMF (DSNMF) [49] are widely applied for characterizing and clustering the faces, documents and texts [45][46][47], etc. Although the enhanced results have been obtained, NMF and its variants still cannot handle data in the reproduc-ing kernel Hilbert space.…”
Section: Introductionmentioning
confidence: 99%
“…We conduct simulations on six public real image databases to examine RFA-LCF for data clustering and representation. The results of our RFA-LCF are compared with those of 12 related nonnegative factorization algorithms, i.e., NMF [8], PNMF [28], GNMF [2], DNMF [18], DSNMF [13], PAMGNMF [19], CF [24], LCCF [3], LCF [11], LGCF [9], GRLCF [27] and GCF [26], which are closely related to our RFA-LCF. The information of evaluated datasets are shown in Table I.…”
Section: Simulation Resultsmentioning
confidence: 99%