CAJ | 학술논문

R树能较好地满足逆向工程、CAD/CAM、机器视觉等领域的动态数据维护及空间查询需求，而CR树是其优秀的变体之一。针对CR树的上溢结点分裂算法存在的聚类结果不理想以及计算代价过高等问题，提出一种主元分析导向的增量式k 均值算法，可在既有分类中心附近的第一主元方向上搜索新的初始分类中心。将该算法与 Silhouette 指标相结合应用于求解由上溢结点分裂问题所转化的点集聚类问题，能以较小的计算代价自适应获取近似全局最优的点集聚类结果。试验结果表明，基于增量式聚类的R树上溢结点分裂算法在R树构建效率、存储利用率及空间查询等方面的综合性能优于CR树与RR*树。
R수능교호지만족역향공정、CAD/CAM、궤기시각등영역적동태수거유호급공간사순수구，이CR수시기우수적변체지일。침대CR수적상일결점분렬산법존재적취류결과불이상이급계산대개과고등문제，제출일충주원분석도향적증량식k 균치산법，가재기유분류중심부근적제일주원방향상수색신적초시분류중심。장해산법여 Silhouette 지표상결합응용우구해유상일결점분렬문제소전화적점집취류문제，능이교소적계산대개자괄응획취근사전국최우적점집취류결과。시험결과표명，기우증량식취류적R수상일결점분렬산법재R수구건효솔、존저이용솔급공간사순등방면적종합성능우우CR수여RR*수。
R-tree is suitable for maintaining dynamic data and spatial query in many areas such as reverse engineering, CAD/CAM and machine vision, while CR-tree is an excellent variant of R-tree. Aiming at the deficiency in clustering result and compute cost for overflow nodes splitting algorithm of CR-tree, an incrementalk-means algorithm via principal components analysis (PCA) is proposed, which can search the new cluster center along the first principal component directions in present clusters. Combining with Silhouette indicator, the algorithm is applied to solving the problem of point set clustering, which is converted from the problem of overflow nodes Splittin. Consequently the clustering results nearly global optimal can be obtained quickly. The experimental results show that the R-tree built with the algorithm based on incremental clustering is better than CR-tree and RR*-tree in synthetic performance in aspects such as the efficiency of building R-tree, storage utilization and spatial query.