Songjian Lu

most citedNoisy and Incomplete Boolean Matrix Factorizationvia Expectation Maximization

4 citations · 4 across the 2 of their papers we have counts for

collaborators

2 papers

stat.ML2019★ 4 cited

Noisy and Incomplete Boolean Matrix Factorizationvia Expectation Maximization

Lifan Liang, Songjian Lu

Probabilistic approach to Boolean matrix factorization can provide solutions robustagainst noise and missing values with linear computational complexity. However,the assumption abo…

cs.DS2013

An exact algorithm with the time complexity of $O^{*} (1.29 9^{m})$ for the weighed mutually exclusive set cover problem

Songjian Lu, Xinghua Lu

In this paper, we will introduce an exact algorithm with a time complexity of $O^{*} (1.29 9^{m})$ for the {\sc weighted mutually exclusive set cover} problem, where $m$ is the number of…

Noisy and Incomplete Boolean Matrix Factorizationvia Expectation Maximization

An exact algorithm with the time complexity of O∗(1.299m) for the weighed mutually exclusive set cover problem

An exact algorithm with the time complexity of $O^{*} (1.29 9^{m})$ for the weighed mutually exclusive set cover problem