Robust Principal Component Analysis with Non-Greedy L1-Norm Maximization

Cite

Text

Nie et al. "Robust Principal Component Analysis with Non-Greedy L1-Norm Maximization." International Joint Conference on Artificial Intelligence, 2011. doi:10.5591/978-1-57735-516-8/IJCAI11-242

Markdown

[Nie et al. "Robust Principal Component Analysis with Non-Greedy L1-Norm Maximization." International Joint Conference on Artificial Intelligence, 2011.](https://mlanthology.org/ijcai/2011/nie2011ijcai-robust/) doi:10.5591/978-1-57735-516-8/IJCAI11-242

BibTeX

@inproceedings{nie2011ijcai-robust,
  title     = {{Robust Principal Component Analysis with Non-Greedy L1-Norm Maximization}},
  author    = {Nie, Feiping and Huang, Heng and Ding, Chris H. Q. and Luo, Dijun and Wang, Hua},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2011},
  pages     = {1433-1438},
  doi       = {10.5591/978-1-57735-516-8/IJCAI11-242},
  url       = {https://mlanthology.org/ijcai/2011/nie2011ijcai-robust/}
}