no code implementations • 13 Dec 2021 • Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
(2) For a given set of points, how to find a decision tree with $k$ leaves minimizing the $k$-means/median objective of the resulting explainable clustering?
no code implementations • 19 Oct 2020 • Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov
We consider a generalization of the fundamental $k$-means clustering for data with incomplete or corrupted entries.