Efficient Rank-One Residue Approximation Method for Graph Regularized Non-Negative Matrix Factorization

Cite

Text

Liao and Zhang. "Efficient Rank-One Residue Approximation Method for Graph Regularized Non-Negative Matrix Factorization." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2013. doi:10.1007/978-3-642-40991-2_16

Markdown

[Liao and Zhang. "Efficient Rank-One Residue Approximation Method for Graph Regularized Non-Negative Matrix Factorization." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2013.](https://mlanthology.org/ecmlpkdd/2013/liao2013ecmlpkdd-efficient/) doi:10.1007/978-3-642-40991-2_16

BibTeX

@inproceedings{liao2013ecmlpkdd-efficient,
  title     = {{Efficient Rank-One Residue Approximation Method for Graph Regularized Non-Negative Matrix Factorization}},
  author    = {Liao, Qing and Zhang, Qian},
  booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
  year      = {2013},
  pages     = {242-255},
  doi       = {10.1007/978-3-642-40991-2_16},
  url       = {https://mlanthology.org/ecmlpkdd/2013/liao2013ecmlpkdd-efficient/}
}