计算机科学 ›› 2011, Vol. 38 ›› Issue (8): 179-181.
• 数据库与数据挖掘 • 上一篇 下一篇
柳盛，吉根林，李文俊
出版日期:
发布日期:
基金资助:
LIU Sheng, JI Gen-lin,LI Wen-jun
Online:
Published:
摘要： 目前大多数聚类算法主要针对空间点对象且未考虑空间对象的拓扑关系。利用空间线对象相交关系定义了空间线对象连接度，提出一种基于连接度的空间线对象聚类算法SLCC(Spatial Lines Clustering Algorithm Based on Connectivity)。该算法以K-means算法为基础，以空间线对象的连接度作为“距离”进行空间线对象聚类。实验结果表明，SLCC算法能实现空间线对象的空间聚类，并具有较高的效率。
关键词: 连接度，空间聚类，拓扑关系，线相交
Abstract: At present,most spatial clustering algorithms focus on spatial points without considering spatial topological relations of spatial objects. The spatial line connectivity was defined by line intersection relations. Algorithm SLCC was proposed for clustering spatial lines based on spatial line connectivity. This algorithm, which is based on K-means, selects the spatial line connectivity as the distance between lines to cluster spatial lines. The experiment results show the algorithm is effective and efficient
Key words: Spatial line connectivity,Spatial clustering, Topological rclations,Line intersection
柳盛，吉根林，李文俊. 一种基于连接度的空间线对象聚类算法[J]. 计算机科学, 2011, 38(8): 179-181. https://doi.org/
LIU Sheng, JI Gen-lin,LI Wen-jun. Spatial Lines Clustering Algorithm Based on Connectivity[J]. Computer Science, 2011, 38(8): 179-181. https://doi.org/
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jsjkx.com/CN/
https://www.jsjkx.com/CN/Y2011/V38/I8/179
Cited
首页