مقایسهٔ روشها
روشهای انتخابی خود را کنار هم مرور کنید؛ ردیفهای متفاوت برجسته شدهاند.
| محاسبات دانهای (دانهبندی اطلاعات)× | خوشهبندی سلسلهمراتبی× | |
|---|---|---|
| حوزه≠ | محاسبات نرم | یادگیری ماشین |
| خانواده | Machine learning | Machine learning |
| سال پیدایش≠ | 1997 | 1963 |
| پدیدآور≠ | Lotfi A. Zadeh (information granulation); developed by Pedrycz, Skowron, Yao | Ward, J. H. |
| نوع≠ | Framework for multi-granularity information processing | Unsupervised clustering (agglomerative) |
| منبع بنیادین≠ | Zadeh, L. A. (1997). Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic. Fuzzy Sets and Systems, 90(2), 111–127. DOI ↗ | Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244. DOI ↗ |
| نامهای دیگر≠ | information granulation, computing with granules, three-way granular computing, tanecikli hesaplama | Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering |
| مرتبط≠ | 3 | 4 |
| خلاصه≠ | Granular computing is a problem-solving paradigm that processes information in 'granules' — clumps of objects drawn together by indistinguishability, similarity, or functionality — rather than at the level of individual data points. Articulated by Lotfi Zadeh in 1997 as fuzzy information granulation and developed into a broad framework, it provides a unifying umbrella over fuzzy sets, rough sets, and interval methods, letting analysis move to whichever level of detail a problem actually requires. | Hierarchical clustering is an unsupervised method that groups observations into nested clusters and draws the result as a dendrogram, so the number of clusters need not be fixed in advance. Its agglomerative form rests on the objective-function grouping criterion introduced by Joe Ward in 1963. |
| ScholarGateمجموعهداده ↗ |
|
|