When do birds of a feather flock together? k-Means, proximity, and conic programming

Given a set of data, one central goal is to group them into clusters based on some notion of similarity between the individual objects. One of the most popular and widely-used approaches is k -means despite the computational hardness to find its global minimum. We study and compare the properties of...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematical programming 2020-01, Vol.179 (1-2), p.295-341
Hauptverfasser: Li, Xiaodong, Li, Yang, Ling, Shuyang, Strohmer, Thomas, Wei, Ke
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!