2021
DOI: 10.1002/pamm.202000032
|View full text |Cite
|
Sign up to set email alerts
|

Nonnegative Matrix Factorization models for knowledge extraction from biomedical and other real world data

Abstract: Inspect data for searching valuable information hidden in represents a key aspect in several fields. Fortunately, most of the available data presents an embedded mathematical structure which can be profitably exploited to better investigate latent patterns hidden in them. Dimensionality Reduction (DR) approaches represent one of the most suitable instrument to untangle latent information. These techniques aim to represent data under analysis onto a low-dimensional space allowing to consider most of all of intr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 20 publications
0
4
0
Order By: Relevance
“…Tanner et al [17] proposed the Alternating Steepest Descent algorithm (ASD) which can replace the least square subproblem solution in LMaFit. The nonnegative matrix factorization [18] is another famous MFM, it has been widely used as it automatically extracts sparse and meaningful features from highdimensional data [19], [20]. However, the nonnegative matrix factorization does not capture the local features of the sparse observation matrix.…”
Section: Related Workmentioning
confidence: 99%
“…Tanner et al [17] proposed the Alternating Steepest Descent algorithm (ASD) which can replace the least square subproblem solution in LMaFit. The nonnegative matrix factorization [18] is another famous MFM, it has been widely used as it automatically extracts sparse and meaningful features from highdimensional data [19], [20]. However, the nonnegative matrix factorization does not capture the local features of the sparse observation matrix.…”
Section: Related Workmentioning
confidence: 99%
“…Other approaches include matrix factorization-based ones, including e.g. : Singular Value Decomposition (SVD) [9], Principal Component Analysis (PCA) [10] with the sparse and probabilistic variants [11], Independent Component Analysis (ICA) [12] and Non-negative Matrix Factorizations (NMF) [13,14]. In particular, Non-negative Matrix Tri-Factorization (NMTF) is an extension of NMF and a well-known Machine Learning (ML) technique introduced for co-clustering and dimensionality reduction [15].…”
Section: Introductionmentioning
confidence: 99%
“…Various matrix factorizations have proven their effectiveness in handling omic data; the best known are: Singular Value Decomposition (SVD) [8,17], Principal Component Analysis (PCA) and its sparse and probabilistic variants [14], Independent Component Analysis (ICA) [18] and Nonnegative matrix factorizations (NMF) [3,[19][20][21][22][23]. Each of these techniques is based on different constraints that characterize the final properties of the matrix factors, leading to different optimization problems and numerical algorithms that must be used.…”
Section: Introductionmentioning
confidence: 99%
“…Note that each H kj describes the effect that the kth metagene has on the jth sample, so that a low value H kj indicates that the corresponding kth metagene has reduced importance in approximating the jth sample. NMF allows to reveal interpretable latent factors (unlike PCA or ICA, which also have negative entries without obvious biological significance) and to identify genes belonging to multiple pathways or biological processes [20,22,23,25]. As these reasons lead to a much more intuitive and interpretable representation, NMF is quite often preferred to other techniques.…”
Section: Introductionmentioning
confidence: 99%