ML Anthology

The Sparse MinMax K-Means Algorithm for High-Dimensional Clustering

Sayak Dey, Swagatam Das, Rammohan Mallipeddi
IJCAI 2020 pp. 2103-2110
doi:10.24963/IJCAI.2020/291 /ijcai/2020/dey2020ijcai-sparse/
PDF IJCAI Semantic Scholar

Cite

Text

Dey et al. "The Sparse MinMax K-Means Algorithm for High-Dimensional Clustering." International Joint Conference on Artificial Intelligence, 2020. doi:10.24963/IJCAI.2020/291

Markdown

[Dey et al. "The Sparse MinMax K-Means Algorithm for High-Dimensional Clustering." International Joint Conference on Artificial Intelligence, 2020.](https://mlanthology.org/ijcai/2020/dey2020ijcai-sparse/) doi:10.24963/IJCAI.2020/291

BibTeX

@inproceedings{dey2020ijcai-sparse,
  title     = {{The Sparse MinMax K-Means Algorithm for High-Dimensional Clustering}},
  author    = {Dey, Sayak and Das, Swagatam and Mallipeddi, Rammohan},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2020},
  pages     = {2103-2110},
  doi       = {10.24963/IJCAI.2020/291},
  url       = {https://mlanthology.org/ijcai/2020/dey2020ijcai-sparse/}
}