手法を比較
選択した手法を並べて確認できます。異なる行はハイライト表示されます。
| K平均法クラスタリング× | ランダムフォレスト× | |
|---|---|---|
| 分野 | 機械学習 | 機械学習 |
| 系統 | Machine learning | Machine learning |
| 提唱年≠ | 1967 | 2001 |
| 提唱者≠ | MacQueen, J. | Breiman, L. |
| 種類≠ | Partitional clustering (centroid-based) | Ensemble (bagging of decision trees) |
| 原典≠ | MacQueen, J. (1967). Some Methods for Classification and Analysis of Multivariate Observations. Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, 1, 281–297. link ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| 別名 | K-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clustering | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| 関連≠ | 3 | 4 |
| 概要≠ | K-Means Clustering is a centroid-based partitional clustering algorithm, traced to J. MacQueen in 1967, that splits data into k clusters by assigning each observation to its nearest cluster centre. It is widely used for marketing segmentation, customer grouping, and exploratory analysis. | Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree. |
| ScholarGateデータセット ↗ |
|
|