Skip to main content
. Author manuscript; available in PMC: 2024 Mar 25.
Published in final edited form as: Nat Protoc. 2023 Nov 21;18(12):3690–3731. doi: 10.1038/s41596-023-00892-x

Fig. 3 |. Distributed CoGAPS finds robust patterns across randomized gene or sample subsets.

Fig. 3 |

a, Subsetting is performed to break the input matrices into smaller components that can each be handed off to a worker process for NMF. b, Subsetting for parallelization can be performed across either matrix dimension. c, Each data subset yields its own NMF result. d, To identify the patterns that manifest themselves consistently across all NMF results, clustering is performed across all patterns returned by every thread, and a consensus matrix is generated from a process of matching cognate patterns. e, NMF is now run again on the same data subsets, this time with the consensus matrix provided as a ground truth from which the other matrix can be learned. This run is significantly faster than the first. f, Now that all threads have been forced to learn the same patterns, the portion of the NMF result that was not fixed can be stitched together to yield the final solution.