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

Unsupervised feature selection by regularized matrix factorization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
21
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
9
1

Relationship

2
8

Authors

Journals

citations
Cited by 52 publications
(21 citation statements)
references
References 12 publications
0
21
0
Order By: Relevance
“…Qi et al [87] in 2017 proposed a novel method called Regularized Matrix Factorization Feature Selection (RMFFS). Matrix factorization determines the correlation among features.…”
Section: Graph-based Unsupervised Fsmentioning
confidence: 99%
“…Qi et al [87] in 2017 proposed a novel method called Regularized Matrix Factorization Feature Selection (RMFFS). Matrix factorization determines the correlation among features.…”
Section: Graph-based Unsupervised Fsmentioning
confidence: 99%
“…In the future, Locality Sensitive Hashing [46] and feature selection [47,48,49,50] will be considered to cut down the computation complexity and memory consumption. Meanwhile, Query Expansion (QE) [51] and Graph Fusion (GF) [52] will be integrated into the image retrieval system to retrieve more target images.…”
Section: Discussionmentioning
confidence: 99%
“…Based on training data (labeled or unlabeled), feature selection methods can be classified into three categories: supervised [1,2] , semi-supervised [3,4] and unsupervised [5,6,7,8]. Moreover, based on their relationship with learning models, they can be divided into three categories: wrapper, filter and embedded methods [9,10].…”
Section: Introductionmentioning
confidence: 99%