Сравнение методов
Просматривайте выбранные методы рядом; строки с различиями подсвечены.
| Кластеризация методом k-средних× | t-SNE× | |
|---|---|---|
| Область | Машинное обучение | Машинное обучение |
| Семейство | Machine learning | Machine learning |
| Год появления≠ | 1967 (formalized 1982) | 2008 |
| Автор метода≠ | MacQueen, J. B.; Lloyd, S. P. | van der Maaten, L. & Hinton, G. |
| Тип≠ | Partitional clustering | Nonlinear dimensionality reduction (manifold visualization) |
| Основополагающий источник≠ | Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. DOI ↗ | van der Maaten, L. & Hinton, G. (2008). Visualizing Data using t-SNE. Journal of Machine Learning Research, 9(86), 2579–2605. link ↗ |
| Другие названия≠ | k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means | t-SNE (Boyut İndirgeme / Görselleştirme), t-distributed stochastic neighbor embedding, tsne |
| Связанные≠ | 4 | 3 |
| Сводка≠ | K-means is a classic unsupervised partitional clustering algorithm that divides a dataset into K non-overlapping groups by iteratively assigning each observation to its nearest centroid and updating centroids as the mean of their assigned points. It is one of the most widely used exploratory tools in machine learning and data analysis. | t-SNE (t-Distributed Stochastic Neighbor Embedding) is a nonlinear dimensionality-reduction method introduced by Laurens van der Maaten and Geoffrey Hinton in 2008 that maps high-dimensional data into a 2D or 3D space for visualization. It preserves probabilistic local similarities, so points that are neighbours in the original space stay close together, revealing cluster structure and local neighbourhoods. |
| ScholarGateНабор данных ↗ |
|
|