Robust non-negative matrix factorization

@inproceedings{Zhang2010RobustNM,
  title={Robust non-negative matrix factorization},
  author={Lijun Zhang and Zhengguang Chen and Miao Zheng and He Xiaofei},
  year={2010}
}
Non-negative matrix factorization (NMF) is a recently popularized technique for learning partsbased, linear representations of non-negative data. The traditional NMF is optimized under the Gaussian noise or Poisson noise assumption, and hence not suitable if the data are grossly corrupted. To improve the robustness of NMF, a novel algorithm named robust nonnegative matrix factorization (RNMF) is proposed in this paper. We assume that some entries of the data matrix may be arbitrarily corrupted… CONTINUE READING
Highly Cited
This paper has 34 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 22 extracted citations

Learning Efficient Sparse and Low Rank Models

IEEE Transactions on Pattern Analysis and Machine Intelligence • 2015
View 16 Excerpts
Highly Influenced

An Overview of Lead and Accompaniment Separation in Music

IEEE/ACM Transactions on Audio, Speech, and Language Processing • 2018

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Similar Papers

Loading similar papers…