手法を比較
選択した手法を並べて確認できます。異なる行はハイライト表示されます。
| FP成長 (頻出パターン成長)× | K平均法クラスタリング× | |
|---|---|---|
| 分野 | 機械学習 | 機械学習 |
| 系統 | Machine learning | Machine learning |
| 提唱年≠ | 2000 | 1967 |
| 提唱者≠ | Jiawei Han, Jian Pei & Yiwen Yin | MacQueen, J. |
| 種類≠ | Frequent-itemset mining algorithm | Partitional clustering (centroid-based) |
| 原典≠ | Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29(2), 1–12. DOI ↗ | 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 ↗ |
| 別名 | frequent pattern growth, FP-tree mining, FP-Growth algorithm, sık örüntü büyütme | K-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clustering |
| 関連≠ | 4 | 3 |
| 概要≠ | FP-Growth, introduced by Jiawei Han, Jian Pei, and Yiwen Yin in 2000, mines frequent itemsets from transaction data without generating candidate sets, the costly step that slows the classic Apriori algorithm. It compresses the database into a frequent-pattern tree (FP-tree) in two scans, then grows frequent patterns recursively from that structure, making it dramatically faster than Apriori on large, dense datasets. | 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. |
| ScholarGateデータセット ↗ |
|
|