...ensity based）、格子式（Grid based），但是以上四 ；所谓硬式群聚方法指的是每一笔资仅都属于硬式群聚方法（Hard clustering）属于一个独且互斥的群聚。
基于6个网页-相关网页
In the background of this challenge, this thesis is brought out. This thesis studies primarily the three representative multidimensional data clustering algorithms such as hard clustering partition, fuzzy C-mean clustering aad possibility clustering etc.
论文首先研究了具有代表性几种多维聚类算法，比如，硬聚类划分、软聚类划分和可能性聚类。
参考来源 - 多维数据集聚类算法研究与实现·2,447,543篇论文数据，部分数据来源于NoteExpress
Clustering has historically been a hard problem to solve.
集群一直以来都是难以解决的问题。
It is hard to cluster high-dimensional data using traditional clustering algorithm because of the sparsity of data.
在高维空间中，由于数据的稀疏性，传统的聚类方法难以有效地聚类高维数据。
Many new and improved clustering algorithms have been proposed, but it is still hard to find a single algorithm to explore variety of structures of data objects.
尽管目前许多新型或改进的算法被提出，但仍然难以找到一种单一的算法可以探索各种数据对象分布结构。
应用推荐