- Tytuł:
- K-means is probabilistically poor
- Autorzy:
- Kłopotek, Mieczysław
- Powiązania:
- https://bibliotekanauki.pl/articles/2201613.pdf
- Data publikacji:
- 2022
- Wydawca:
- Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
- Tematy:
-
k-means
clustering
probabilistic k-richness - Opis:
- Kleinberg introduced the concept of k-richness as a requirement for an algorithm to be a clustering algorithm. The most popular algorithm k means dos not fit this definition because of its probabilistic nature. Hence Ackerman et al. proposed the notion of probabilistic k-richness claiming without proof that k-means has this property. It is proven in this paper, by example, that the version of k-means with random initialization does not have the property probabilistic k-richness, just rebuking Ackeman's claim.
- Źródło:
-
Studia Informatica : systems and information technology; 2022, 2(27); 5--26
1731-2264 - Pojawia się w:
- Studia Informatica : systems and information technology
- Dostawca treści:
- Biblioteka Nauki
Artykuł