A Split-Merge DP-Means Algorithm to Avoid Local Minima

Cite

Text

Odashima et al. "A Split-Merge DP-Means Algorithm to Avoid Local Minima." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2016. doi:10.1007/978-3-319-46227-1_5

Markdown

[Odashima et al. "A Split-Merge DP-Means Algorithm to Avoid Local Minima." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2016.](https://mlanthology.org/ecmlpkdd/2016/odashima2016ecmlpkdd-splitmerge/) doi:10.1007/978-3-319-46227-1_5

BibTeX

@inproceedings{odashima2016ecmlpkdd-splitmerge,
  title     = {{A Split-Merge DP-Means Algorithm to Avoid Local Minima}},
  author    = {Odashima, Shigeyuki and Ueki, Miwa and Sawasaki, Naoyuki},
  booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
  year      = {2016},
  pages     = {63-78},
  doi       = {10.1007/978-3-319-46227-1_5},
  url       = {https://mlanthology.org/ecmlpkdd/2016/odashima2016ecmlpkdd-splitmerge/}
}