.png){kind=icon}
.png){kind=icon}
Return
Feature Weighted Non-Negative Matrix Factorization
.png){kind=icon}
OA
AI
DOI：10.1109/TCYB.2021.3100067.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Non-negative matrix factorization (NMF) is one of the most popular techniques for data representation and clustering and has been widely used in machine learning and data analysis. NMF concentrates the features of each sample into a vector and approximates it by the linear combination of basis vectors, such that the low-dimensional representations are achieved. However, in real-world applications, the features usually have different importance. To exploit the discriminative features, some methods project the samples into the subspace with a transformation matrix, which disturbs the original feature attributes and neglects the diversity of samples. To alleviate the above problems, we propose the feature weighted NMF (FNMF) in this article. The salient properties of FNMF can be summarized as three-fold: 1) it learns the weights of features adaptively according to their importance; 2) it utilizes multiple feature weighting components to preserve the diversity; and 3) it can be solved efficiently with the suggested optimization algorithm. The performance on synthetic and real-world datasets demonstrates that the proposed method obtains the state-of-the-art performance.
Keywords:
Manifolds
Data models
Sparse matrices
Robustness
Principal component analysis
Cybernetics
Task analysis
Data representation
manifold structure
matrix factorization
weighted feature
Journal
IF:
10.5
Papers:
1.1W
Citations:
5.0W