针对高维聚类算法——相交网格划分算法GCOD存在的缺陷,提出了基于密度度量的相交网格划分聚类算法IGCOD。
To overcome the shortcomings of the GCOD, a high-dimensional clustering algorithm for data mining, the paper proposes an intersected grid clustering algorithm based on density estimation (IGCOD).
针对高维聚类算法——相交网格划分算法GCOD存在的缺陷,提出了基于密度度量的相交网格划分聚类算法IGCOD。
To overcome the shortcomings of the GCOD, a high-dimensional clustering algorithm for data mining, the paper proposes an intersected grid clustering algorithm based on density estimation (IGCOD).
应用推荐