Search Results for author:
Found 1 papers, 0 papers with code
Fast And Efficient Boolean Matrix Factorization By Geometric Segmentation
Boolean matrix factorization (BMF) aims to find an approximation of a binary matrix as the Boolean product of two low rank Boolean matrices, which could generate vast amount of information for the patterns of relationships between the features and samples.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
