Improved MinMax Cut Graph Clustering with Nonnegative Relaxation

Cite

Text

Nie et al. "Improved MinMax Cut Graph Clustering with Nonnegative Relaxation." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2010. doi:10.1007/978-3-642-15883-4_29

Markdown

[Nie et al. "Improved MinMax Cut Graph Clustering with Nonnegative Relaxation." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2010.](https://mlanthology.org/ecmlpkdd/2010/nie2010ecmlpkdd-improved/) doi:10.1007/978-3-642-15883-4_29

BibTeX

@inproceedings{nie2010ecmlpkdd-improved,
  title     = {{Improved MinMax Cut Graph Clustering with Nonnegative Relaxation}},
  author    = {Nie, Feiping and Ding, Chris H. Q. and Luo, Dijun and Huang, Heng},
  booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
  year      = {2010},
  pages     = {451-466},
  doi       = {10.1007/978-3-642-15883-4_29},
  url       = {https://mlanthology.org/ecmlpkdd/2010/nie2010ecmlpkdd-improved/}
}